Optimization of lattices for quantization

DOI10.1109/18.705561zbMATH Open0964.94014OpenAlexW2151940630MaRDI QIDQ4701159FDOQ4701159

Authors: Erik Agrell, Thomas Eriksson 

Publication date: 21 November 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://research.chalmers.se/en/publication/16141

Recommendations

• On the Voronoi Regions of Certain Lattices
• Random coding bound for the second moment of multidimensional lattices
• A fast encoding method for lattice codes and quantizers
• On the design of an optimal quantizer
• On lattice quantization noise

zbMATH Keywords

latticesteepest descent methodvector quantizationtraining algorithmVoronoi regionsnormalized second moment

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (6)

• Lattice refinement strategies
• Random coding bound for the second moment of multidimensional lattices
• Title not available (Why is that?)
• The Optimal Lattice Quantizer in Nine Dimensions
• The optimal isodual lattice quantizer in three dimensions
• Complexity and algorithms for computing Voronoi cells of lattices

This page was built for publication: Optimization of lattices for quantization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701159)