Better Lattice Quantizers Constructed from Complex Integers
Shanxiang Lyu, Zheng Wang, Cong Ling, Hao Chen

TL;DR
This paper introduces new low-dimensional complex lattice quantizers based on Eisenstein and Gaussian integers, achieving the best known quantizers in several dimensions and providing fast algorithms for their evaluation.
Contribution
It constructs novel complex lattice quantizers from Eisenstein and Gaussian integers and links their bases to cosets, reporting the best known quantizers in multiple dimensions.
Findings
Best known lattice quantizers in dimensions 14, 15, 18, 19, 22, 23
Proposes fast algorithms for quantization of generalized checkerboard lattices
Enables efficient evaluation of normalized second moment (NSM) via Monte Carlo
Abstract
This paper investigates low-dimensional quantizers from the perspective of complex lattices. We adopt Eisenstein integers and Gaussian integers to define checkerboard lattices and . By explicitly linking their lattice bases to various forms of and cosets, we discover the lattices, based on which we report the best known lattice quantizers in dimensions , , , , and . Fast quantization algorithms of the generalized checkerboard lattices are proposed to enable evaluating the normalized second moment (NSM) through Monte Carlo integration.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMedical Imaging Techniques and Applications · Advanced Data Compression Techniques
