An optimal bit allocation algorithm for sub-band coding

An optimal bit allocation algorithm is presented that is suitable for all practical situations. Each source to be coded is assumed to have its own set of admissible quantizers (which can be either scalar or vector quantizers) which do not need to have integer bit rates. The distortion versus rate characteristic of each quantizer set may have an arbitrary shape. The algorithm is very simple in structure and can be applied to any practical coding scheme (such as a subband coder) that needs dynamic bit allocation.<<ETX>>

[1]  Godfried T. Toussaint,et al.  PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY. , 1980 .

[2]  P. Schultheiss,et al.  Block Quantization of Correlated Gaussian Random Variables , 1963 .

[3]  Yair Shoham,et al.  Efficient codebook allocation for an arbitrary set of vector quantizers , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[4]  J. Woods,et al.  Sub-band coding of images , 1986, ICASSP '86. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[5]  John W. Woods,et al.  Subband coding of images , 1986, IEEE Trans. Acoust. Speech Signal Process..

[6]  Adrian Segall Bit allocation and encoding for vector sources , 1976, IEEE Trans. Inf. Theory.