Quantized Spectral Compressed Sensing: Cramer-Rao Bounds and Recovery Algorithms

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.

References in corpus (8)

• Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
• The Convex Geometry of Linear Inverse Problems
• Xampling: Signal Acquisition and Processing in Union of Subspaces
• Robust Spectral Compressed Sensing via Structured Matrix Completion
• Regime Change: Bit-Depth versus Measurement-Rate in Compressive Sensing
• Forward - Backward Greedy Algorithms for Atomic Norm Regularization
• High-dimensional estimation with geometric constraints
• Linear signal recovery from $b$-bit-quantized linear measurements: precise analysis of the trade-off between bit depth and number of measurements

Cited by in corpus (11)

• Harnessing Sparsity over the Continuum: Atomic Norm Minimization for Super Resolution
• A New Atomic Norm for DOA Estimation With Gain-Phase Errors
• Gridless Parameter Estimation for One-Bit MIMO Radar with Time-Varying Thresholds
• Practical Vertical Federated Learning with Unsupervised Representation Learning
• Compressed Super-Resolution of Positive Sources
• Eliminating Impulsive Noise in Pilot-Aided OFDM Channels via Dual of Penalized Atomic Norm
• Grid-less Variational Bayesian Inference of Line Spectral from Quantized Samples
• Grid-less Variational Direction of Arrival Estimation in Heteroscedastic Noise Environment
• Direction Finding of Electromagnetic Sources on a Sparse Cross-Dipole Array Using One-Bit Measurements
• Parameter Estimation on Homogeneous Spaces
• Gridless Variational Bayesian Channel Estimation for Antenna Array Systems with Low Resolution ADCs