Entropy-constrained trellis-coded quantization

Author

Fischer, T.R. ; Wang, M.

Author_Institution

Sch. of Electr. Eng. & Comput. Sci., Washington State Univ., Pullman, WA, USA

Volume

38

Issue

2

fYear

1992

fDate

3/1/1992 12:00:00 AM

Firstpage

415

Lastpage

426

Abstract

Trellis-coded quantization is generalized to allow noiseless coding of the trellis branch reproduction symbols. An entropy-constrained trellis-coded quantization (ECTCQ) design algorithm is presented, based on the generalized Lloyd algorithm for trellis code design and the entropy-constrained vector quantization design algorithm. ECTCQ systems are designed for memoryless Gaussian and Laplacian sources, and for first- and second-order Gauss-Markov sources. With an 8-state trellis, the mean-squared error ECTCQ encoding performance for memoryless sources with smooth densities is within about 0.5 dB of the rate-distortion function. Small additional improvements are achieved with larger trellises. Similar, though not quite as good, performance is achieved for the Gauss-Markov sources by using the ECTCQ in a predictive coding structure.<>

Keywords

encoding; entropy; Gauss-Markov sources; Gaussian sources; Laplacian sources; encoding performance; entropy-constrained trellis-coded quantization; generalized Lloyd algorithm; memoryless sources; noiseless coding; predictive coding; rate-distortion function; source coding; trellis branch reproduction symbols; vector quantization design algorithm; Algorithm design and analysis; Convolutional codes; Encoding; Entropy; Gaussian processes; Lattices; Predictive coding; Rate-distortion; Source coding; Vector quantization;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.119697

Filename

119697