Generalized Nested Sampling for Compressing Low Rank Toeplitz Matrices

This paper considers the problem of compressively sampling wide sense stationary random vectors with a low rank Toeplitz correlation matrix. A new structured deterministic sampling method known as the “Generalized Nested Sampling” (GNS) is used to fully exploit the inherent redundancy of low rank Toeplitz matrices. For a Toeplitz matrix of size N ×N with rank r, this sampling scheme uses only O(√r) measurements and allows exact recovery from noiseless measurements. This compression factor is independent of N and is shown to be larger than that achieved by existing random sampling based techniques for compressing Toeplitz matrices. The recovery procedure exploits the connection between Toeplitz matrices and linear prediction.

[1]  Yaniv Plan,et al.  Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach , 2012, IEEE Transactions on Information Theory.

[2]  U. Grenander,et al.  Toeplitz Forms And Their Applications , 1958 .

[3]  Andrea J. Goldsmith,et al.  Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming , 2013, IEEE Transactions on Information Theory.

[4]  Björn E. Ottersten,et al.  Structured covariance matrix estimation: a parametric approach , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[5]  D. Luenberger,et al.  Estimation of structured covariance matrices , 1982, Proceedings of the IEEE.

[6]  Parikshit Shah,et al.  Compressed Sensing Off the Grid , 2012, IEEE Transactions on Information Theory.

[7]  P. P. Vaidyanathan,et al.  Nested Arrays: A Novel Approach to Array Processing With Enhanced Degrees of Freedom , 2010, IEEE Transactions on Signal Processing.

[8]  Zhi Ding,et al.  Blind MIMO channel identification from second order statistics using rank deficient channel convolution matrix , 2003, IEEE Trans. Signal Process..

[9]  David Gross,et al.  Recovering Low-Rank Matrices From Few Coefficients in Any Basis , 2009, IEEE Transactions on Information Theory.

[10]  Emmanuel J. Candès,et al.  The Power of Convex Relaxation: Near-Optimal Matrix Completion , 2009, IEEE Transactions on Information Theory.

[11]  Geert Leus,et al.  Wideband Spectrum Sensing From Compressed Measurements Using Spectral Prior Information , 2013, IEEE Transactions on Signal Processing.

[12]  Geert Leus,et al.  Compression Limits for Random Vectors with Linearly Parameterized Second-Order Statistics , 2013, IEEE Transactions on Information Theory.

[13]  Brian M. Sadler,et al.  Cyclic Feature Detection With Sub-Nyquist Sampling for Wideband Spectrum Sensing , 2012, IEEE Journal of Selected Topics in Signal Processing.

[14]  Parikshit Shah,et al.  Sketching Sparse Matrices, Covariances, and Graphs via Tensor Products , 2015, IEEE Transactions on Information Theory.

[15]  Piya Pal,et al.  Generalized nested sampling for compression and exact recovery of symmetric Toeplitz matrices , 2014, 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

[16]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2009, Found. Comput. Math..