Sign up & Download
Sign in

Propagator-based methods for recursive subspace model identification

by Guillaume Mercère, Laurent Bako, Stéphane Lecœuche
Signal Processing (2008)

Abstract

The problem of the online identification of multi-input multi-output (MIMO) state-space models in the framework of discrete-time subspace methods is considered in this paper. Several algorithms, based on a recursive formulation of the MIMO Output Error State-Space (MOESP) identification class, are developed. The main goals of the proposed methods are to circumvent the huge complexity of eigenvalues or singular values decomposition techniques used by the offline algorithm and to provide consistent state-space matrices estimates in a noisy framework. The underlying principle consists in using the relationship between array signal processing and subspace identification to adjust the propagator method (originally developed in array signal processing) to track the subspace spanned by the observability matrix. The problem of the (coloured) disturbances acting on the system is solved by introducing an instrumental variable in the minimized cost functions. A particular attention is paid to the algorithmic development and to the computational cost. The benefits of these algorithms in comparison with existing methods are emphasized with a simulation study in time-invariant and time-varying scenarios.

Cite this document (BETA)

Sign up today - FREE

Mendeley saves you time finding and organizing research. Learn more

  • All your research in one place
  • Add and import papers easily
  • Access it anywhere, anytime

Start using Mendeley in seconds!

Already have an account? Sign in

Readership Statistics

7 Readers on Mendeley
by Discipline
 
 
by Academic Status
 
43% Ph.D. Student
 
14% Student (Bachelor)
 
14% Student (Master)
by Country
 
14% China
 
14% India
 
14% Brazil