Quantized Spectral Compressed Sensing: Cramer–Rao Bounds and Recovery Algorithms
Authors:
- 17 April 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 66 (12) , 3268-3279
Abstract
Efficient estimation of wideband spectrum is of great importance for applications such as cognitive radio. Recently, sub-Nyquist sampling schemes based on compressed sensing have been proposed to greatly reduce the sampling rate. However, the important issue of quantization has not been fully addressed, particularly, for high resolution spectrum and parameter estimation. In this paper, we aim to recover spectrally sparse signals and the corresponding parameters, such as frequency and amplitudes, from heavy quantizations of their noisy complex-valued random linear measurements, e.g., only the quadrant information. We first characterize the Cramer-Rao bound under Gaussian noise, which highlights the trade-off between sample complexity and bit depth under different signal-to-noise ratios for a fixed budget of bits. Next, we propose a new algorithm based on atomic norm soft thresholding for signal recovery, which is equivalent to proximal mapping of properly designed surrogate signals with respect to the atomic norm that motivates spectral sparsity. The proposed algorithm can be applied to both the single measurement vector case, as well as the multiple measurement vector case. It is shown that under the Gaussian measurement model, the spectral signals can be reconstructed accurately with high probability, as soon as the number of quantized measurements exceeds the order of K log n, where K is the level of spectral sparsity and n is the signal dimension. Finally, numerical simulations are provided to validate the proposed approaches.Keywords
All Related Versions
Funding Information
- NSF (ECCS-1462191, CCF-1527456, ECCS-1818571)
- ONR (N00014-15-1-2387)
- AFOSR (FA9550-15-1-0205)
This publication has 40 references indexed in Scilit:
- Fast and Reliable Parameter Estimation from Nonlinear ObservationsSIAM Journal on Optimization, 2017
- High-dimensional estimation with geometric constraints: Table 1.Information and Inference: A Journal of the IMA, 2016
- The Generalized Lasso With Non-Linear ObservationsIEEE Transactions on Information Theory, 2016
- Quantization and Compressive Sensing2015
- Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse VectorsIEEE Transactions on Information Theory, 2013
- Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming ApproachIEEE Transactions on Information Theory, 2012
- Regime Change: Bit-Depth Versus Measurement-Rate in Compressive SensingIEEE Transactions on Signal Processing, 2012
- Democracy in action: Quantization, saturation, and compressive sensingApplied and Computational Harmonic Analysis, 2011
- Complex-Valued Signal Processing: The Proper Way to Deal With ImproprietyIEEE Transactions on Signal Processing, 2011
- Effects of sampling and quantization on single-tone frequency estimationIEEE Transactions on Signal Processing, 2000