Shannon-Theoretic Limits on Noisy Compressive Sampling

From MaRDI portal



Abstract: In this paper, we study the number of measurements required to recover a sparse signal in mathbbCM with L non-zero coefficients from compressed samples in the presence of noise. For a number of different recovery criteria, we prove that O(L) (an asymptotically linear multiple of L) measurements are necessary and sufficient if L grows linearly as a function of M. This improves on the existing literature that is mostly focused on variants of a specific recovery algorithm based on convex programming, for which O(Llog(M−L)) measurements are required. We also show that O(Llog(M−L)) measurements are required in the sublinear regime (L=o(M)).













This page was built for publication: Shannon-Theoretic Limits on Noisy Compressive Sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976066)