Title :
Globally optimal bit allocation
Author_Institution :
Dept. of Comput. Sci., Western Ontario Univ., London, Ont., Canada
Abstract :
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(MB2) time with integer constraint, or O(MB2B) 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
Keywords :
combinatorial mathematics; optimisation; vector quantisation; algorithmic techniques; globally optimal allocation; nested optimization problem; optimal bit allocation; quantizers; Bit rate; Computer science; H infinity control; Lagrangian functions; Quantization; Random variables; Resource management; Shape; Source coding; Time factors;
Conference_Titel :
Data Compression Conference, 1993. DCC '93.
Conference_Location :
Snowbird, UT
Print_ISBN :
0-8186-3392-1
DOI :
10.1109/DCC.1993.253148
