Lower bounds for the error decay incurred by coarse quantization schemes

DOI10.1016/J.ACHA.2011.06.003zbMATH Open1236.94031arXiv1004.3517OpenAlexW2963638790MaRDI QIDQ654451FDOQ654451

Authors: Felix Krahmer, Rachel Ward 

Publication date: 28 December 2011

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Abstract: Several analog-to-digital conversion methods for bandlimited signals used in applications, such as Sigma Delta quantization schemes, employ coarse quantization coupled with oversampling. The standard mathematical model for the error accrued from such methods measures the performance of a given scheme by the rate at which the associated reconstruction error decays as a function of the oversampling ratio L > 1. It was recently shown that exponential accuracy of the form O(2(-r L)) can be achieved by appropriate one-bit Sigma Delta modulation schemes. However, the best known achievable rate constants r in this setting differ significantly from the general information theoretic lower bound. In this paper, we provide the first lower bound specific to coarse quantization, thus narrowing the gap between existing upper and lower bounds. In particular, our results imply a quantitative correspondence between the maximal signal amplitude and the best possible error decay rate. Our method draws from the theory of large deviations.

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

Recommendations

• One-bit sigma-delta quantization with exponential accuracy
• An optimal family of exponentially accurate one-bit sigma-delta quantization schemes
• Approximating a bandlimited function using very coarsely quantized data: a family of stable sigma-delta modulators of arbitrary order
• Approximating a bandlimited function using very coarsely quantized data: Improved error estimates in sigma-delta modulation
• Lower bound on the mean-squared error in oversampled quantization of periodic signals using vector quantization analysis

zbMATH Keywords

entropylarge deviationscoarse quantizationerror decay rate

Mathematics Subject Classification ID

Large deviations (60F10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Measures of information, entropy (94A17) Sampling theory in information and communication theory (94A20)

Cites Work

• Title not available (Why is that?)
• Tutorial on large deviations for the binomial distribution
• Extremal properties of sums of Bernoulli random variables.
• An optimal family of exponentially accurate one-bit sigma-delta quantization schemes
• One-bit sigma-delta quantization with exponential accuracy
• The pros and cons of democracy
• On Optimal Perfect Reconstruction Feedback Quantizers

Cited In (14)

• One-bit sigma-delta modulation on the circle
• Enhanced Digital Halftoning via Weighted Sigma-Delta Modulation
• Approximating a bandlimited function using very coarsely quantized data: Improved error estimates in sigma-delta modulation
• Quantized compressed sensing for random circulant matrices
• One-bit sigma-delta quantization with exponential accuracy
• Title not available (Why is that?)
• Noise-Shaping Quantization Methods for Frame-Based and Compressive Sampling Systems
• Error Decay of (almost) Consistent Signal Estimations from Quantized Gaussian Random Projections
• Root-Exponential Accuracy for Coarse Quantization of Finite Frame Expansions
• Quantization and Compressive Sensing
• Mathematics of analog-to-digital conversion
• Coarse quantization for random interleaved sampling of bandlimited signals
• High-order low-bit Sigma-Delta quantization for fusion frames
• An optimal family of exponentially accurate one-bit sigma-delta quantization schemes

This page was built for publication: Lower bounds for the error decay incurred by coarse quantization schemes

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