We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Optimal bit allocation via the generalized BFOS algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Riskin, E.A. ; Inf. Syst. Lab., Stanford Univ., CA, USA

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

Published in:

Information Theory, IEEE Transactions on  (Volume:37 ,  Issue: 2 )