Memoryless scalar quantization for random frames
From MaRDI portal
Publication:2059810
Abstract: Memoryless scalar quantization (MSQ) is a common technique to quantize frame coefficients of signals (which are used as a model for generalized linear samples), making them compatible with our digital technology. The process of quantization is generally not invertible, and thus one can only recover an approximation to the original signal from its quantized coefficients. The non-linear nature of quantization makes the analysis of the corresponding approximation error challenging, often resulting in the use of a simplifying assumption, called the "white noise hypothesis" (WNH) that simplifies this analysis. However, the WNH is known to be not rigorous and, at least in certain cases, not valid. Given a fixed, deterministic signal, we assume that we use a random frame, whose analysis matrix has independent isotropic sub-Gaussian rows, to collect the measurements, which are consecutively quantized via MSQ. For this setting, the numerically observed decay rate seems to agree with the prediction by the WNH. We rigorously establish sharp non-asymptotic error bounds without using the WNH that explains the observed decay rate. Furthermore, we show that the reconstruction error does not necessarily diminish as redundancy increases. We also extend this approach to the compressed sensing setting, obtaining rigorous error bounds that agree with empirical observations, again, without resorting to the WNH.
Recommendations
- Randomly dithered quantization and sigma-delta noise shaping for finite frames
- Distributed noise-shaping quantization. I: Beta duals of finite frames and near-optimal quantization of random measurements
- Quantized compressed sensing for random circulant matrices
- Frame paths and error bounds for sigma-delta quantization
- Quantization, finite frames, and error diffusion
Cites work
- An improvement of convergence rate estimates in the Lyapunov theorem
- Certifying the Restricted Isometry Property is Hard
- Compressed sensing
- Compressive sampling
- Dequantizing Compressed Sensing: When Oversampling and Non-Gaussian Constraints Combine
- Distributed noise-shaping quantization. I: Beta duals of finite frames and near-optimal quantization of random measurements
- Dithered quantizers
- Error bounds for consistent reconstruction: random polytopes and coverage processes
- From Compressed Sensing to Compressed Bit-Streams: Practical Encoders, Tractable Decoders
- Lattice quantization error for redundant representations
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Noise-shaping quantization methods for frame-based and compressive sampling systems
- Non-asymptotic theory of random matrices: extreme singular values
- On simple oversampled A/D conversion in L/sup 2/(R)
- On the whiteness of high-resolution quantization errors
- One-bit compressed sensing by linear programming
- One-bit compressed sensing with non-Gaussian measurements
- Quantization and compressive sensing
- Quantization and finite frames
- Quantization of compressive samples with stable and robust recovery
- Quantized compressed sensing: a survey
- Quantized compressive sensing with RIP matrices: the benefit of dithering
- Quantized frame expansions with erasures
- Quantized overcomplete expansions in IR/sup N/: analysis, synthesis, and algorithms
- Resilience properties of redundant expansions under additive noise and quantization
- Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sigma-delta (/spl Sigma//spl Delta/) quantization and finite frames
- Sigma-Delta quantization of sub-Gaussian frame expansions and its application to compressed sensing
- Sobolev duals for random frames and \(\varSigma \varDelta \) quantization of compressed sensing measurements
- Sobolev duals in frame theory and Sigma-Delta quantization
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Stabilizing Nonuniformly Quantized Compressed Sensing With Scalar Companders
- Stable signal recovery from incomplete and inaccurate measurements
- Sub-Gaussian random variables
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- The lower bound of the PCM quantization error in high dimensions
- The Performance of PCM Quantization Under Tight Frame Representations
- The restricted isometry property and its implications for compressed sensing
- Universal Rate-Efficient Scalar Quantization
- White Noise Hypothesis for Uniform Quantization Errors
Cited in
(3)
This page was built for publication: Memoryless scalar quantization for random frames
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2059810)
