Title :
Compression Limits for Random Vectors with Linearly Parameterized Second-Order Statistics
Author :
Romero, Daniel ; Lopez-Valcarce, Roberto ; Leus, Geert
Author_Institution :
Dept. of Signal Theor. & Commun., Univ. of Vigo, Vigo, Spain
Abstract :
The class of complex random vectors whose covariance matrix is linearly parameterized by a basis of Hermitian Toeplitz (HT) matrices is considered, and the maximum compression ratios that preserve all second-order information are derived-the statistics of the uncompressed vector must be recoverable from a set of linearly compressed observations. This kind of vectors arises naturally when sampling wide-sense stationary random processes and features a number of applications in signal and array processing. Explicit guidelines to design optimal and nearly optimal schemes operating both in a periodic and nonperiodic fashion are provided by considering two of the most common linear compression schemes, which we classify as dense or sparse. It is seen that the maximum compression ratios depend on the structure of the HT subspace containing the covariance matrix of the uncompressed observations. Compression patterns attaining these maximum ratios are found for the case without structure as well as for the cases with circulant or banded structure. Universal samplers are also proposed to compress unknown HT subspaces.
Keywords :
Hermitian matrices; Toeplitz matrices; array signal processing; covariance matrices; higher order statistics; random processes; signal sampling; Hermitian Toeplitz matrices; Hermitian Toeplitz subspace; array processing; banded structure; circulant structure; complex random vectors; compression limits; compression patterns; covariance matrix; linear compression schemes; linearly parameterized second-order statistics; maximum compression ratios; nonperiodic fashion; second order information; signal processing; uncompressed vector; universal samplers; wide-sense stationary random process; Abstracts; Arrays; Covariance matrices; Estimation; Reconstruction algorithms; Sparse matrices; Vectors; Compression Matrix Design; Compressive Covariance Sensing; Compressive covariance sensing; Covariance Matching; compression matrix design; covariance matching;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2015.2394784