Quantizers with uniform decoders and channel-optimized encoders

Scalar quantizers with uniform decoders and channel-optimized encoders are studied for a uniform source on [0,1] and binary symmetric channels. Two families of affine index assignments are considered: the complemented natural code (CNC), introduced here, and the natural binary code (NBC). It is shown that the NBC never induces empty cells in the quantizer encoder, whereas the CNC can. Nevertheless, we show that the asymptotic distributions of quantizer encoder cells for the NBC and the CNC are equal and are uniform over a proper subset of the source's support region. Empty cells act as a form of implicit channel coding. An effective channel code rate associated with a quantizer designed for a noisy channel is defined and computed for the codes studied. By explicitly showing that the mean-squared error (MSE) of the CNC can be strictly smaller than that of the NBC, we also demonstrate that the NBC is suboptimal for a large range of transmission rates and bit error probabilities. This contrasts with the known optimality of the NBC when either both the encoder and decoder are not channel optimized, or when only the decoder is channel optimized.

[1]  Kenneth Zeger,et al.  Quantizers with uniform encoders and channel optimized decoders , 2004, IEEE Transactions on Information Theory.

[2]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

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

[4]  Thomas R. Crimmins,et al.  Minimization of mean-square error for data transmitted via group codes , 1969, IEEE Trans. Inf. Theory.

[5]  P. Wintz,et al.  Quantizing for Noisy Channels , 1969 .

[6]  Roar Hagen,et al.  Robust Vector Quantization by a Linear Mapping of a Block Code , 1999, IEEE Trans. Inf. Theory.

[7]  Mikael Skoglund,et al.  On channel-constrained vector quantization and index assignment for discrete memoryless channels , 1999, IEEE Trans. Inf. Theory.

[8]  Erik Agrell,et al.  The Hadamard transform-a tool for index assignment , 1996, IEEE Trans. Inf. Theory.

[9]  NARIMAN FARVARDIN,et al.  Optimal quantizer design for noisy channels: An approach to combined source - channel coding , 1987, IEEE Trans. Inf. Theory.

[10]  Masao Kasahara,et al.  A construction of vector quantizers for noisy channels , 1984 .

[11]  Robert M. Gray,et al.  Joint source and noisy channel trellis encoding , 1981, IEEE Trans. Inf. Theory.

[12]  K. Zeger,et al.  Randomly chosen index assignments are asymptotically bad for uniform sources , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[13]  Kenneth Zeger,et al.  Binary Lattice Vector Quantization with Linear Block Codes and Affine Index Assignments , 1998, IEEE Trans. Inf. Theory.

[14]  David L. Neuhoff,et al.  Optimal binary index assignments for a class of equiprobable scalar and vector quantizers , 1995, IEEE Trans. Inf. Theory.