On the Performance and Complexity of Channel-Optimized Vector Quantizers

Research output: Contribution to journalArticlepeer-review

202 Scopus citations

Abstract

The performance and complexity of channel-optimized vector quantizers are studied for the Gauss—Markov source. Some interesting observations on the geometric structure of these quantizers are made, which have an important implication on the encoding complexity. For the squared-error distortion measure, it is shown that an operation equivalent to a Euclidean distance measurement with respect to an appropriately defined set of points (used to identify the encoding regions) can be used to perform the encoding. This implies that the encoding complexity is proportional to the number of encoding regions. It is then demonstrated that for very noisy channels and a heavily correlated source, when the codebook size is large the number of encoding regions is considerably smaller than the codehook size-implying a reduction in encoding complexity.

Original languageEnglish
Pages (from-to)155-160
Number of pages6
JournalIEEE Transactions on Information Theory
Volume37
Issue number1
DOIs
StatePublished - Jan 1991

Fingerprint

Dive into the research topics of 'On the Performance and Complexity of Channel-Optimized Vector Quantizers'. Together they form a unique fingerprint.

Cite this