Related papers: Parametric Lattices Are Better Quantizers in Dimen…
The optimal lattice quantizer is the lattice which minimizes the (dimensionless) second moment $G$. In dimensions $1$ to $8$, it has been proven that the optimal lattice quantizer is one of the classical lattices, or there is good evidence…
We present an algorithm for the exact computer-aided construction of the Voronoi cells of lattices with known symmetry group. Our algorithm scales better than linearly with the total number of faces and is applicable to dimensions beyond…
Lattices with minimal normalized second moments are designed using a new numerical optimization algorithm. Starting from a random lower-triangular generator matrix and applying stochastic gradient descent, all elements are updated towards…
40 years ago, Conway and Sloane proposed using the highly symmetrical Coxeter-Todd lattice $K_{12}$ for quantization, and estimated its second moment. Since then, all published lists identify $K_{12}$ as the best 12-dimensional lattice…
A lattice quantizer approximates an arbitrary real-valued source vector with a vector taken from a specific discrete lattice. The quantization error is the difference between the source vector and the lattice vector. In a classic 1996…
This paper investigates low-dimensional quantizers from the perspective of complex lattices. We adopt Eisenstein integers and Gaussian integers to define checkerboard lattices $\mathcal{E}_{m}$ and $\mathcal{G}_{m}$. By explicitly linking…
We present two methods to continuously and piecewise-linearly parametrize rank-3 lattices by vectors of $\RR^{13}$, which provides an efficient way to judge if two sets of parameters provide nearly identical lattices within their margins of…
In section 1 we give an improved lower bound on Hermite's constant $\delta_{2g}$ for symplectic lattices in even dimensions ($g=2n$) by applying a mean-value argument from the geometry of numbers to a subset of symmetric lattices. Here we…
In practical applications, lattice quantizers leverage discrete lattice points to approximate arbitrary points in the lattice. An effective lattice quantizer significantly enhances both the accuracy and efficiency of these approximations.…
We demonstrate a cavity-based solution to scale up experiments with ultracold atoms in optical lattices by an order of magnitude over state-of-the-art free space lattices. Our two-dimensional optical lattices are created by power…
We consider a realistic model, i.e., ultracold atoms in a driven optical lattice, to realize phase space crystals [Phys. Rev. Lett. 111, 205303 (2013)]. The corresponding lattice structure in phase space is more complex and contains rich…
The problem of designing a multiple description vector quantizer with lattice codebook Lambda is considered. A general solution is given to a labeling problem which plays a crucial role in the design of such quantizers. Numerical…
A higher dimensional lattice space can be decomposed into a number of four-dimensional lattices called as layers. The higher dimensional gauge theory on the lattice can be interpreted as four-dimensional gauge theories on the multi-layer…
We give a detailed description of the Voronoi region of the Barnes-Wall lattice $\Lambda_{16}$, including its vertices, relevant vectors, and symmetry group. The exact value of its quantizer constant is calculated, which was previously only…
We propose two low-complexity lattice code constructions that have competitive coding and shaping gains. The first construction, named systematic Voronoi shaping, maps short blocks of integers to the dithered Voronoi integers, which are…
We classify the dual strongly perfect lattices in dimension 16. There are four pairs of such lattices, the famous Barnes-Wall lattice $\Lambda _{16}$, the extremal 5-modular lattice $N_{16}$, the odd Barnes-Wall lattice $O_{16}$ and its…
In this paper we present the first known deterministic algorithm for the construction of multiple rank-1 lattices for the approximation of periodic functions of many variables. The algorithm works by converting a potentially large…
A lattice is a partially-ordered set in which every pair of elements has a unique meet (greatest lower bound) and join (least upper bound). We present new data structures for lattices that are simple, efficient, and nearly optimal in terms…
We present analytical expressions for optimal entropy-constrained multiple-description lattice vector quantizers which, under high-resolutions assumptions, minimize the expected distortion for given packet-loss probabilities. We consider…
We present an adaptation of Voronoi theory for imaginary quadratic number fields of class number greater than 1. This includes a characterisation of extreme Hermitian forms which is analogous to the classic characterisation of extreme…