Cramér–Rao Bound for Sparse Signals Fitting the Low-Rank Model with Small Number of Parameters

In this letter, we consider signals with a low-rank covariance matrix which reside in a low-dimensional subspace and can be written in terms of a finite (small) number of parameters. Although such signals do not necessarily have a sparse representation in a finite basis, they possess a sparse structure which makes it possible to recover the signal from compressed measurements. We study the statistical performance bound for parameter estimation in the low-rank signal model from compressed measurements. Specifically, we derive the Cramér-Rao bound (CRB) for a generic low-rank model and we show that the number of compressed samples needs to be larger than the number of sources for the existence of an unbiased estimator with finite estimation variance. We further consider the applications to direction-of-arrival (DOA) and spectral estimation which fit into the low-rank signal model. We also investigate the effect of compression on the CRB by considering numerical examples of the DOA estimation scenario, and show how the CRB increases by increasing the compression or equivalently reducing the number of compressed samples.

[1]  Upamanyu Madhow,et al.  Compressive estimation in AWGN: General observations and a case study , 2012, 2012 Conference Record of the Forty Sixth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).

[2]  Sergiy A. Vorobyov,et al.  Segmented Compressed Sampling for Analog-to-Information Conversion: Method and Performance Analysis , 2010, IEEE Transactions on Signal Processing.

[3]  Gongguo Tang,et al.  Lower Bounds on the Mean-Squared Error of Low-Rank Matrix Reconstruction , 2011, IEEE Transactions on Signal Processing.

[4]  Upamanyu Madhow,et al.  Compressive Parameter Estimation in AWGN , 2014, IEEE Transactions on Signal Processing.

[5]  Thomas L. Marzetta,et al.  Detection, Estimation, and Modulation Theory , 1976 .

[6]  A. Robert Calderbank,et al.  Sensitivity to Basis Mismatch in Compressed Sensing , 2011, IEEE Trans. Signal Process..

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

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

[9]  Sergiy A. Vorobyov,et al.  Reweighted l1-norm penalized LMS for sparse channel estimation and its analysis , 2014, Signal Process..

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

[11]  Yonina C. Eldar,et al.  Sub-Nyquist Sampling: Bridging Theory and Practice , 2011, ArXiv.

[12]  Stephen P. Boyd,et al.  Enhancing Sparsity by Reweighted ℓ1 Minimization , 2007, 0711.1612.

[13]  H. V. Trees Detection, Estimation, And Modulation Theory , 2001 .

[14]  Petre Stoica,et al.  MUSIC, maximum likelihood, and Cramer-Rao bound , 1989, IEEE Transactions on Acoustics, Speech, and Signal Processing.

[15]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[16]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

[17]  Mário A. T. Figueiredo,et al.  Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems , 2007, IEEE Journal of Selected Topics in Signal Processing.

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

[19]  Thomas L. Marzetta,et al.  Parameter estimation problems with singular information matrices , 2001, IEEE Trans. Signal Process..

[20]  Fuzhen Zhang The Schur complement and its applications , 2005 .

[21]  Richard G. Baraniuk,et al.  Random Projections of Smooth Manifolds , 2009, Found. Comput. Math..

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

[23]  Justin K. Romberg,et al.  Compressed Subspace Matching on the Continuum , 2014, ArXiv.

[24]  Hai Jiang,et al.  Performance Limits of Segmented Compressive Sampling: Correlated Measurements Versus Bits , 2014, IEEE Transactions on Signal Processing.

[25]  B. C. Ng,et al.  On the Cramer-Rao bound under parametric constraints , 1998, IEEE Signal Processing Letters.

[26]  Yonina C. Eldar,et al.  Xampling: Signal Acquisition and Processing in Union of Subspaces , 2009, IEEE Transactions on Signal Processing.

[27]  Ali Pezeshki,et al.  Threshold Effects in Parameter Estimation From Compressed Data , 2013, IEEE Transactions on Signal Processing.

[28]  Hai Jiang,et al.  Performance Limits of Segmented Compressive Sampling: Correlated Samples versus Bits , 2014, ArXiv.

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

[30]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[31]  Richard G. Baraniuk,et al.  Theory and Implementation of an Analog-to-Information Converter using Random Demodulation , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[32]  Sergiy A. Vorobyov,et al.  Improved model-based spectral compressive sensing via nested least squares , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[33]  Alfred O. Hero,et al.  Lower bounds for parametric estimation with constraints , 1990, IEEE Trans. Inf. Theory.

[34]  Yonina C. Eldar,et al.  Sub-Nyquist Sampling , 2011, IEEE Signal Processing Magazine.

[35]  Yuejie Chi,et al.  Analysis of fisher information and the Cramer-Rao bound for nonlinear parameter estimation after compressed sensing , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

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

[37]  Sergiy A. Vorobyov,et al.  Reweighted l1-norm penalized LMS for sparse channel estimation and its analysis , 2014, Signal Process..