Bilinear system identification using subspace method

Abstract EN

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 .