Backward adaptive tree coding of speech at 16 kbps

6 January 2003

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

No. 15206149,p. 251-254
https://doi.org/10.1109/icassp.1988.196562

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

This publication has 13 references indexed in Scilit:

Incremental tree coding of speech (Corresp.)
IEEE Transactions on Information Theory, 1981
Sequentially Adaptive Backward Prediction in ADPCM Speech Coders
IEEE Transactions on Communications, 1978
Architecture and Construction of a Hardware Sequential Encoder for Speech
IEEE Transactions on Communications, 1977
Tree encoding of speech
IEEE Transactions on Information Theory, 1975
Application of the Viterbi algorithm to adaptive delta modulation with delayed decision
Proceedings of the IEEE, 1975
Adaptive Delta Modulation with Delayed Decision
IEEE Transactions on Communications, 1974
Digital coding of speech waveforms: PCM, DPCM, and DM quantizers
Proceedings of the IEEE, 1974
Delayed Encoding: Stabilizer for Adaptive Coders
IEEE Transactions on Communication Technology, 1971
Signal-to-Noise and Idle Channel Performance of Differential Pulse Code Modulation Systems - Particular Applications to Voice Signals
Bell System Technical Journal, 1966
Quantizing for minimum distortion
IEEE Transactions on Information Theory, 1960