The Optimal Lattice Quantizer in Nine Dimensions
From MaRDI portal
Abstract: The optimal lattice quantizer is the lattice which minimizes the (dimensionless) second moment . In dimensions to , it has been proven that the optimal lattice quantizer is one of the classical lattices, or there is good evidence for this. In contrast, more than two decades ago, convincing numerical studies showed that in dimension , a non-classical lattice is optimal. The structure and properties of this lattice depend upon a real parameter , whose value was only known approximately. Here, we give a full description of this one-parameter family of lattices and their Voronoi cells, and calculate their (scalar and tensor) second moments analytically as a function of . The value of which minimizes is an algebraic number, defined by the root of a th order polynomial, with . For this value of , the covariance matrix (second moment tensor) is proportional to the identity, consistent with a theorem of Zamir and Feder for optimal quantizers. The structure of the Voronoi cell depends upon , and undergoes phase transitions at , and , where its geometry changes abruptly. At each transition, the analytic formula for the second moment changes in a very simple way. Our methods can be used for arbitrary one-parameter families of layered lattices, and may thus provide a useful tool to identify optimal quantizers in other dimensions as well.
Recommendations
- Optimization of lattices for quantization
- The optimal isodual lattice quantizer in three dimensions
- scientific article; zbMATH DE number 2209745
- scientific article; zbMATH DE number 1456828
- Fundamental solutions of nine-point discrete Laplacians
- Multidimensional lattices and limit efficiency of modulation and coding
- Theory of lattice-based fine-coarse vector quantization
- New optimal binary linear codes of dimensions 9 and 10
- Quantic lattices
- An optimal unimodular lattice in dimension 39
Cites work
- A Conceptual Breakthrough in Sphere Packing
- A generalization of Voronoi's reduction theory and its application
- A lower bound on the average error of vector quantizers (Corresp.)
- Asymptotically optimal block quantization
- Closest point search in lattices
- Complexity and algorithms for computing Voronoi cells of lattices
- Computing the Voronoi cell of a lattice: the diamond-cutting algorithm
- scientific article; zbMATH DE number 1224949 (Why is no real title available?)
- scientific article; zbMATH DE number 1079755 (Why is no real title available?)
- scientific article; zbMATH DE number 1506177 (Why is no real title available?)
- scientific article; zbMATH DE number 5937716 (Why is no real title available?)
- Inhomogeneous extreme forms
- Lattices and strings
- On lattice quantization noise
- On the Constitution of Metallic Sodium
- On the Voronoi Regions of Certain Lattices
- Optimization of lattices for quantization
- The hexagon theorem
- The Optimal Lattice Quantizer in Three Dimensions
- Voronoi regions of lattices, second moments of polytopes, and quantization
This page was built for publication: The Optimal Lattice Quantizer in Nine Dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6070220)