Exact ARMA lattice predictors from autocorrelation functions

The paper derives an optimal linear L/sup 2/-predictor of ARMA-type in the lattice form of arbitrarily fixed dimensions for a process whose autocorrelation function is known. The algorithm preserves exact optimality at each step, as opposed to asymptotic convergence of more usual algorithms, at the...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing Vol. 42; no. 4; pp. 877 - 886
Main Authors: Monin, A., Salut, G.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.04.1994
Institute of Electrical and Electronics Engineers
Subjects:
ISSN:1053-587X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The paper derives an optimal linear L/sup 2/-predictor of ARMA-type in the lattice form of arbitrarily fixed dimensions for a process whose autocorrelation function is known. The algorithm preserves exact optimality at each step, as opposed to asymptotic convergence of more usual algorithms, at the expense of hereditary computation. Only the discrete-time case is examined. It is shown how the unnormalized (respectively normalized) lattice form may be reduced to only 4n-2 parameters (respectively 2n+1) for a nth-order projection on the past. The normalization algorithm for the forward and backward residuals uses only scalar square root computations. Some examples that show the accuracy of this technique compared with those using the classical ARMA form for the predictor, are given.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1053-587X
DOI:10.1109/78.285651