Near-optimal encoding for sigma-delta quantization of finite frame expansions

DOI10.1007/S00041-013-9295-0zbMATH Open1304.42073arXiv1307.2136OpenAlexW2035602493MaRDI QIDQ485203FDOQ485203

Authors: Rayan Saab, M. A. Iwen 

Publication date: 9 January 2015

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

Abstract: In this paper we investigate encoding the bit-stream resulting from coarse Sigma-Delta quantization of finite frame expansions (i.e., overdetermined representations) of vectors. We show that for a wide range of finite-frames, including random frames and piecewise smooth frames, there exists a simple encoding algorithm ---acting only on the Sigma-Delta bit stream--- and an associated decoding algorithm that together yield an approximation error which decays exponentially in the number of bits used. The encoding strategy consists of applying a discrete random operator to the Sigma-Delta bit stream and assigning a binary codeword to the result. The reconstruction procedure is essentially linear and equivalent to solving a least squares minimization problem.

Full work available at URL: https://arxiv.org/abs/1307.2136

Recommendations

• Frame paths and error bounds for sigma-delta quantization
• Error analysis of arbitrary order Sigma-Delta quantization for the finite tight frames
• High-order low-bit Sigma-Delta quantization for fusion frames
• Quantization and finite frames
• Complex sigma-delta quantization algorithms for finite frames

zbMATH Keywords

random matricesvector quantizationrate-distortion theoryframe theoryoverdetermined systemspseudoinverses

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Random matrices (algebraic aspects) (15B52) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) General harmonic expansions, frames (42C15) Rate-distortion theory in information and communication theory (94A34)

Cites Work

• Distribution of the Ratio of the Mean Square Successive Difference to the Variance
• Extensions of Lipschitz mappings into a Hilbert space
• An elementary proof of a theorem of Johnson and Lindenstrauss
• A simple proof of the restricted isometry property for random matrices
• A mathematical introduction to compressive sensing
• Sigma-delta (/spl Sigma//spl Delta/) quantization and finite frames
• Title not available (Why is that?)
• New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
• Approximating a bandlimited function using very coarsely quantized data: a family of stable sigma-delta modulators of arbitrary order
• The Johnson-Lindenstrauss lemma and the sphericity of some graphs
• Sobolev duals for random frames and \(\varSigma \varDelta \) quantization of compressed sensing measurements
• An optimal family of exponentially accurate one-bit sigma-delta quantization schemes
• New properties of sigma-delta modulators with DC inputs
• One-bit sigma-delta quantization with exponential accuracy
• On the robustness of single-loop sigma-delta modulation
• Finite Frames and Filter Banks
• Sigma-Delta quantization of sub-Gaussian frame expansions and its application to compressed sensing
• Root-Exponential Accuracy for Coarse Quantization of Finite Frame Expansions
• Sobolev duals in frame theory and Sigma-Delta quantization

Cited In (19)

• Dynamical dual frames with an application to quantization
• Frame paths and error bounds for sigma-delta quantization
• The Performance of PCM Quantization Under Tight Frame Representations
• Quasi-finite-rank approximation of compression operators in sampled-data systems and time-delay systems
• Quantization and compressive sensing
• Sigma delta quantization with harmonic frames and partial Fourier ensembles
• Distributed noise-shaping quantization. I: Beta duals of finite frames and near-optimal quantization of random measurements
• Quantization of compressive samples with stable and robust recovery
• On the \(\ell^\infty\)-norms of the singular vectors of arbitrary powers of a difference matrix with applications to sigma-delta quantization
• Smooth frame-path termination for higher order sigma-delta quantization
• Sigma-Delta quantization of sub-Gaussian frame expansions and its application to compressed sensing
• Root-Exponential Accuracy for Coarse Quantization of Finite Frame Expansions
• Sigma-delta quantization errors and the traveling salesman problem
• Quantization and finite frames
• Adapted decimation on finite frames for arbitrary orders of sigma-delta quantization
• High-order low-bit Sigma-Delta quantization for fusion frames
• Alternative dual frames for digital-to-analog conversion in sigma-delta quantization
• Performance of Sigma–Delta Quantizations in Finite Frames
• Direct projection decoding algorithm for sigma-delta modulated signals

This page was built for publication: Near-optimal encoding for sigma-delta quantization of finite frame expansions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q485203)