vix.ing · top · new · best · stats · spec

Lower bounds for the error decay incurred by coarse quantization schemes

2010/04/20 by Felix Krahmer, Rachel Ward, Krahmer, Felix +1
Computer Science · Mathematics · #37N99 #41A25 #41A44 #41A46 #42A61 #60C05 #94C99 #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT #msc:37N99 #msc:41A25 #msc:41A44 #msc:41A46 #msc:42A61 #msc:60C05 #msc:94C99

paper · pdf · doi:10.48550/arxiv.1004.3517

15 pages, one figure

arxiv created 2010/04/20 · arxiv updated 2010/04/21

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.

Related