Convergence of the projection method for an autoregressive process and a matched DPCM code

Author

Pour, Morteza Naraghi ; Neuhoff, David L.

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA

Volume

36

Issue

6

fYear

1990

fDate

11/1/1990 12:00:00 AM

Firstpage

1255

Lastpage

1264

Abstract

The key step in the analysis of differential pulse code modulation (DPCM) is to find the steady-state probability distribution of a random process in terms of which the code distortion can be evaluated. For the case of an autoregressive source and a matched DPCM code, a well-known approximation technique has been used for the evaluation of the steady-state distribution of the prediction error process. However, the validity of this approximation method has not been justified before. A framework in which this approximation technique can be viewed as the projection method for the solution of integral equations is established. Sufficient conditions under which the approximation method can be rigorously justified are obtained

Keywords

approximation theory; convergence of numerical methods; encoding; filtering and prediction theory; pulse-code modulation; random processes; approximation method; autoregressive source; code distortion; convergence; differential pulse code modulation; integral equations; matched DPCM code; prediction error process; projection method; random process; steady-state probability distribution; Approximation methods; Autoregressive processes; Convergence; Integral equations; Modulation coding; Probability distribution; Pulse modulation; Random processes; Steady-state; Sufficient conditions;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.59926

Filename

59926