A filtering‐based recursive extended least squares algorithm and its convergence for finite impulse response moving average systems

This article considers the parameter identification problems of stochastic systems which described by the finite impulse response moving average model. Since the system is disturbed by colored noise, we introduce the data filtering technique from a view point of improving the parameter estimation ac...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International journal of robust and nonlinear control Ročník 34; číslo 9; s. 6063 - 6082
Hlavní autori: Zheng, Jiayun, Ding, Feng
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Bognor Regis Wiley Subscription Services, Inc 01.06.2024
Predmet:
Accuracy
Algorithms
Convergence
data filtering
Filtration
Impulse response
Least squares
Mathematical models
Parameter estimation
Parameter identification
recursive least squares
stochastic system
Stochastic systems
ISSN:1049-8923, 1099-1239
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This article considers the parameter identification problems of stochastic systems which described by the finite impulse response moving average model. Since the system is disturbed by colored noise, we introduce the data filtering technique from a view point of improving the parameter estimation accuracy. The data filtering technique is to use a filter to filter the input and output data of the system disturbed by colored noise so as to improve the identification accuracy. By using the data filtering technique, this article proposes a filtering‐based recursive extended least squares (F‐RELS) algorithm. The convergence analysis indicates that the parameter estimates can converge to their true values. Compared with the recursive extended least squares algorithm, the proposed F‐RELS algorithm can obtain more accurate parameter estimation. Finally, a numerical simulation example is given to demonstrate the effectiveness of the proposed algorithms.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1049-8923
1099-1239
DOI:10.1002/rnc.7307