Folded sampling replaces clipping in analog-to-digital converters by reducing samples modulo a threshold, thereby avoiding saturation artifacts. We study the reconstruction of bandlimited functions from folded samples and show that, for equispaced sampling patterns, the recovery problem is inherently unstable. We then prove that imposing any a priori energy bound restores stability, and that this regularization effect extends to non-uniform sampling geometries. Our analysis recasts folded-sampling stability as an infinite-dimensional lattice shortest-vector problem, which we resolve via harmonic-analytic tools (the spectral profile of Fourier concentration matrices) and, alternatively, via bounds for integer Tschebyschev polynomials. Our work brings context to recent results on injectivity and encoding guarantees for folded sampling and further supports the empirical success of folded sampling under natural energy constraints.

翻译：暂无翻译