Regime Change: Bit-Depth versus Measurement-Rate in Compressive Sensing
arXiv:1110.3450 · doi:10.1109/TSP.2012.2194710
Abstract
The recently introduced compressive sensing (CS) framework enables digital signal acquisition systems to take advantage of signal structures beyond bandlimitedness. Indeed, the number of CS measurements required for stable reconstruction is closer to the order of the signal complexity than the Nyquist rate. To date, the CS theory has focused on real-valued measurements, but in practice, measurements are mapped to bits from a finite alphabet. Moreover, in many potential applications the total number of measurement bits is constrained, which suggests a tradeoff between the number of measurements and the number of bits per measurement. We study this situation in this paper and show that there exist two distinct regimes of operation that correspond to high/low signal-to-noise ratio (SNR). In the measurement compression (MC) regime, a high SNR favors acquiring fewer measurements with more bits per measurement; in the quantization compression (QC) regime, a low SNR favors acquiring more measurements with fewer bits per measurement. A surprise from our analysis and experiments is that in many practical applications it is better to operate in the QC regime, even acquiring as few as 1 bit per measurement.
References in corpus (6)
- Message Passing Algorithms for Compressed Sensing
- Model-Based Compressive Sensing
- Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
- The Pros and Cons of Compressive Sensing for Wideband Signal Acquisition: Noise Folding vs. Dynamic Range
- Frame Permutation Quantization
- Sobolev Duals for Random Frames and Sigma-Delta Quantization of Compressed Sensing Measurements
Cited by in corpus (29)
- The Pros and Cons of Compressive Sensing for Wideband Signal Acquisition: Noise Folding vs. Dynamic Range
- A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion
- Variational Bayesian algorithm for quantized compressed sensing
- Quantized Spectral Compressed Sensing: Cramer-Rao Bounds and Recovery Algorithms
- BiLiMO: Bit-Limited MIMO Radar via Task-Based Quantization
- Analysis-by-Synthesis Quantization for Compressed Sensing Measurements
- Operational Rate-Distortion Performance of Single-source and Distributed Compressed Sensing
- On the SNR Variability in Noisy Compressed Sensing
- Distributed Quantization for Measurement of Correlated Sparse Sources over Noisy Channels
- One-bit compressive sensing with norm estimation
- Image Compression Based on Compressive Sensing: End-to-End Comparison with JPEG
- Compressive Spectrum Sensing for Cognitive Radio Networks
- EXIT Chart Analysis of Turbo Compressed Sensing Using Message Passing De-Quantization
- Towards Optimal Problem Dependent Generalization Error Bounds in Statistical Learning Theory
- Binary Fused Compressive Sensing: 1-Bit Compressive Sensing meets Group Sparsity
- One-Bit Quantization Design and Adaptive Methods for Compressed Sensing
- Minimax Optimal Rates for Poisson Inverse Problems with Physical Constraints
- Optimal Number of Measurements in a Linear System with Quadratically Decreasing SNR
- q-ary Compressive Sensing
- Robust Decoding from Binary Measurements with Cardinality Constraint Least Squares
- Linear signal recovery from -bit-quantized linear measurements: precise analysis of the trade-off between bit depth and number of measurements
- 1-Bit Compressive Sensing: Reformulation and RRSP-Based Sign Recovery Theory
- Distributed Coding of Quantized Random Projections
- Super-Resolution From Binary Measurements With Unknown Threshold
- Performance Bounds for Vector Quantized Compressive Sensing
- Analysis-by-Synthesis-based Quantization of Compressed Sensing Measurements
- Distributed Quantization for Compressed Sensing
- Channel-Optimized Vector Quantizer Design for Compressed Sensing Measurements
- Just Least Squares: Binary Compressive Sampling with Low Generative Intrinsic Dimension