Skip to main navigation Skip to search Skip to main content

Identification algorithm for the 2-D separable-in-denominator filter

Research output: Contribution to conferencePaperpeer-review

Abstract

Subspace algorithms that rely on robust numerical linear algebra are becoming increasingly important in areas such as array processing, mobile telephones, system identification, etc. The class of linear subspace system identification algorithms have already shown to be successful for industrial as well as environmental applications. These subspace identification algorithms use input/output data directly, contrary to other classical state-space identification algorithms that use Markov parameters. The advantages of the subspace algorithms are the automatic structure identification (system order), geometrical insights (notions of angle between subspaces), and the fact that they rely on robust numerical procedures (singular value decomposition). In this paper we extend the linear subspace identification algorithm to the class of 2-D balanced state space models, having separable horizontal/vertical structure.

Original languageEnglish
Pages12-17
Number of pages6
StatePublished - 1995
Externally publishedYes
EventProceedings of the 1995 Southcon Conference - Lauderdale, FL, USA
Duration: Mar 7 1995Mar 7 1995

Conference

ConferenceProceedings of the 1995 Southcon Conference
CityLauderdale, FL, USA
Period3/7/953/7/95

ASJC Scopus Subject Areas

  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials

Fingerprint

Dive into the research topics of 'Identification algorithm for the 2-D separable-in-denominator filter'. Together they form a unique fingerprint.

Cite this