Subspace algorithm for identifying bilinear repetitive processes with deterministic inputs

摘要

In this paper we introduce a bilinear repetitive process and present an iterative subspace algorithm for its identification. The advantage of the proposed approach is that it overcomes the “curse of dimensionality”, a hurdle commonly encountered with classical bilinear subspace identification algorithms. Simulation results show that the algorithm converges quickly and provides new alternatives for modeling/identifying nonlinear repetitive processes.