Optimal Bit Allocation via the Generalized BFOS Algorithm

Eve A. Riskin

doi:10.1109/18.75264

Optimal Bit Allocation via the Generalized BFOS Algorithm

Eve A. Riskin

Department of Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

142 Scopus citations

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	https://doi.org/10.1109/18.75264
State	Published - Mar 1991

Keywords

Bit allocation
tree coding
vector quantization

Access to Document

10.1109/18.75264

Cite this

@article{997e6e02beac499fb7d45b769c9ff125,

title = "Optimal Bit Allocation via the Generalized BFOS Algorithm",

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.",

keywords = "Bit allocation, tree coding, vector quantization",

author = "Riskin, \{Eve A.\}",

year = "1991",

month = mar,

doi = "10.1109/18.75264",

language = "English",

volume = "37",

pages = "400--402",

number = "2",

}

TY - JOUR

T1 - Optimal Bit Allocation via the Generalized BFOS Algorithm

AU - Riskin, Eve A.

PY - 1991/3

Y1 - 1991/3

N2 - 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.

AB - 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.

KW - Bit allocation

KW - tree coding

KW - vector quantization

UR - https://www.scopus.com/pages/publications/0026116755

UR - https://www.scopus.com/inward/citedby.url?scp=0026116755&partnerID=8YFLogxK

U2 - 10.1109/18.75264

DO - 10.1109/18.75264

M3 - Article

AN - SCOPUS:0026116755

SN - 0018-9448

VL - 37

SP - 400

EP - 402

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 2

ER -

Optimal Bit Allocation via the Generalized BFOS Algorithm

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this