Nearest neighbor algorithm for spherical codes from the Leechlattice
Adoul, J.-P.
Barth, M.
Dept. of Electr. Eng., Sherbrooke Univ., Que.;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: Sep 1988
Volume: 34,
Issue: 5, Part 1
On page(s): 1188-1202
ISSN: 0018-9448
References Cited: 22
CODEN: IETTAW
INSPEC Accession Number: 3375792
Digital Object Identifier: 10.1109/18.21247
Current Version Published: 2002-08-06
Abstract
The Leech lattice is a regular arrangement of points in
24-dimensional Euclidean space that yields an extremely dense packing
when equal spheres are centered at these points. A subset of the Leech
lattice can be used as a signal set for the Gaussian channel or as
representative vectors for a vector quantizer. Of particular interest
are the spherical codes (or code books) that consist of the points of
the Leech lattice which lie on a sphere centered at the origin. The code
points do not have to be stored because they can be obtained from a very
small set of basic vectors using permutations of the components in a
manner dictated by the words of the extended Golay code. A
nearest-neighbor algorithm that works on this is developed to determine
the point in the code closet to some arbitrary vector in
R24. The performance of this approach when
quantizing independent identically distributed Gaussian samples is
reported
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
