Open AccessBilinear System Identification Using Subspace Method
Author(s) -
Baghdad Science Journal
Publication year - 2007
Publication title -
mağallaẗ baġdād li-l-ʿulūm
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.167
H-Index - 6
eISSN - 2411-7986
pISSN - 2078-8665
DOI - 10.21123/bsj.4.4.670-675
Subject(s) - bilinear interpolation , subspace topology , block (permutation group theory) , algorithm , identification (biology) , convergence (economics) , mathematics , computational complexity theory , computer science , artificial intelligence , combinatorics , statistics , botany , economics , biology , economic growth
In this paper, a subspace identification method for bilinear systems is used . Wherein a " three-block " and " four-block " subspace algorithms are used. In this algorithms the input signal to the system does not have to be white . Simulation of these algorithms shows that the " four-block " gives fast convergence and the dimensions of the matrices involved are significantly smaller so that the computational complexity is lower as a comparison with " three-block " algorithm .