OPTIMAL BIT ALLOCATION VIA THE GENERALIZED BFOS ALGORITHM

被引：114

作者：

RISKIN, EA ^{[1
]}

机构：

[1] STANFORD UNIV,INFORMAT SYST LAB,STANFORD,CA 94305

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1991年 / 37卷 / 02期

关键词：

BIT ALLOCATION; VECTOR QUANTIZATION; TREE CODING;

D O I：

10.1109/18.75264

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：400 / 402

页数：3

共 9 条

[1]

Breiman L., 1984, CLASSIFICATION REGRE

[2]

CJHOU PA, 1989, IEEE T INFORM THEORY, V35, P299

[3]

GERSHO A, 1990, VECTOR QUANTIZATION

[4]

Knuth D.E., 1973, SORTING SEARCHING, V3

[5] ALGORITHM FOR VECTOR QUANTIZER DESIGN [J].

LINDE, Y ;

BUZO, A ;

GRAY, RM .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1980, 28 (01) :84-95

[6] CLASSIFIED VECTOR QUANTIZATION OF IMAGES [J].

RAMAMURTHI, B ;

GERSHO, A .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1986, 34 (11) :1105-1115

[7]

RISKIN EA, IN PRESS IEEE T ACOU

[8] EFFICIENT BIT ALLOCATION FOR AN ARBITRARY SET OF QUANTIZERS [J].

SHOHAM, Y ;

GERSHO, A .

IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1988, 36 (09) :1445-1453

[9]

WESTERINK PH, 1988, C P INT C ACOUST SPE, P757

← 1 →