Abstract
Rederives recursive maximum likelihood (RML) for an autoregressive (AR) time series using the Levinson decomposition. This decomposition produces a recursive update of the likelihood function for the AR parameters in terms of the reflection coefficients, prediction error variances, and forward and backward prediction errors. A fast algorithm for this recursive update is presented and compared with the recursive updates of the Burg (1975) algorithm. The comparison clarifies the connection between Burg's algorithm and RML.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
