Conditional entropy-constrained vector quantization: high-rate theory and design algorithms

• Published in: IEEE transactions on information theory Vol. 41; no. 4; pp. 901 - 916
• Main Authors: de Garrido, D.P., Pearlman, W.A.
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.07.1995; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithm design and analysis; Algorithms; Applied sciences; Clustering algorithms; Constraint theory; Entropy; Exact sciences and technology; Information technology; Information, signal and communications theory; Nearest neighbor searches; Network address translation; Probability density function; Rate-distortion; Sampling, quantization; Signal and communications theory; Systems engineering and theory; Telecommunications and information theory; Vector quantization; Cluster analysis; Algorithms; Vector quantization; Coding; Entropy; Performance; Optimization; Information theory

The performance of optimum vector quantizers subject to a conditional entropy constraint is studied. This new class of vector quantizers was originally suggested by Chou and Lookabaugh (1990). A locally optimal design of this kind of vector quantizer can be accomplished through a generalization of t...