Above the Nyquist Rate, Modulo Folding Does Not Hurt

March 28, 2019 Β· Declared Dead Β· πŸ› IEEE Signal Processing Letters

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Elad Romanov, Or Ordentlich arXiv ID 1903.12289 Category cs.IT: Information Theory Cross-listed eess.SP Citations 65 Venue IEEE Signal Processing Letters Last Checked 5 months ago
Abstract
We consider the problem of recovering a continuous-time bandlimited signal from the discrete-time signal obtained from sampling it every $T_s$ seconds and reducing the result modulo $Ξ”$, for some $Ξ”>0$. For $Ξ”=\infty$ the celebrated Shannon-Nyquist sampling theorem guarantees that perfect recovery is possible provided that the sampling rate $1/T_s$ exceeds the so-called 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 rate by a factor of $Ο€e$. In this letter we improve upon this result and show that for finite energy signals, perfect recovery is possible for any $Ξ”>0$ and any sampling rate above the Nyquist rate. Thus, modulo folding does not degrade the signal, provided that the sampling rate exceeds the Nyquist rate. This claim is proved by establishing a connection between the recovery problem of a discrete-time signal from its modulo reduced version and the problem of predicting the next sample of a discrete-time signal from its past, and leveraging the fact that for a bandlimited signal the prediction error can be made arbitrarily small.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted