Compressive Detection of Random Subspace Signals
arXiv:1507.02999 · doi:10.1109/TSP.2016.2560132
Abstract
The problem of compressive detection of random subspace signals is studied. We consider signals modeled as where is an matrix with and . We say that signal lies in or leans toward a subspace if the largest eigenvalue of is strictly greater than its smallest eigenvalue. We first design a measurement matrix comprising of two sub-matrices and where projects the signals to the strongest left-singular vectors, i.e., the left-singular vectors corresponding to the largest singular values, of subspace matrix and projects it to the weakest left-singular vectors. We then propose two detectors which work based on the difference in energies of the samples measured by two sub-matrices and and prove their optimality. Simplified versions of the proposed detectors for the case when the variance of noise is known are also provided. Furthermore, we study the performance of the detector when measurements are imprecise and show how imprecision can be compensated by employing more measurement devices. The problem is then re-formulated for the case when the signal lies in the union of a finite number of linear subspaces instead of a single linear subspace. Finally, we study the performance of the proposed methods by simulation examples.
arXiv comment33 pages, 11 figures, Revised version
References in corpus (6)
- From Theory to Practice: Sub-Nyquist Sampling of Sparse Wideband Analog Signals
- Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
- Xampling: Signal Acquisition and Processing in Union of Subspaces
- Compressed Beamforming in Ultrasound Imaging
- Measurement Matrix Design for Compressive Sensing Based MIMO Radar
- Covariance-Based OFDM Spectrum Sensing with Sub-Nyquist Samples