Message-Passing Estimation from Quantized Samples

Abstract

Estimation of a vector from quantized linear measurements is a common problem for which simple linear techniques are suboptimal -- sometimes greatly so. This paper develops generalized approximate message passing (GAMP) algorithms for minimum mean-squared error estimation of a random vector from quantized linear measurements, notably allowing the linear expansion to be overcomplete or undercomplete and the scalar quantization to be regular or non-regular. GAMP is a recently-developed class of algorithms that uses Gaussian approximations in belief propagation and allows arbitrary separable input and output channels. Scalar quantization of measurements is incorporated into the output channel formalism, leading to the first tractable and effective method for high-dimensional estimation problems involving non-regular scalar quantization. Non-regular quantization is empirically demonstrated to greatly improve rate-distortion performance in some problems with oversampling or with undersampling combined with a sparsity-inducing prior. Under the assumption of a Gaussian measurement matrix with i.i.d. entries, the asymptotic error performance of GAMP can be accurately predicted and tracked through the state evolution formalism. We additionally use state evolution to design MSE-optimal scalar quantizers for GAMP signal reconstruction and empirically demonstrate the superior error performance of the resulting quantizers.

12 pages, 8 figures

References in corpus (1)

• Optimal Quantization for Compressive Sensing under Message Passing Reconstruction

Cited by in corpus (23)

• AMP-Inspired Deep Networks for Sparse Linear Inverse Problems
• Adaptive Damping and Mean Removal for the Generalized Approximate Message Passing Algorithm
• A Unified Bayesian Inference Framework for Generalized Linear Models
• Parametric Bilinear Generalized Approximate Message Passing
• Generalized Approximate Message Passing for Estimation with Random Linear Mixing
• Consistent Basis Pursuit for Signal and Matrix Estimates in Quantized Compressed Sensing
• Sparse Estimation with the Swept Approximated Message-Passing Algorithm
• Random Access in C-RAN for User Activity Detection with Limited-Capacity Fronthaul
• Binary Linear Classification and Feature Selection via Generalized Approximate Message Passing
• Analysis-by-Synthesis Quantization for Compressed Sensing Measurements
• Optimal Data Detection in Large MIMO
• Channel Estimation in Broadband Millimeter Wave MIMO Systems with Few-Bit ADCs
• Estimation from Quantized Gaussian Measurements: When and How to Use Dither
• Information-Theoretically Optimal Compressed Sensing via Spatial Coupling and Approximate Message Passing
• Accurate Prediction of Phase Transitions in Compressed Sensing via a Connection to Minimax Denoising
• EXIT Chart Analysis of Turbo Compressed Sensing Using Message Passing De-Quantization
• Fixed Points of Generalized Approximate Message Passing with Arbitrary Matrices
• Hybrid Architectures with Few-Bit ADC Receivers: Achievable Rates and Energy-Rate Tradeoffs
• Inference for Generalized Linear Models via Alternating Directions and Bethe Free Energy Minimization
• Expectation Propagation based Line Spectral Estimation
• Taking the edge off quantization: projected back projection in dithered compressive sensing
• Generalized Approximate Message Passing for Unlimited Sampling of Sparse Signals
• Limited Feedback in Multiple-Antenna Systems with One-Bit Quantization