The lower bound of the PCM quantization error in high dimensions
From MaRDI portal
Abstract: In this note, we investigate the performance of the PCM scheme with linear quantization rule for quantizing unit-norm tight frame expansions for 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 and they conjecture the upper bound is sharp. In this note, we confirm the conjecture with employing the asymptotic estimate of the Bessel functions.
Recommendations
- The Performance of PCM Quantization Under Tight Frame Representations
- Improvement of the lower bound of the PCM quantization error for vectors in \(\mathbb{R}^2\)
- Frame paths and error bounds for sigma-delta quantization
- Pointwise comparison of PCM and \(\Sigma \Delta \) quantization
- Lattice quantization error for redundant representations
Cites work
- Approximating a bandlimited function using very coarsely quantized data: Improved error estimates in sigma-delta modulation
- Decision procedure for indefinite hypergeometric summation
- Lattice quantization error for redundant representations
- NIST handbook of mathematical functions
- Pointwise comparison of PCM and \(\Sigma \Delta \) quantization
- Quantized overcomplete expansions in IR/sup N/: analysis, synthesis, and algorithms
- Second-order sigma-delta (\(\Sigma \Delta\)) quantization of finite frame expansions
- Sigma-delta (/spl Sigma//spl Delta/) quantization and finite frames
- The Performance of PCM Quantization Under Tight Frame Representations
- White Noise Hypothesis for Uniform Quantization Errors
Cited in
(3)
This page was built for publication: The lower bound of the PCM quantization error in high dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q466980)