LATTICE LABELING ALGORITHMS FOR VECTOR QUANTIZATION

Labeling algorithms for Construction-A and Construction-B lattices wit h respect to pyramid boundaries are presented, The algorithms are deve loped based on relations between lattices and linear block codes as we ll as on transformations among several specifically defined lattices a nd their translations, The mechanism for the construction of these alg orithms can be considered as an extension of that given by Fischer, Th e algorithms are noted to achieve 100% efficiency in utilizing index b its for binary representations. Furthermore, it is determined that man y important lattices (E-8, Lambda(16),...) san be indexed to arbitrary norms and dimensions, The complexity of these algorithms in terms of both memory and computation is quite. low and thus it is possible to d evelop practical lattice vector quantizers of large norms and high dim ensions using these algorithms.