2019
DOI: 10.1109/lsp.2019.2923835
|View full text |Cite
|
Sign up to set email alerts
|

Above the Nyquist Rate, Modulo Folding Does Not Hurt

Abstract: We consider the problem of recovering a continuoustime bandlimited signal from the discrete-time signal obtained from sampling it every Ts seconds and reducing the result modulo ∆, for some ∆ > 0. For ∆ = ∞ the celebrated Shannon-Nyquist sampling theorem guarantees that perfect recovery is possible provided that the sampling rate 1/Ts exceeds the socalled Nyquist rate. Recent work by Bhandari et al. has shown that for any ∆ > 0 perfect reconstruction is still possible if the sampling rate exceeds the Nyquist r… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
49
0

Year Published

2021
2021
2025
2025

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 46 publications
(49 citation statements)
references
References 13 publications
0
49
0
Order By: Relevance
“…The sampling frequency should be at least twice the highest frequency contained in the signal. The Shannon-Nyquist sampling theorem [13] guarantees that any signal whose Fourier transform is supported on this bandwidth limit can be entirely reconstructed from the discrete-time signal as long as the frequency rate is at least twice this bandwidth limit, as illustrated by the following equation [32]:…”
Section: Resampling In Signature Verificationmentioning
confidence: 99%
“…The sampling frequency should be at least twice the highest frequency contained in the signal. The Shannon-Nyquist sampling theorem [13] guarantees that any signal whose Fourier transform is supported on this bandwidth limit can be entirely reconstructed from the discrete-time signal as long as the frequency rate is at least twice this bandwidth limit, as illustrated by the following equation [32]:…”
Section: Resampling In Signature Verificationmentioning
confidence: 99%
“…Recently, the limited dynamic range problem in analog-todigital conversion has been partially addressed under the socalled unlimited sampling framework [19], showing that the Shannon-Nyquist sampling theorem also holds under a finite dynamic range constraint [20]. That is, a band-limited analog signal can be perfectly reconstructed from the discrete-time finite dynamic range signal resulting from folding the analog signal via a modulo operation, so that no clipping errors occur, before sampling under the Shannon-Nyquist condition.…”
Section: A Modulo-adc Benefitsmentioning
confidence: 99%
“…That is, a band-limited analog signal can be perfectly reconstructed from the discrete-time finite dynamic range signal resulting from folding the analog signal via a modulo operation, so that no clipping errors occur, before sampling under the Shannon-Nyquist condition. Unfortunately, although the proofs in [19], [20] are constructive in the sense of providing algorithms for perfectly recovering the original continuous-time signal from the folded discretetime signal, they break under quantization errors which are always present in ADCs. In other words, the results in [19], [20] cannot be directly used since, on top of sampling, a quantization operation is always performed by an ADC to convert the analog input signal to a discrete-time discretevalued digital signal.…”
Section: A Modulo-adc Benefitsmentioning
confidence: 99%
See 1 more Smart Citation
“…Recently, unlimited sampling framework with modulo sampling hardware was developed in [1]- [4]. Specifically, for a given x ∈ R and ∆ > 0, the modulo operation is defined as [1], [5] x…”
Section: Introductionmentioning
confidence: 99%