Design of multiple description scalar quantizers

The design of scalar quantizers for communication systems that use diversity to overcome channel impairments is considered. The design problem is posed as an optimization problem and necessary conditions for optimality are derived. A design algorithm, a generalization of S.P. Lloyd's (1962) algorithm for quantizer design, is developed. Unlike a single channel scalar quantizer, the performance of a multiple description scalar quantizer is dependent on the index assignment. The problem of index assignment is addressed. Good index assignments, performance results, and sample quantizer designs are presented for a memoryless Gaussian source. Comparisons are made with rate distortion bounds for the multiple description problem. >

[1]  William Equitz,et al.  Successive refinement of information , 1991, IEEE Trans. Inf. Theory.

[2]  Abbas El Gamal,et al.  Achievable rates for multiple descriptions , 1982, IEEE Trans. Inf. Theory.

[3]  John G. Proakis,et al.  Digital Communications , 1983 .

[4]  Aaron D. Wyner,et al.  Coding Theorems for a Discrete Source With a Fidelity CriterionInstitute of Radio Engineers, International Convention Record, vol. 7, 1959. , 1993 .

[5]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[6]  Takehiro Moriya.  Two-Channel Conjugate Vector Quantizer for Noisy Channel Speech Coding , 1992, IEEE J. Sel. Areas Commun..

[7]  Toby Berger.  Optimum quantizers and permutation codes , 1972, IEEE Trans. Inf. Theory.

[8]  Philip A. Chou,et al.  Entropy-constrained vector quantization , 1989, IEEE Trans. Acoust. Speech Signal Process..

[9]  L. Ozarow,et al.  On a source-coding problem with two channels and three receivers , 1980, The Bell System Technical Journal.

[10]  N. Jayant.  Subsampling of a DPCM speech channel to provide two “self-contained” half-rate channels , 1981, The Bell System Technical Journal.

[11]  Toby Berger,et al.  Minimum breakdown degradation in binary source encoding , 1983, IEEE Trans. Inf. Theory.

[12]  Jerry D. Gibson,et al.  Alphabet-constrained data compression , 1982, IEEE Trans. Inf. Theory.

[13]  이충웅,et al.  블럭간의 상관성을 이용한 엔트로피제한 벡터 양자화 ( Entropy-Constrained Vector Quantization using Interblock correlation ) , 1993 .

[14]  Nariman Farvardin,et al.  Optimum quantizer performance for a class of non-Gaussian memoryless sources , 1984, IEEE Trans. Inf. Theory.

[15]  Nuggehally Sampath Jayant,et al.  Effects of Packet Losses in Waveform Coded Speech and Improvements Due to an Odd-Even Sample-Interpolation Procedure , 1981, IEEE Trans. Commun..

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

[17]  H. Vincent Poor,et al.  An Introduction to Signal Detection and Estimation , 1994, Springer Texts in Electrical Engineering.

[18]  Toby Berger,et al.  New results in binary multiple descriptions , 1987, IEEE Trans. Inf. Theory.

[19]  Robert M. Gray,et al.  An Algorithm for Vector Quantizer Design , 1980, IEEE Trans. Commun..

[20]  H. Witsenhausen,et al.  Source coding for multiple descriptions II: A binary source , 1981, The Bell System Technical Journal.

[21]  A. Wyner,et al.  Source coding for multiple descriptions , 1980, The Bell System Technical Journal.

[22]  Rudolf Ahlswede,et al.  The rate-distortion region for multiple descriptions without excess rate , 1985, IEEE Trans. Inf. Theory.