Lower bounds for the error decay incurred by coarse quantization schemes

Details Lower bounds for the error decay incurred by coarse quantization schemes Lower bounds for the error decay incurred by coarse quantization schemes

2010-04-20

arxiv.org/abs/1004.3517v1

Computer Science

Information Theory

15 pages, one figure

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Lower bounds for the error decay incurred by coarse quantization schemes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lower bounds for the error decay incurred by coarse quantization schemes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower bounds for the error decay incurred by coarse quantization schemes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-474836