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 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.