LATTICE AND TRELLIS QUANTIZATION WITH LATTICE-BOUNDED AND TRELLIS-BOUNDED CODEBOOKS - HIGH-RATE THEORY FOR MEMORYLESS SOURCES

被引：65

作者：

EYUBOGLU, MV ^{[1
]}

FORNEY, GD ^{[1
]}

机构：

[1] NORTHEASTERN UNIV,BOSTON,MA 02115

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1993年 / 39卷 / 01期

关键词：

SOURCE CODING; VECTOR QUANTIZATION; LATTICE QUANTIZATION; TRELLIS-CODED QUANTIZATION; TRELLIS-CODED MODULATION; SHAPING;

D O I：

10.1109/18.179341

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

High-rate lattice and trellis quantizers for nonuniform sources are introduced and analyzed. The performance of these quantizers is determined by two separable quantities, the granular gain and the boundary gain, which are determined by the shapes of the granular cells and of the support region, respectively. The granular gain and boundary gain are the duals of shaping and coding gain in data transmission applications. Using this duality, it is shown for Gaussian sources that the ultimate achievable boundary gain with high-rate lattice-bounded lattice codebooks is the same as the ultimate gain that can be obtained from variable-rate entropy coding. It is observed that if lattice codebooks can achieve the ultimate granular gain of 0.255 bit per dimension, then lattice-bounded lattice codebooks can approach the rate-distortion limit. Finally, the performance of lattice quantizers is compared to that of optimum vector quantizers.

引用

页码：46 / 59

页数：14

共 45 条

[1] NEAREST NEIGHBOR ALGORITHM FOR SPHERICAL CODES FROM THE LEECH LATTICE [J].