DocumentCode
934581
Title
Fast quantizing and decoding and algorithms for lattice quantizers and codes
Author
Conway, J.H. ; Sloane, N. J A
Volume
28
Issue
2
fYear
1982
fDate
3/1/1982 12:00:00 AM
Firstpage
227
Lastpage
232
Abstract
For each of the lattices 
, and their duals a very fast algorithm is given for finding the closest lattice point to an arbitrary point. If these lattices are used for vector quantizing of uniformly distributed data, the algorithm finds the minimum distortion lattice point. If the lattices are used as codes for a Gaussian channel, the algorithm performs maximum likelihood decoding.
, and their duals a very fast algorithm is given for finding the closest lattice point to an arbitrary point. If these lattices are used for vector quantizing of uniformly distributed data, the algorithm finds the minimum distortion lattice point. If the lattices are used as codes for a Gaussian channel, the algorithm performs maximum likelihood decoding.Keywords
Quantization (signal); Signal quantization; maximum-likelihood (ML) decoding; Gaussian channels; Gaussian noise; Helium; Lattices; Mathematics; Maximum likelihood decoding; Milling machines; Nearest neighbor searches; Quantization; Statistics;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1982.1056484
Filename
1056484
Link To Document