P.H. Westerink et al. (1988) developed an optimal bit allocation algorithm that is simplified when all operational distortion-rate functions (which are referred to as quantizer functions) are convex. This algorithm is restated using the generalized Breiman, Friedman, Olshen, and Stone (BFOS) algorithm (a recently developed technique for variable rate vector quantizer design) for both cases of convex and nonconvex quantizer functions (QFs), and its complexity is analyzed. The use of the generalized BFOS algorithm for optimal bit allocation is analysed. It is shown that if each source has a convex quantizer function then the complexity of the algorithm is low. >
['Eve A. Riskin']
Optimal bit allocation via the generalized BFOS algorithm