A Study of Vector Quantization for Noisy Channels.

Thumbnail Image

Files

TR_88-15.pdf (1.23 MB)
No. of downloads: 1874

Publication or External Link

Date

1988

Advisor

Citation

DRUM DOI

Abstract

Wnile there is ample evidence that vector quantization is a very useful technique for data compression, little is known about its sensitivity to channel and/or storage device errors. In this paper, several issues related to vector quantization for noisy channels are addressed. An algorithm based on simulated annealing is developed for assigning binary codewords to the vector quantizer codevectors. It is shown that this algorithm could result in dramatic performance improvements as compared to randomly selected codewords. Also, a modification of the simulated annealing algorithm for binary codeword assignment is developed for the case where the bits in the codeword are subjected to unequal error probabilities (resulting from unequal levels of error protection). An algorithm for the design of an optimal vector quantizer for a noisy channel is briefly discussed and its robustness under channel mismatch conditions is studied. Numerical results for a stationary first-order Gauss-Markov source and a binary symmetric channel are provided. It is concluded that the channel-optimized vector quantizer design algorithm, if used carefully, can result in a fairly robust system with no additional delay. Finally, the case in which the communication channel is nonstationary (as in mobile radio channels) is studied and some preliminary ideas for quantizer design are presented.

Notes

Rights