Jointly optimized trellis-coded residual vector quantization

Author

Khan, Mohammed A U ; Smith, Mark J T ; McLaughlin, Steven W.

Author_Institution

Center for Signal & Image Processing, Georgia Inst. of Technol., Atlanta, GA, USA

Volume

49

Issue

6

fYear

2001

fDate

6/1/2001 12:00:00 AM

Firstpage

937

Lastpage

942

Abstract

The union of residual vector quantization (RVQ) and trellis-coded vector quantization (TCVQ) was considered by various authors where the emphasis was on the sequential design. We consider a new jointly optimized combination of RVQ and TCVQ with advantages in all categories. Necessary conditions for optimality of the jointly optimized trellis-coded residual vector quantizers (TCRVQ) are derived. A constrained direct sum tree structure is introduced that facilitates RVQ codebook partitioning. Simulation results for jointly optimized TCRVQ are presented for memoryless Gaussian, Laplacian, and uniform sources. The rate-distortion performance is shown to be better than RVQ and sequentially designed TCRVQ

Keywords

Gaussian processes; memoryless systems; optimisation; rate distortion theory; trees (mathematics); trellis codes; vector quantisation; Laplacian source; RVQ codebook partitioning; TCVQ; constrained direct sum tree structure; jointly optimized trellis-coded residual VQ; memoryless Gaussian source; necessary conditions; rate-distortion performance; residual vector quantization; sequentially designed TCRVQ; simulation results; trellis-coded vector quantization; uniform source; vector quantization; Costs; Data compression; Design optimization; Image coding; Image processing; Laplace equations; Shape; Signal processing; Tree data structures; Vector quantization;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.930620

Filename

930620