Entropy-Constrained Vector Quantization

IEEE Transactions on Acoustics, Speech, and Signal Processing

Volumn 37, Issue 1, 1989, Pages 31-42

  Chou, Philip A ^a   Lookabaugh, Tom ^a   Gray, Robert M ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY--DATA COMPRESSION; PATTERN RECOGNITION; SPEECH--CODING;

ENTROPY-CONSTRAINED VECTOR QUANTIZATION; ITERATIVE DESCENT ALGORITHM;

SIGNAL PROCESSING;

EID: 0024480421     PISSN: 00963518     EISSN: None     Source Type: Journal    
DOI: 10.1109/29.17498     Document Type: Article

References (45)

1. C. E. Shannon, “Coding theorems for a discrete source with a fidelity criterion,” in IRE Nat. Conv. Rec., 1959, pp. 142-163.
2. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968
3. T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression. Englewood Cliffs, NJ: Prentice-Hall, 1971.
4. H. Gish and J. N. Pierce, “Asymptotically efficient quantizing,” IEEE Trans. Inform. Theory, vol. IT-14, pp. 676-683, Sept. 1968.
5. T. J. Goblick and J. L. Holsinger, “Analog source digitization: Acomparison of theory and practice,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 323-326, Apr. 1967.
6. P. Zador, “Asymptotic quantization error of continuous signals and their quantization dimensions,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 139-149, Mar. 1982. (Previously an unpublished Bell Lab memo, 1966.)
7. A. Gersho, “Asymptotically optimal block quantization,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 373-380, July 1979.
8. J. H. Conway and N. J. A. Sloane, “Voronoi regions of lattices, second moments of polytopes, and quantization,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 211-226, Mar. 1982.
9. “Fast quantizing and decoding algorithms for lattice quantizersand codes,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 227-231, Mar. 1982.
10. “A fast encoding method for lattice codes and quantizers,” IEEETrans. Inform. Theory, vol. IT-29, pp. 820-824, Nov. 1983.
11. K. Sayood, J. D. Gibson, and M. C. Rost, “An algorithm for uniform vector quantizer design,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 805-814, Nov. 1984.
12. R. C. Wood, “On optimum quantization,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 248-252, Mar. 1969.
13. T. Berger, “Optimum quantizers and permutation codes,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 759-765, Nov. 1972.
14. “Minimum entropy quantizers and permutation codes,” IEEETrans. Inform. Theory, vol. IT-28, pp. 149-157, Mar. 1982.
15. A. N. Netravali and R. Saigal, “Optimum quantizer design using a fixed-point algorithm,” Bell Syst. Tech. J., vol. 55, pp. 1423-1435, Nov. 1976.
16. P. Noll and R. Zelinski, “Bounds on quantizer performance in the low bit-rate region,” IEEE Trans. Commun., vol. COM-26, pp. 300-304, Feb. 1978.
17. N. Farvardin and J. W. Modestino, “Optimum quantizer performance for a class of non-Gaussian memoryless sources,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 485-497, May 1984.
18. J. Ziv, “On universal quantization,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 344-347, May 1985.
19. M. Gutman, “On uniform quantization with various distortion measures,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 169-171, Jan. 1987.
20. S. P. Lloyd, “Least squares quantization in PCM,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 129-136, Mar. 1982. (Previously an unpublished Bell Lab Tech. Note, 1957.)
21. Y. Linde, A. Buzo, and R. M. Gray, “An algorithm for vector quantizer design,” IEEE Trans. Commun., vol. COM-28, pp. 84-95, Jan. 1980.
22. P. A. Chou, T. Lookabaugh, and R. M. Gray, “Optimal pruning with applications to tree structured source coding and modeling,” IEEE Trans. Inform. Theory, to appear.
23. M. B. Pursley and L. D. Davisson, “Variable rate coding for noner-godic sources and classes of ergodic sources subject to a fidelity constraint,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 324-337, May 1976.
24. R. Blahut, “Computation of channel capacity and rate-distortion functions,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 460-473, July 1972.
25. M. J. Sabin and R. M. Gray, “Global convergence and empirical consistency of the generalized Lloyd algorithm,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 148-155, Mar. 1986.
26. D. A. Huffman, “A method for the construction of minimum-redundancy codes,” Pro. IRE, vol. 40, pp. 1098-1101, Sept. 1952.
27. R. G. Gallager, “Variations on a theme by Huffman,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 668-674, Nov. 1978.
28. J. Rissanen and G. G. Langdon, Jr., “Arithmetic coding,” IBM J. Res. Develop., vol. 23, pp. 149-162, Mar. 1979.
29. F. Rubin, “Arithmetic stream coding using fixed precision registers,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 672-675, Nov. 1979.
30. J. Ziv, “Coding theorems for individual sequences,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 405-412, July 1978.
31. T. Berger, M. U. Chang, and S. Y. Tung-Kleinberg, “Quantization-permutation codes and buffer-adapted Huffman codes,” in Proc. 18th Annu. Allerton Conf. Commun., Contr., Comput., Monticello, IL, 1980, pp. 443-436.
32. K. D. Rines and N. C. Gallagher, Jr., “The design of two-dimensional quantizers using pre-quantization,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 232-238, Mar. 1982.
33. D. J. Newman, “The hexagon theorem,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 137-139, Mar. 1982. (First appeared as a Bell Lab Tech. Memo, May 1964.)
34. J. Adoul and C. Lamblin, “A comparison of some algebraic structures for CELP coding of speech,” in Proc. ICAASP, Dallas, TX, Apr. 1987, pp. 45. 8.1-45.8.4.
35. M. R. Schroeder and N. J. A. Sloane, “New permutation codes using Hadamard unscrambling,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 144-146, Jan. 1987.
36. T. R. Fischer, “A pyramid vector quantizer,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 568-583, July 1986.
37. E. Ayanoglu and R. M. Gray, “The design of predictive trellis waveform coders using the generalized Lloyd algorithm,” IEEE Trans. Commun., vol. COM-34, pp. 1073-1080, Nov. 1986.
38. A. Buzo, A. H. Gray, Jr., R. M. Gray, and J. D. Markel, “Speech coding based upon vector quantization,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 562-574, Oct. 1980.
39. E. W. Forgey, “Cluster analysis of multivariate data: Efficiency versus interpretability of classifications,” Biometrics, vol. 21, no. 3, p. 768, 1965.
40. J. B. MacQueen, “Some methods for classification and analysis of multivariate observations,” in Proc. 5th Berkeley Symp. Math. Stat. Probabil. Berkeley, CA: University of California Press, 1967, pp. 281-297.
41. G. H. Ball and D. J. Hall, “ISODATA, A novel method of data analysis and pattern classification,” Tech. Rep. AD 699616, Stanford Res. Inst., Menlo Park, CA, 1965.
42. R. O. Duda and P. E. Hart, Pattern Classification and Scene Analysis. New York: Wiley, 1973.
43. J. H. Wolfe, “Pattern clustering by multivariate mixture analysis,” Multivariate Behavior. Res., vol. 5, pp. 329-350, 1970.
44. P. Cappello, G. Davidson, A. Gersho, C. Koc, and V. Somayazulu, “A systolic vector quantization processor for real-time speech coding,” in Proc. ICASSP, 1986, pp. 2143-2146.
45. R. Dianysian and R. L. Baker, “A VLSI chip set for real time vector quantization of image sequences,” in Proc. ISCS, May 1987.