A STUDY OF VECTOR QUANTIZATION FOR NOISY CHANNELS

被引：282

作者：

FARVARDIN, N

机构：

[1] Electrical Engineering Department, University of Maryland, College Park

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1990年 / 36卷 / 04期

关键词：

D O I：

10.1109/18.53739

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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. © 1990 IEEE

引用

页码：799 / 809

页数：11

共 27 条

[11]

GERSHO A, 1979, IEEE T INFORM THEORY, V25, P373, DOI 10.1109/TIT.1979.1056067

[12] ALPHABET-CONSTRAINED DATA-COMPRESSION [J].