Vector quantization over a noisy channel using soft decision decoding

A soft decision decoder is presented. The soft decision decoder is optimal in the mean square sense, if the encoder entropy is full. A source vector estimate is obtained as a linear mapping of a soft Hadamard column. The soft Hadamard column is formed as a generally nonlinear mapping of soft information bits. It is shown that the best index assignment, on the encoder, is obtained in the special case of a linear mapping from the soft information bits. Simulations indicate that the jointly trained system performs better than channel optimized VQ with hard decisions. The interesting case, for applications, of using an ordinary VQ codebook as encoder, together with our soft decision decoder, is also investigated. In our examples this approach gives comparable performance to channel optimized VQ with hard decisions.<<ETX>>

[1]  Nariman Farvardin,et al.  Joint design of block source codes and modulation signal sets , 1992, IEEE Trans. Inf. Theory.

[2]  V. Cuperman,et al.  Soft Decision Vector Quantization for Noisy Channels , 1993, Proceedings., IEEE Workshop on Speech Coding for Telecommunications,.

[3]  Petter Knagenhjelm,et al.  How good is your index assignment? , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[4]  Nariman Farvardin,et al.  On the performance and complexity of channel-optimized vector quantizers , 1991, IEEE Trans. Inf. Theory.

[5]  R. Hagen,et al.  Robust Vector Quantization by Linear Mappings of Block-codes , 1993, Proceedings. IEEE International Symposium on Information Theory.