Lattice labeling algorithms for vector quantization

Labeling algorithms for construction-A and construction-B lattices with respect to pyramid boundaries are presented. The algorithms are developed based on relations between lattices and linear block codes as well as on transformations among several specifically defined lattices and their translation...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on circuits and systems for video technology 1998-04, Vol.8 (2), p.206-220
Main Authors: Chun Wang, Cao, H.Q., Weiping Li, Tzeng, K.K.
Format: Article
Language:English
Subjects:
Applied sciences
Block codes
Data compression
Data mining
Decoding
Encoding
Exact sciences and technology
Image processing
Information, signal and communications theory
Iterative algorithms
Labeling
Lattices
Signal processing
Telecommunications and information theory
Vector quantization
Video compression
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Labeling algorithms for construction-A and construction-B lattices with respect to pyramid boundaries are presented. The algorithms are developed based on relations between lattices and linear block codes as well as on transformations among several specifically defined lattices and their translations. The mechanism for the construction of these algorithms can be considered as an extension of that given by Fischer (1986). The algorithms are noted to achieve 100% efficiency in utilizing index bits for binary representations. Furthermore, it is determined that many important lattices (E/sub 8/, /spl Lambda//sub 16/...) can 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 develop practical lattice vector quantizers of large norms and high dimensions using these algorithms.
ISSN:1051-8215
1558-2205
DOI:10.1109/76.664105