Papers
Topics
Authors
Recent
2000 character limit reached

The lower bound of the PCM quantization error in high dimension (1403.4311v1)

Published 18 Mar 2014 in math.NA, cs.IT, and math.IT

Abstract: In this note, we investigate the performance of the PCM scheme with linear quantization rule for quantizing unit-norm tight frame expansions for ${\mathbb R}d$ without the White Noise Hypothesis. In \cite{WX}, Wang and Xu showed that for asymptotically equidistributed unit-norm tight frame the PCM quantization error has an upper bound ${\mathcal O}(\delta{(d+1)/2})$ and they conjecture the upper bound is sharp. In this note, we confirm the conjecture with employing the asymptotic estimate of the Bessel functions.

Citations (2)

Summary

We haven't generated a summary for this paper yet.

Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.