Randomly chosen index assignments are asymptotically bad for uniform sources

IEEE Transactions on Information Theory

Volumn 45, Issue 2, 1999, Pages 788-794

  Méhes, Andrâs ^a   Zeger, Kenneth ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Index assignment; Noisy channel vector quantization

Indexed keywords

BINARY CODES; ERROR ANALYSIS; RANDOM PROCESSES; REDUNDANCY; SIGNAL DISTORTION; SPURIOUS SIGNAL NOISE; VECTOR QUANTIZATION;

INDEX ASSIGNMENTS; MEAN-SQUARED ERRORS (MSE);

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 0033100473     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.749030     Document Type: Article

References (19)

1. J.D. Marca and N. Jayant, "An algorithm for assigning binary indices to the code vectors of a multi-dimensional quantizer," in Proc. IEEE Int. Conf. Communications, Seattle, WA, June 1987, vol. 1, pp. 1128-1132.
2. N. Farvardin, "A study of vector quantization for noisy channels," IEEE Trans. Inform. Theory, vol. 36, pp. 799-809, July 1990.
3. H.-S. Wu and J. Barba, "Index allocation in vector quantisation for noisy channels," Electron. Lett., vol. 29, pp. 1318-1320, July 1993.
4. K. Zeger and A. Gersho, "Pseudo-gray coding," IEEE Trans. Commun., vol. 38, pp. 2147-2158, Dec. 1990.
5. P. Knagenhjelm and E. Agrell, "The Hadamard transform - A tool for index assignment," IEEE Trans. Inform. Theory, vol. 42, pp. 1139-1151, July 1996.
6. D.J. Goodman and T. J. Moulsley, "Using simulated annealing to design transmission codes for analogue sources," Electron. Lett., vol. 24, pp. 617-618, May 1988.
7. Y. Yamaguchi and T. S. Huang, "Optimum binary fixed-length block codes," Quarterly Progress Rep. 78, MIT, Cambridge, MA, July 1965.
8. T.S. Huang, "Optimum binary code," Quarterly Progress Rep. 82, MIT, Cambridge, MA, July 1966.
9. T.S. Huang etal., "Design considerations in PCM transmission of low-resolution monochrome still pictures," Proc. IEEE, vol. 55, pp. 331-335, Mar. 1967.
10. T.R. Crimmins, H. M. Horwitz, C. J. Palermo, and R. V. Palermo, "Minimization of mean-square error for data transmitted via group codes," IEEE Trans. Inform. Theory, vol. IT-15, pp. 72-78, Jan. 1969.
11. S.W. McLaughlin, D. L. Neuhoff, and J. J. Ashley, "Optimal binary index assignments for a class of equiprobable scalar and vector quantizers," IEEE Trans. Inform. Theory, vol. 41, pp. 2031-2037, Nov. 1995.
12. A. Méhes and K. Zeger, "Binary lattice vector quantization with linear block codes and affine index assignments," IEEE Trans. Inform. Theory, vol. 44, pp. 79-95, Jan. 1998.
13. R.E. Totty and G. C. Clark, "Reconstruction error in waveform transmission," IEEE Trans. Inform. Theory, vol. IT-13, pp. 336-338, Apr. 1967.
14. A. Méhes and K. Zeger, "Redundancy free codes for binary discrete memoryless channels," in Proc. Conf. Information Science and Systems, Princeton, NJ, 1994, pp. 1057-1062.
15. "On the performance of affine index assignments for redundancy free source-channel coding," in Proc. Data Compression Conf., Snowbird, UT, Mar. 1995, p. 433.
16. "Affine index assignments for binary lattice quantization with channel noise," in ISIT-95, Whistler, B.C., Canada, Sept. 1995, p. 377.
17. R. Hagen and P. Hedelin, "Robust vector quantization by a linear mapping of a block code," IEEE Trans. Inform. Theory, vol. 45, pp. 200-218, Jan. 1999.
18. "Design methods for VQ by linear mappings of block codes," in Proc. IEEE Int. Symp. Inform. Theory, Trondheim, Norway, June 1994, p. 241.
19. "Robust vector quantization by linear mappings of block-codes," in Proc. IEEE Int. Symp. Inform. Theory, San Antonio, TX, Jan. 1993, p. 171.