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.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.