On the best lattice quantizers

02/19/2022
by   Erik Agrell, et al.
0

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 paper, Zamir and Feder show that the globally optimal lattice quantizer (which minimizes the mean square error) has white quantization noise: for a uniformly distributed source, the covariance of the error is the identity matrix, multiplied by a positive real factor. We generalize the theorem, showing that the same property holds (i) for any locally optimal lattice quantizer and (ii) for an optimal product lattice, if the component lattices are themselves locally optimal. We derive an upper bound on the normalized second moment (NSM) of the optimal lattice in any dimension, by proving that any lower- or upper-triangular modification to the generator matrix of a product lattice reduces the NSM. Using these tools and employing the best currently known lattice quantizers to build product lattices, we construct improved lattice quantizers in dimensions 13 to 15, 17 to 23, and 25 to 48. In some dimensions, these are the first reported lattices with normalized second moments below the Zador upper bound.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2022

Better Lattice Quantizers Constructed from Complex Integers

Real-valued lattices and complex-valued lattices are mutually convertibl...
research
05/11/2023

Vector Quantization with Error Uniformly Distributed over an Arbitrary Set

For uniform scalar quantization, the error distribution is approximately...
research
06/04/2019

On General Lattice Quantization Noise

The problem of constructing lattices such that their quantization noise ...
research
11/15/2021

Dense Circulant Lattices From Nonlinear Systems

Circulant lattices are those with a circulant generator matrix. They can...
research
08/30/2020

On Communication for Distributed Babai Point Computation

We present a communication-efficient distributed protocol for computing ...
research
10/14/2022

Exact calculation of quantizer constants for arbitrary lattices

We present an algorithm for the computer-aided analytical construction o...
research
05/11/2020

Approximate CVP_∞ in time 2^0.802 n

We show that a constant factor approximation of the shortest and closest...

Please sign up or login with your details

Forgot password? Click here to reset