Lattice quantization error for redundant representations
Redundant systems such as frames are often used to represent a signal for error correction, denoising and general robustness. In the digital domain quantization needs to be performed. Given the redundancy, the distribution of quantization errors can be rather complex. This paper studies the stronger form of the asymptotic White Noise Hypothesis for general lattice by characterizing the asymptotic distribution of the quantization error in the most general setting. Let \(L\) be a full rank lattice in \(\mathbb{R}^{N}\) and \(G\) be a \(d\times N\) matrix. Let \(X\) be an absolutely continuous random vector in \(\mathbb{R}^{d}\) (the signal). For the cell size of the lattice \(\Delta >0\), let \(Z_{\Delta}=\frac{1}{\Delta}\tau (G^{T}X,\Delta L)\) be the normalized quantization error. The distribution of \(Z_{\Delta}\) as \(\Delta\) becomes small is characterized by the following property: If the rows of the matrix \(A^{-1}G^{T}\) are linearly independent over the rationals, then \(Z_{\Delta}\) is asymptotically uniformly distributed in the Voronoi cell \(V(\mathbf \{0\})\) of the lattice \(L\) as \(\Delta \rightarrow 0\). The case when the maximal number of linearly independent rows of this matrix is equal to \(m\) is also considered with respect to the \(m\)-dimensional Hausdorff measure.
- A fast encoding method for lattice codes and quantizers
- A Mathematical Theory of Communication
- Asymptotically optimal block quantization
- Fast quantizing and decoding and algorithms for lattice quantizers and codes
- scientific article; zbMATH DE number 3125787 (Why is no real title available?)
- scientific article; zbMATH DE number 192896 (Why is no real title available?)
- scientific article; zbMATH DE number 467196 (Why is no real title available?)
- On lattice quantization noise
- On the whiteness of high-resolution quantization errors
- Orthogonality criteria for compactly supported refinable functions and refinable function vectors
- 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
- Sur la représentation d'une population infinie par un nombre fini d'éléments
- The hexagon theorem
- The Optimal Lattice Quantizer in Three Dimensions
- Voronoi regions of lattices, second moments of polytopes, and quantization
- White Noise Hypothesis for Uniform Quantization Errors
- Memoryless scalar quantization for random frames
- The lower bound of the PCM quantization error in high dimensions
- On lattice quantization noise
- Quantization and finite frames
- Asymptotic Independence and Uniform Distribution of Quantization Errors for Spatially Discretized Dynamical Systems
- Improvement of the lower bound of the PCM quantization error for vectors in \(\mathbb{R}^2\)
- White Noise Hypothesis for Uniform Quantization Errors
This page was built for publication: Lattice quantization error for redundant representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734330)