DocumentCode
936181
Title
Low-rate tree coding of autoregressive sources (Corresp.)
Author
Anderson, Jon
Volume
29
Issue
2
fYear
1983
fDate
3/1/1983 12:00:00 AM
Firstpage
279
Lastpage
284
Abstract
The performance of differential pulse-code modulation and random codes is evaluated experimentally for a range of autoregressive sources, including Gaussian and Laplacian sources of orders
, and
encoded at rates
, and
. Correlations are typical of those encountered in speech and images. Results show that the gain from a fixed moderate degree of code searching increases as the rate decreases, and increases consistently with
, where
is the Berger-Gray critical distortion. Laplacian and Gaussian sources behave similarly. Random codes perform better than DPCM codes for lightly correlated Laplacian sources but are otherwise worse.
, and
encoded at rates
, and
. Correlations are typical of those encountered in speech and images. Results show that the gain from a fixed moderate degree of code searching increases as the rate decreases, and increases consistently with
, where
is the Berger-Gray critical distortion. Laplacian and Gaussian sources behave similarly. Random codes perform better than DPCM codes for lightly correlated Laplacian sources but are otherwise worse.Keywords
Autoregressive processes; Differential pulse-code modulation; Source coding; Tree coding; Councils; Functional analysis; Laplace equations; Measurement units; Modulation coding; Pulse modulation; Quantization; Reflection; Speech; Systems engineering and theory;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1983.1056644
Filename
1056644
Link To Document