2023
DOI: 10.2139/ssrn.4406759
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Robust Unlimited Sampling Beyond Modulo

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
6
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1
1
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(6 citation statements)
references
References 0 publications
0
6
0
Order By: Relevance
“…Due to modulo folding, y λ (t) is no longer bandlimited. To recover y(t) while sampling slightly above the Nyquist rate of the input, one first applies an unfolding algorithm to recover y(nT s ) from y λ (nT s ) [10,11,26]. Then y(t) is reconstructed from y(nT s ) by assuming that the sampling is performed above the Nyquist rate.…”
Section: Signal Model and System Descriptionmentioning
confidence: 99%
See 4 more Smart Citations
“…Due to modulo folding, y λ (t) is no longer bandlimited. To recover y(t) while sampling slightly above the Nyquist rate of the input, one first applies an unfolding algorithm to recover y(nT s ) from y λ (nT s ) [10,11,26]. Then y(t) is reconstructed from y(nT s ) by assuming that the sampling is performed above the Nyquist rate.…”
Section: Signal Model and System Descriptionmentioning
confidence: 99%
“…The unfolding operation is implemented in the digital domain, and it should operate at the lowest possible sampling rate. To this end, we use the B 2 R 2 algorithm for unfolding [10,11], which samples efficiently compared to other algorithms for bandlimited signals. Low-rate sampling and low-dynamic range requirements significantly reduce the power consumption and cost of the ADC.…”
Section: Signal Model and System Descriptionmentioning
confidence: 99%
See 3 more Smart Citations