Decision trees for vector quantizer codebook searching

Author

Moayeri, Nader ; Neuhoff, David L.

Author_Institution

Dept. of Electr. & Comput. Eng., Rutgers Univ., Piscataway, NJ, USA

fYear

1988

fDate

11-14 Apr 1988

Firstpage

255

Abstract

Several incremental algorithms are presented for designing fixed length decision trees for searching the codebook of a vector quantizer (VQ). These trees are then used as the basis for a two-stage VQ, wherein the first stage is a high-rate, structured VQ with a fast quantization algorithm and the second stage is a low-rate optimal VQ. The mean square error and complexity of the resulting two-stage VQs are presented for i.i.d. Gaussian and speech sources, and are compared with both TSVQ and previous tree based two-stage VQ designs

Keywords

decision theory; encoding; speech analysis and processing; Gaussian sources; codebook searching; fixed length decision trees; speech sources; vector quantizer; Algorithm design and analysis; Arithmetic; Computational complexity; Computer science; Decision trees; Design engineering; Mean square error methods; Quantization; Source coding; Speech coding;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1988. ICASSP-88., 1988 International Conference on

Conference_Location

New York, NY

ISSN

1520-6149

Type

conf

DOI

10.1109/ICASSP.1988.196563

Filename

196563

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2997574