The Performance of PCM Quantization Under Tight Frame Representations

From MaRDI portal
Publication:3165293

DOI10.1137/110829167zbMATH Open1251.42009arXiv1103.3846OpenAlexW2089150844MaRDI QIDQ3165293FDOQ3165293


Authors: Zhiqiang Xu, Yang Wang Edit this on Wikidata


Publication date: 26 October 2012

Published in: SIAM Journal on Mathematical Analysis (Search for Journal in Brave)

Abstract: In this paper, we study the performance of the PCM scheme with linear quantization rule for quantizing finite unit-norm tight frame expansions for Rd and derive the PCM quantization error without the White Noise Hypothesis. We prove that for the class of unit norm tight frames derived from uniform frame paths the quantization error has an upper bound of O(delta3/2) regardless of the frame redundancy. This is achieved using some of the techniques developed by G"{u}nt"{u}rk in his study of Sigma-Delta quantization. Using tools of harmonic analysis we show that this upper bound is sharp for d=2. A consequence of this result is that, unlike with Sigma-Delta quantization, the error for PCM quantization in general does not diminish to zero as one increases the frame redundancy. We extend the result to high dimension and show that the PCM quantization error has an upper bound O(delta(d+1)/2) for asymptopitcally equidistributed unit-norm tight frame of Rd.


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




Recommendations




Cited In (5)





This page was built for publication: The Performance of PCM Quantization Under Tight Frame Representations

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