Asynchronous Filtering of Discrete-Time Switched Linear Systems With Average Dwell Time

Abstract

Switched dynamical systems can be found in many practical electronic circuits, such as various kinds of power converters, chaos generators, etc. This paper is concerned with the filter design problem for a class of switched system with average dwell time switching. Mode-dependent full-order filters are designed taking a more practical phenomenon, the asynchronous switching into account, where “asynchronous” means that the switching of the filters to be designed has a lag to the switching of the system modes. New results on the stability and <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">l</i> <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> -gain analyses for the systems are first given where the Lyapunov-like functions during the running time of subsystems are allowed to increase. In light of the proposed Lyapunov-like functions, the desired mode-dependent filters can be designed in that the unmatched filters are allowed to perform in the interval of the asynchronous switching before the matched ones are applied. In <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">H</i> <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> sense, the problem of asynchronous filtering for the underlying systems in linear cases is formulated and the conditions of the existence of admissible asynchronous filters are obtained. Two examples are provided to show the potential of the developed results.