Abstract
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. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
