Robust filtering for discrete nonlinear fractional transformation systems

In this brief, we consider robust filtering problems for uncertain discrete-time systems. The uncertain plants under consideration possess nonlinear fractional transformation (NFT) representations which are a generalization of the classical linear fractional transformation (LFT) representations. The...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on circuits and systems. II, Express briefs Vol. 51; no. 11; pp. 587 - 592
Main Authors Nguyen Thien Hoang, Hoang Duong Tuan, Apkarian, P., Hosoe, S.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.11.2004
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:In this brief, we consider robust filtering problems for uncertain discrete-time systems. The uncertain plants under consideration possess nonlinear fractional transformation (NFT) representations which are a generalization of the classical linear fractional transformation (LFT) representations. The proposed NFT is more practical than the LFT, and moreover, it leads to substantial performance gains as well as computational savings. For this class of systems, we derive linear-matrix inequality characterizations for H/sub 2/, & H/sub /spl infin//, and mixed filtering problems. Our approach is finally validated through a number of examples.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1549-7747
1558-3791
DOI:10.1109/TCSII.2004.837285