Asymptotic Achievability of the CramÉr–Rao Bound for Noisy Compressive Sampling

We consider a model of the form y = Ax + n, where x isin CM is sparse with at most L nonzero coefficients in unknown locations, y isin CN is the observation vector, A isin CN times M is the measurement matrix and n isin CN is the Gaussian noise. We develop a Cramer-Rao bound on the mean squared estimation error of the nonzero elements of x, corresponding to the genie-aided estimator (GAE) which is provided with the locations of the nonzero elements of x. Intuitively, the mean squared estimation error of any estimator without the knowledge of the locations of the nonzero elements of x is no less than that of the GAE. Assuming that L/N is fixed, we establish the existence of an estimator that asymptotically achieves the Cramer-Rao bound without any knowledge of the locations of the nonzero elements of x as N rarr infin , for A a random Gaussian matrix whose elements are drawn i.i.d. according to N (0,1) .

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

[2]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[3]  H. Weiner.  The Gradient Iteration in Time Series Analysis , 1965 .

[4]  Thomas Kailath,et al.  An RKHS approach to detection and estimation problems-II: Gaussian signal detection , 1975, IEEE Trans. Inf. Theory.

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

[6]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

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

[8]  Luca Gemignani,et al.  Iteration schemes for the divide-and-conquer eigenvalue solver , 1994 .

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

[10]  Thomas Kailath,et al.  Some relations among RKHS norms, Fredholm equations, and innovations representations , 1972, IEEE Trans. Inf. Theory.

[11]  Milan Lukić,et al.  Stochastic processes with sample paths in reproducing kernel Hilbert spaces , 2001 .

[12]  H. Vincent Poor,et al.  On generalized signal-to-noise ratios in quadratic detection , 1992, Math. Control. Signals Syst..

[13]  N. Aronszajn.  Theory of Reproducing Kernels. , 1950 .

[14]  Thomas Kailath,et al.  RKHS approach to detection and estimation problems-I: Deterministic signals in Gaussian noise , 1971, IEEE Trans. Inf. Theory.

[15]  M. Melamed.  Detection , 2021, SETI: Astronomy as a Contact Sport.

[16]  K. Phoon,et al.  Implementation of Karhunen-Loeve expansion for simulation using a wavelet-Galerkin scheme , 2002 .

[17]  Harry L. Van Trees,et al.  Detection, Estimation, and Modulation Theory, Part I , 1968 .

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

[19]  H. Vincent Poor,et al.  Detection of Stochastic Processes , 1998, IEEE Trans. Inf. Theory.

[20]  Behtash Babadi,et al.  Fundamental Limits and Constructive Methods for Estimation and Sensing of Sparse Signals , 2011 .

[21]  H. Vincent Poor,et al.  An Introduction to Signal Detection and Estimation , 1994, Springer Texts in Electrical Engineering.

[22]  Haobo Ren.  Functional inverse regression and reproducing kernel Hilbert space , 2006 .

[23]  Ronald Cools,et al.  Advances in multidimensional integration , 2002 .

[24]  Stamatis Cambanis,et al.  Representation of Stochastic Processes of Second Order and Linear Operations , 1973 .

[25]  Thomas Kailath,et al.  An RKHS approach to detection and estimation problems- III: Generalized innovations representations and a likelihood-ratio formula , 1972, IEEE Trans. Inf. Theory.