Title :
Least squares-based identification methods for a class of multivariable systems with autoregressive noises
Author :
Yanjun, Liu ; Xianling, Lu ; Rui, Ding
Author_Institution :
Key Lab. of Adv. Process Control for Light Ind. (Minist. of Educ.), Jiangnan Univ., Wuxi, China
Abstract :
This paper focuses on the identification of a class of multivariable systems with autoregressive noises. Two least squares-based algorithms are provided. One is the recursive generalized least squares algorithm. The idea is to integrate the colored noise regression terms into the information matrix and the noise parameters into the parameter vector, respectively, using the Kronecker product, and then to identify the parameter vector. The unknown terms in the integrated information matrix are replaced with their estimates. The other is the filtering-based recursive least squares algorithm. The idea is to transfer the system with a colored noise into a system with a white noise by filtering the input-output data with a specific filter, and then to identify the filtered model and the noise model interactively to obtain the parameter estimates. The filter is selected according the noise model structure. A simulation example is given to illustrate the effectiveness and the performances of the two proposed algorithms.
Keywords :
filtering theory; least squares approximations; matrix algebra; multivariable systems; regression analysis; Kronecker product; autoregressive noises; colored noise regression terms; filtered model; information matrix; input-output data; integrated information matrix; least squares based identification methods; multivariable systems; noise parameters; parameter estimation; parameter vector; MIMO; Mathematical model; Noise; Parameter estimation; Signal processing algorithms; Stochastic processes; Vectors; Autoregressive noise; Filtering-based algorithm; Least squares; Multivariable systems; Parameter estimation;
Conference_Titel :
Control Conference (CCC), 2012 31st Chinese
Conference_Location :
Hefei
Print_ISBN :
978-1-4673-2581-3