Globally optimal bit allocation
Given M quantizers of variable rates, scaler or/and vector, the globally optimal allocation of B bits to the M quantizers can be computed in O(MB/sup 2/) time with integer constraint, or O(MB2/sup B/) time without. The author also considers the nested optimization problem of optimal bit allocation with respect to optimal quantizers. Various algorithmic techniques are proposed to solve this new problem in pseudo-polynomial time.<<ETX>>