Lattice Implementation of the Recursive Maximum Likelihood Algorithm
1981 (English)In: Proceedings of the 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes, 1981, 1083-1084 p.Conference paper (Refereed)
A lattice implementation of the extended least-squares algorithm was recently developed. The convergence of that algorithm depends on a positive real condition, a fact which limits its usefulness in some applications. In this note the lattice equivalent of the recursive maximum likelihood algorithm is derived. This technique does not require the positive real condition and is suitable for modeling and prediction of general ARMA time-series.
Place, publisher, year, edition, pages
1981. 1083-1084 p.
Lattice implementation, Least-squares algorithm, Recursive maximum likelihood algorithm, ARMA time-series
IdentifiersURN: urn:nbn:se:liu:diva-102146DOI: 10.1109/CDC.1981.269385OAI: oai:DiVA.org:liu-102146DiVA: diva2:668589
20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes, San Diego, CA, USA, December, 1981