A Sub-Nyquist Sampling Algorithm for Fractional Bandlimited Signals Based on AIC
Sampling theorems for fractional Fourier bandlimited signals have been developed due to the advantages of the fractional Fourier transformation. It may be difficult to put those theories into practice, because the sampling rate must be no less than twice the maximum fractional "frequency"...
Saved in:
Published in | IEEE transactions on circuits and systems. II, Express briefs Vol. 65; no. 3; pp. 406 - 410 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
IEEE
01.03.2018
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Sampling theorems for fractional Fourier bandlimited signals have been developed due to the advantages of the fractional Fourier transformation. It may be difficult to put those theories into practice, because the sampling rate must be no less than twice the maximum fractional "frequency" of signal. This brief investigates sampling theorems of the fractional bandlimited signal, then introduces a sub-Nyquist sampling method which extends the modulated wideband converter to the fractional Fourier domain by a fractional shift invariant operator. The proposed method can effectively reduce the sampling rate for the fractional multiband signal. The sampled signals can be recovered by a matching pursuit algorithm. Simulation results verify the effectiveness of the proposed algorithm by discussing the robustness, recovery accuracy, and influence of the fractional order. |
---|---|
ISSN: | 1549-7747 1558-3791 |
DOI: | 10.1109/TCSII.2017.2732453 |