Sorting-based multiple description quantization

We introduce a new method for multiple description quantization (MDQ), based on sorting a frame of samples and transmitting, as side-information/redundancy, an index that describes the resulting permutation. The sorting-based approach has a similar performance to multiple description scalar quantization and a flexible structure, providing straightforward implementation of multidimensional MDQ

[1]  Vivek K. Goyal,et al.  Quantized frame expansions as source-channel codes for erasure channels , 1999, Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096).

[2]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[3]  N. J. A. Sloane,et al.  Multiple-description vector quantization with lattice codebooks: Design and analysis , 2001, IEEE Trans. Inf. Theory.

[4]  Vinay A. Vaishampayan,et al.  Design of multiple description scalar quantizers , 1993, IEEE Trans. Inf. Theory.

[5]  Vivek K. Goyal,et al.  Quantized Overcomplete Expansions in IRN: Analysis, Synthesis, and Algorithms , 1998, IEEE Trans. Inf. Theory.

[6]  Vivek K Goyal,et al.  Quantized Frame Expansions with Erasures , 2001 .

[7]  Vivek K Goyal,et al.  Multiple description transform coding: robustness to erasures using tight frame expansions , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[8]  Thomas M. Cover,et al.  Enumerative source encoding , 1973, IEEE Trans. Inf. Theory.