Abstract
The use of the generalized Breiman Friedman. Olshen. and Stone (BFOS) algorithm, a recently developed technique for variable rate vector quantizer design, for optimal bit allocation is analyzed. It is shown that if each source has a convex quantizer function, then the complexity of the algorithm is low.
Original language | English |
---|---|
Pages (from-to) | 400-402 |
Number of pages | 3 |
Journal | IEEE Transactions on Information Theory |
Volume | 37 |
Issue number | 2 |
DOIs | |
State | Published - Mar 1991 |
Keywords
- Bit allocation
- tree coding
- vector quantization