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.
展开▼
机译:提出了关于金字塔边界的构造A和构造B格的标注算法。该算法是根据晶格和线性块代码之间的关系以及几个特定定义的晶格之间的转换及其转换而开发的。构造这些算法的机制可以认为是Fischer(1986)给出的机制的扩展。注意到该算法在将索引位用于二进制表示中实现了100%的效率。此外,已确定可以将许多重要的晶格(E / sub 8 /,/ spl Lambda // sub 16 / ...)索引为任意规范和尺寸。这些算法在存储和计算方面的复杂度都非常低,因此可以使用这些算法开发大范数和高维的实用晶格矢量量化器。
展开▼