Journal article
Optimal quantization by matrix searching
Abstract
Optimal quantization, a fundamental problem in source coding and information theory, can be formulated as a discrete optimization problem. In 1964 Bruce (“Optimum Quantization,” Sc.D. thesis, MIT, May 1964) devised a dynamic programming algorithm for discrete optimal quantization. For the mean-square error measure and when the amplitude density function of the quantized signal is represented by a histogram of N points, Bruce's algorithm can …
Authors
Wu X
Journal
Journal of Algorithms, Vol. 12, No. 4, pp. 663–673
Publisher
Elsevier
Publication Date
12 1991
DOI
10.1016/0196-6774(91)90039-2
ISSN
0196-6774