On two or more dimensional optimum quantizers
D. Chen · 2005
It is hard to compute the performance of an N-level K-dimensional optimum quantizer\hat{Q}_{N}directly. In this paper the performance of\hat{Q}_{N}is studied more closely from the performance of Q'N, a class of stationary quantizers. An analytical derivation of the algorithm for generating Q'Nquantizers and a computer experimental study on the performance of Q'Nfor two dimensional case are given. The results show that it is possible to bound the performance of\hat{Q}Nmore closely from Q'N.