Near-optimum low-complexity lattice quantization

Abstract

Computationally efficient vector quantization for discrete time sources can be performed by using lattices over linear block codes. For high rates (low distortions) the performance of a multidimensional lattice depends mainly on the normalized second moment (NSM) of the lattice. Well-known optimum or best-known lattices for a given dimension such as the… (More)
DOI: 10.1109/ISIT.2010.5513730

Topics

3 Figures and Tables

Cite this paper

@article{Kudryashov2010NearoptimumLL, title={Near-optimum low-complexity lattice quantization}, author={Boris D. Kudryashov and Kirill V. Yurkov}, journal={2010 IEEE International Symposium on Information Theory}, year={2010}, pages={1032-1036} }