Interpolative DPCM

1 June 1984

journal article
research article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications

Vol. 32 (6) , 729-736
https://doi.org/10.1109/tcom.1984.1096121

Abstract

Recent results have established that DPCM is quite inefficient when encoding tightly correlated autoregressive sources at low rates. This work presents a slightly more complex code generator based on interpolation for rate 1 encoding of such sources and evaluates its performance via simulation for Gaussian and Laplacian distributed general stationary autoregressive sources. Improvements in the range of 3 dB over the LMS predictive quantizer for speech-like correlated sources at rate 1 have been realized with no tree searching. Another 1 dB is gained with a moderate tree searching. The code generator is less sensitive to the quantizer step size and a locally mismatched source than DPCM, two desirable features for encod, ing quasi-stationary sources.

Keywords

This publication has 12 references indexed in Scilit:

Low-rate tree coding of autoregressive sources (Corresp.)
IEEE Transactions on Information Theory, 1983
Alphabet-constrained data compression
IEEE Transactions on Information Theory, 1982
Adaptive Tree Encoding of Speech at 8000 Bits/s with a Frequency-Weighted Error Criterion
IEEE Transactions on Communications, 1979
Tree-Encoding of Speech Using the (M, L)-Algorithm and Adaptive Quantization
IEEE Transactions on Communications, 1978
A Fake Process Approach to Data Compression
IEEE Transactions on Communications, 1978
Tree encoding of speech
IEEE Transactions on Information Theory, 1975
Quantization Error in Predictive Coders
IEEE Transactions on Communications, 1975
Differential PCM for Speech and Data Signals
IEEE Transactions on Communications, 1972
Minimum Mean-Squared-Error Quantization in Speech PCM and DPCM Systems
IEEE Transactions on Communications, 1972
Information rates of autoregressive processes
IEEE Transactions on Information Theory, 1970