Exponential H a filtering analysis for discrete-time switched neural networks with random delays using sojourn probabilities

This paper is concerned with the exponential H (a) filtering problem for a class of discrete-time switched neural networks with random time-varying delays based on the sojourn-probability-dependent method. Using the average dwell time approach together with the piecewise Lyapunov function technique, sufficient conditions are proposed to guarantee the exponential stability for the switched neural networks with random time-varying delays which are characterized by introducing a Bernoulli stochastic variable. Based on the derived H (a) performance analysis results, the H (a) filter design is formulated in terms of Linear Matrix Inequalities (LMIs). Finally, two numerical examples are presented to demonstrate the effectiveness of the proposed design procedure.