DocumentCode
3265187
Title
Symmetric trellis coded vector quantization
Author
Belzer, Benjamin ; Villasenor, John D.
Author_Institution
Dept. of Electr. Eng., California Univ., Los Angeles, CA, USA
fYear
1996
fDate
Mar/Apr 1996
Firstpage
13
Lastpage
22
Abstract
Trellis coded vector quantization is known to offer a good rate-distortion performance, but at a considerable (and sometimes prohibitive) complexity cost. We present design techniques for vector quantizers with highly symmetric codebooks that facilitate low complexity quantization as well as partitioning into equiprobable sets for trellis coding. The quantization performance of this coder on the Laplacian source matches the performance of trellis based scalar-vector quantization, the best fixed-wordlength quantizer thus far reported, but requires less computational complexity. Furthermore, this coder is well-suited for use in joint source/channel coding systems where the codeword locations and labeling are chosen to minimize the effects of channel errors
Keywords
channel coding; computational complexity; rate distortion theory; source coding; trellis codes; vector quantisation; Laplacian source; channel errors minimisation; codeword labeling; codeword locations; computational complexity; equiprobable sets; fixed-wordlength quantizer; low complexity quantization; quantization performance; rate-distortion performance; source/channel coding systems; symmetric codebooks; symmetric trellis coded vector quantization; trellis based scalar-vector quantization; Algorithm design and analysis; Channel coding; Computational complexity; Costs; Encoding; Labeling; Laplace equations; Partitioning algorithms; Rate-distortion; Vector quantization;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference, 1996. DCC '96. Proceedings
Conference_Location
Snowbird, UT
ISSN
1068-0314
Print_ISBN
0-8186-7358-3
Type
conf
DOI
10.1109/DCC.1996.488306
Filename
488306
Link To Document