Optimization of Lattices for Quantization

A training algorithm for the design of lattices for vector quantization is presented. The algorithm uses a steepest descent method to adjust a generator matrix, in the search for a lattice whose Voronoi regions have minimal normalized second moment. The numerical elements of the found generator matrices are interpreted and translated into exact values. Experiments show that the algorithm is stable, in the sense that several independent runs reach equivalent lattices. The obtained lattices reach as low second moments as the best previously reported lattices, or even lower. Specifically, we report lattices in nine and ten dimensions with normalized second moments of 0.0716 and 0.0708, respectively, and nonlattice tessellations in seven and nine dimensions with 0.0727 and 0.0711, which improves on previously known values. The new nine- and ten-dimensional lattices suggest that Conway and Sloane's (1993) conjecture on the duality between the optimal lattices for packing and quantization might be false. A discussion of the application of lattices in vector quantizer design for various sources, uniform and nonuniform, is included.

[1]  Ravi Kannan,et al.  Improved algorithms for integer programming and related lattice problems , 1983, STOC.

[2]  Brent Nelson,et al.  Vector quantization codebook generation using simulated annealing , 1989, International Conference on Acoustics, Speech, and Signal Processing,.

[3]  Michel Barlaud,et al.  Image coding using lattice vector quantization of wavelet coefficients , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.

[4]  Tamás Linder,et al.  Asymptotic entropy-constrained performance of tessellating and universal randomized lattice quantization , 1994, IEEE Trans. Inf. Theory.

[5]  Jerry D. Gibson,et al.  Uniform and piecewise uniform lattice vector quantization for memoryless Gaussian and Laplacian sources , 1993, IEEE Trans. Inf. Theory.

[6]  Allen Gersho,et al.  On the structure of vector quantizers , 1982, IEEE Trans. Inf. Theory.

[7]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[8]  N. J. A. Sloane,et al.  Voronoi regions of lattices, second moments of polytopes, and quantization , 1982, IEEE Trans. Inf. Theory.

[9]  Robert M. Gray,et al.  An Algorithm for Vector Quantizer Design , 1980, IEEE Trans. Commun..

[10]  Thomas Eriksson,et al.  Dual-stage vector quantization with dynamic bit allocation , 1994 .

[11]  Minjie Xie,et al.  Embedded algebraic vector quantizers (EAVQ) with application to wideband speech coding , 1996, 1996 IEEE International Conference on Acoustics, Speech, and Signal Processing Conference Proceedings.

[12]  L. T. Wille,et al.  New binary covering codes obtained by simulated annealing , 1996, IEEE Trans. Inf. Theory.

[13]  K. Paliwal,et al.  Efficient vector quantization of LPC parameters at 24 bits/frame , 1990 .

[14]  N. J. A. Sloane,et al.  A lower bound on the average error of vector quantizers , 1985, IEEE Trans. Inf. Theory.

[15]  László Babai,et al.  On Lovász’ lattice reduction and the nearest lattice point problem , 1986, Comb..

[16]  James A. Bucklew.  A note on optimal multidimensional companders , 1983, IEEE Trans. Inf. Theory.

[17]  James A. Bucklew,et al.  Companding and random quantization in several dimensions , 1981, IEEE Trans. Inf. Theory.

[18]  Harvey Cohn,et al.  A second course in number theory , 1962 .

[19]  Michel Barlaud,et al.  Adaptive entropy-constrained lattice vector quantization for multiresolution image coding , 1992, Other Conferences.

[20]  Peter F. Swaszek,et al.  Unrestricted multistage vector quantizers , 1992, IEEE Trans. Inf. Theory.

[21]  Toby Berger,et al.  Rate distortion theory : a mathematical basis for data compression , 1971 .

[22]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[23]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[24]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

[25]  Emanuele Viterbo,et al.  Computing the Voronoi cell of a lattice: the diamond-cutting algorithm , 1996, IEEE Trans. Inf. Theory.

[26]  G. David Forney,et al.  On the Duality of Coding and Quantizing , 1992, Coding And Quantization.

[27]  Jerry D. Gibson,et al.  Lattice vector quantization for image coding , 1989, International Conference on Acoustics, Speech, and Signal Processing,.

[28]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[29]  R. Zamir,et al.  On lattice quantization noise , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[30]  W. Fischer,et al.  Sphere Packings, Lattices and Groups , 1990 .

[31]  J. Makhoul,et al.  Vector quantization in speech coding , 1985, Proceedings of the IEEE.

[32]  Thomas R. Fischer,et al.  Geometric source coding and vector quantization , 1989, IEEE Trans. Inf. Theory.

[33]  Thomas Eriksson,et al.  Lattice-based quantization, Part II , 1996 .

[34]  James A. Bucklew,et al.  Piecewise uniform vector quantizers , 1988, IEEE Trans. Inf. Theory.

[35]  D. Neuhoff.  An Asymptotic Analysis of Fixed-Rate Lattice Vector Quantization , 1996 .

[36]  Robert M. Gray,et al.  High-resolution quantization theory and the vector quantizer advantage , 1989, IEEE Trans. Inf. Theory.

[37]  R. Gray.  Source Coding Theory , 1989 .

[38]  Per Hedelin.  Single stage spectral quantization at 20 bits , 1994, Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing.

[39]  N. Sloane,et al.  On the Voronoi Regions of Certain Lattices , 1984 .

[40]  Thomas R. Fischer,et al.  A pyramid vector quantizer , 1986, IEEE Trans. Inf. Theory.

[41]  C.E. Shannon,et al.  Communication in the Presence of Noise , 1949, Proceedings of the IRE.

[42]  Thomas R. Fischer,et al.  Two-stage vector quantization-lattice vector quantization , 1994, IEEE Trans. Inf. Theory.

[43]  Thomas C. Hales.  Sphere packings, I , 1997, Discret. Comput. Geom..

[44]  Jerry D. Gibson,et al.  Digital coding of waveforms: Principles and applications to speech and video , 1985, Proceedings of the IEEE.

[45]  Allen Gersho,et al.  Asymptotically optimal block quantization , 1979, IEEE Trans. Inf. Theory.

[46]  S. Morissette,et al.  Fast CELP coding based on the Barnes-Wall lattice in 16 dimensions , 1989, International Conference on Acoustics, Speech, and Signal Processing,.

[47]  N. J. A. Sloane,et al.  Fast quantizing and decoding and algorithms for lattice quantizers and codes , 1982, IEEE Trans. Inf. Theory.

[48]  Teuvo Kohonen,et al.  Self-organization and associative memory: 3rd edition , 1989 .

[49]  Thomas R. Fischer,et al.  An entropy-coded lattice vector quantizer for transform and subband image coding , 1996, IEEE Trans. Image Process..