Adaptive Multi-Innovation Gradient Identification Algorithms for a Controlled Autoregressive Autoregressive Moving Average Model

The controlled autoregressive autoregressive moving average (CARARMA) models are of popularity to describe the evolution characteristics of dynamical systems. To overcome the identification obstacle resulting from colored noises, this paper studies the identification of the CARARMA models by forming...

Full description

Saved in:
Bibliographic Details
Published inCircuits, systems, and signal processing Vol. 43; no. 6; pp. 3718 - 3747
Main Authors Xu, Ling, Xu, Huan, Ding, Feng
Format Journal Article
LanguageEnglish
Published New York Springer US 01.06.2024
Springer Nature B.V
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:The controlled autoregressive autoregressive moving average (CARARMA) models are of popularity to describe the evolution characteristics of dynamical systems. To overcome the identification obstacle resulting from colored noises, this paper studies the identification of the CARARMA models by forming an intermediate correlated noise model. In order to realize the real-time prediction function of the models, the on-line identification scheme is developed by constructing the dynamical objective functions based on the real-time sampled observations. Firstly, a rolling optimization cost function is built based on the observation at a single sampling instant to catch the modal information at a single time point and a generalized extended stochastic gradient (GESG) algorithm is proposed through the stochastic gradient optimization. Secondly, a rolling window cost function is built in accordance with the dynamical batch observations within data window by extending the proposed GESG algorithm and the multi-innovation generalized extended stochastic gradient algorithm is derived. Thirdly, from the perspective of theoretical analysis, the convergence proof of the proposed algorithm is provided based on the stochastic martingale convergence theory. Finally, the simulation analysis and comparison studies are provided to show the performance of the proposed algorithms.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0278-081X
1531-5878
DOI:10.1007/s00034-024-02627-z