On the performance and complexity of channel-optimized vectorquantizers
Farvardin, N.
Vaishampayan, V.
Ecole Nat. Superieure des Telecommun., Paris;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: Jan 1991
Volume: 37,
Issue: 1
On page(s): 155-160
ISSN: 0018-9448
References Cited: 13
CODEN: IETTAW
INSPEC Accession Number: 3847588
DOI: 10.1109/18.61130
Posted online: 2002-08-06 17:50:28.0
Abstract
The performance and complexity of channel-optimized vector
quantizers are studied for the Gauss-Markov source. 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 codebook size-implying a reduction in encoding
complexity
Index Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
