Backward adaptive tree coding of speech at 16 kbps

Author

Gibson, Jerry D. ; Haschke, Greg B.

Author_Institution

Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA

fYear

1988

fDate

11-14 Apr 1988

Firstpage

251

Abstract

The authors investigate the performance of eight fully backward adaptive DPCM-based code generators with exhaustive searching to shallow depths. In particular, they compare the performance of fixed (matched and unmatched) autoregressive (AR), fixed (matched and unmatched) moving average (MA), undamped and damped Kalman AR, and undamped and damped gradient MA code generators in DPCM searched to a maximum depth of 5 with incremental single symbol release. SNR, subjective listening test, and spectrogram performance comparisons are employed. The performance gain due to adaptive prediction over unmatched fixed prediction is greater than the gain provided by multipath searching over single path searching

Keywords

encoding; speech analysis and processing; 16 kbit/s; DPCM based code generators; Kalman autoregressive code generators; SNR; backward adaptive tree coding; exhaustive searching; fixed autoregressive code generators; fixed moving code generators; gradient moving average code generators; spectrogram performance; speech coding; subjective listening test; Delay; Distortion measurement; Kalman filters; Performance gain; Phase change materials; Signal to noise ratio; Spectrogram; Speech coding; Testing; Viterbi algorithm;

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

Filename

196562