Speech compression with cosine and wavelet packet near-best bases

Author

Taswell, Carl

Author_Institution

Dept. of Comput. Sci., Stanford Univ., CA, USA

Volume

1

fYear

1996

fDate

7-10 May 1996

Firstpage

566

Abstract

Compression of speech from the TIMIT corpus was investigated for several transform domain methods coding near-best and best bases from cosine and wavelet packet transforms. Satisficing (suboptimizing) search algorithms for selecting near-best bases were compared with optimizing algorithms for best bases in these adaptive tree-structured transforms. Experiments were performed on several hundred seconds of speech spoken by both male and female speakers from all dialect regions of the TIMIT corpus. Near-best bases provided rate-distortion performance effectively as good as that of best bases but without the additional computational penalty. Cosine packet bases outperformed wavelet packet bases

Keywords

adaptive codes; data compression; optimisation; rate distortion theory; speech coding; transform coding; transforms; tree searching; wavelet transforms; TIMIT corpus; adaptive tree-structured transforms; cosine packet near-best bases; female speakers; male speakers; rate-distortion performance; satisficing search algorithms; speech coding; speech compression; suboptimizing search algorithms; transform domain methods; wavelet packet near-best bases; Additives; Computer science; Cost function; Mathematics; Rate-distortion; Scientific computing; Speech coding; Wavelet domain; Wavelet packets; Wavelet transforms;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1996. ICASSP-96. Conference Proceedings., 1996 IEEE International Conference on

Conference_Location

Atlanta, GA

ISSN

1520-6149

Print_ISBN

0-7803-3192-3

Type

conf

DOI

10.1109/ICASSP.1996.541159

Filename

541159