On the Achievability of Cramér–Rao Bound in Noisy Compressed Sensing

Recently, it has been proved in Babadi [B. Babadi, N. Kalouptsidis, and V. Tarokh, “Asymptotic achievability of the Cramér-Rao bound for noisy compressive sampling,” IEEE Trans. Signal Process., vol. 57, no. 3, pp. 1233-1236, 2009] that in noisy compressed sensing, a joint typical estimator can asymptotically achieve the Cramér-Rao lower bound of the problem. To prove this result, Babadi used a lemma, which is provided in Akçakaya and Tarokh [M. Akçakaya and V. Trarokh, “Shannon theoretic limits on noisy compressive sampling,” IEEE Trans. Inf. Theory, vol. 56, no. 1, pp. 492-504, 2010] that comprises the main building block of the proof. This lemma is based on the assumption of Gaussianity of the measurement matrix and its randomness in the domain of noise. In this correspondence, we generalize the results obtained in Babadi by dropping the Gaussianity assumption on the measurement matrix. In fact, by considering the measurement matrix as a deterministic matrix in our analysis, we find a theorem similar to the main theorem of Babadi for a family of randomly generated (but deterministic in the noise domain) measurement matrices that satisfy a generalized condition known as “the concentration of measures inequality.” By this, we finally show that under our generalized assumptions, the Cramér-Rao bound of the estimation is achievable by using the typical estimator introduced in Babadi et al.

[1]  Christian Jutten,et al.  ISI sparse channel estimation based on SL0 and its application in ML sequence-by-sequence equalization , 2012, Signal Process..

[2]  Yonina C. Eldar,et al.  The Cramér-Rao Bound for Estimating a Sparse Parameter Vector , 2010, IEEE Transactions on Signal Processing.

[3]  Vahid Tarokh,et al.  Asymptotic Achievability of the CramÉr–Rao Bound for Noisy Compressive Sampling , 2009, IEEE Transactions on Signal Processing.

[4]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[5]  J. Tropp,et al.  CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, Commun. ACM.

[6]  Muralidhar Rangaswamy,et al.  Robust adaptive signal processing methods for heterogeneous radar clutter scenarios , 2004, Signal Process..

[7]  Fulvio Gini,et al.  Covariance matrix estimation for CFAR detection in correlated heavy tailed clutter , 2002, Signal Process..

[8]  Christian Jutten,et al.  A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm , 2008, IEEE Transactions on Signal Processing.

[9]  E.J. Candes.  Compressive Sampling , 2022 .

[10]  S. Kay.  Fundamentals of statistical signal processing: estimation theory , 1993 .

[11]  R. DeVore,et al.  A Simple Proof of the Restricted Isometry Property for Random Matrices , 2008 .

[12]  Philippe Forster,et al.  First- and Second-Order Moments of the Normalized Sample Covariance Matrix of Spherically Invariant Random Vectors , 2007, IEEE Signal Processing Letters.

[13]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[14]  Mike E. Davies,et al.  Gradient Pursuits , 2008, IEEE Transactions on Signal Processing.

[15]  Robert D. Nowak,et al.  Signal Reconstruction From Noisy Random Projections , 2006, IEEE Transactions on Information Theory.

[16]  Deanna Needell,et al.  CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.

[17]  Jutten Christian,et al.  An Alternating Minimization Method for Sparse Channel Estimation , 2010 .

[18]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

[19]  D. Donoho,et al.  Atomic Decomposition by Basis Pursuit , 2001 .

[20]  Martin Vetterli,et al.  Compressive Sampling [From the Guest Editors] , 2008, IEEE Signal Processing Magazine.

[21]  Bhaskar D. Rao,et al.  Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm , 1997, IEEE Trans. Signal Process..

[22]  Urbashi Mitra,et al.  Sparse Channel Estimation with Zero Tap Detection , 2007, IEEE Transactions on Wireless Communications.

[23]  Yaakov Tsaig,et al.  Extensions of compressed sensing , 2006, Signal Process..

[24]  JuttenChristian,et al.  A fast approach for overcomplete sparse decomposition based on smoothed l0 norm , 2009 .

[25]  Torben Hagerup,et al.  A Guided Tour of Chernoff Bounds , 1990, Inf. Process. Lett..

[26]  John G. Proakis,et al.  Probability, random variables and stochastic processes , 1985, IEEE Trans. Acoust. Speech Signal Process..

[27]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.

[28]  Urbashi Mitra,et al.  Sparse channel estimation with zero tap detection , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[29]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[30]  K.Venkatesh Prasad,et al.  Fundamentals of statistical signal processing: Estimation theory: by Steven M. KAY; Prentice Hall signal processing series; Prentice Hall; Englewood Cliffs, NJ, USA; 1993; xii + 595 pp.; $65; ISBN: 0-13-345711-7 , 1994 .

[31]  Robert D. Nowak,et al.  Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation , 2010, IEEE Transactions on Information Theory.

[32]  Dimitris Achlioptas,et al.  Database-friendly random projections: Johnson-Lindenstrauss with binary coins , 2003, J. Comput. Syst. Sci..

[33]  Giuseppe Ricci,et al.  Recursive estimation of the covariance matrix of a compound-Gaussian process and its application to adaptive CFAR detection , 2002, IEEE Trans. Signal Process..

[34]  D. Donoho.  For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution , 2006 .

[35]  Vahid Tarokh,et al.  Shannon-Theoretic Limits on Noisy Compressive Sampling , 2007, IEEE Transactions on Information Theory.

[36]  Richard G. Baraniuk,et al.  Detection and estimation with compressive measurements , 2006 .

[37]  G. Jourdain,et al.  "Principal component inverse" algorithm for detection in the presence of reverberation , 2002 .

[38]  Yang Yuan,et al.  Simple and Near-Optimal Mechanisms for Market Intermediation , 2014, WINE.

[39]  Philippe Forster,et al.  Performance Analysis of Covariance Matrix Estimates in Impulsive Noise , 2008, IEEE Transactions on Signal Processing.

[40]  Bruno O. Shubert,et al.  Random variables and stochastic processes , 1979 .

[41]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[42]  Charles F. Hockett,et al.  A mathematical theory of communication , 1948, MOCO.

[43]  Terence Tao,et al.  The Dantzig selector: Statistical estimation when P is much larger than n , 2005, math/0506081.