Lattice labeling algorithms for vector quantization

被引:4
|
作者
Wang, C [1 ]
Cao, HQ [1 ]
Li, WP [1 ]
Tzeng, KK [1 ]
机构
[1] Lehigh Univ, Dept Comp Sci & Elect Engn, Bethlehem, PA 18015 USA
基金
美国国家科学基金会;
关键词
Construction-A; Construction-B; decoding; encoding; labeling; lattice; lattice vector quantization; linear block code; vector quantization;
D O I
10.1109/76.664105
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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, The algorithms are noted to achieve 100% efficiency in utilizing index bits for binary representations. Furthermore, it is determined that many 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 develop practical lattice vector quantizers of large norms and high dimensions using these algorithms.
引用
收藏
页码:206 / 220
页数:15
相关论文
共 50 条