A Simplified Descriptor System Approach to Delay-Dependent Stability and Robust Performance Analysis for Discrete-Time Systems with Time Delays

A simplified descriptor system approach is proposed for discrete-time systems with delays in terms of linear matrix inequalities. In comparison with the results obtained by combining the descriptor system approach with recently developed bounding technique, our approach can remove the redundant matrix variables while not reducing the conservatism. It is shown that the bounding technique is unnecessary in the derivation of our results. Via the proposed method, delay-dependent results on quadratic cost and


Introduction
In the past decades, considerable attention has been paid to the problems of stability analysis and control synthesis of time-delay systems.Many methodologies have been proposed, and a large number of results have been established (see, e.g., [1,2] and the references therein).All these results can be generally divided into two categories: delayindependent stability conditions [3,4] and delay-dependent stability conditions [5][6][7][8][9][10][11].The delay-independent stability condition does not take the delay size into consideration and thus is often conservative especially for systems with small delays, while the delay-dependent stability condition makes fully use of the delay information and thus is less conservative than the delay-independent one.Very recently, in order to provide less conservative delay-dependent stability criteria, a descriptor system approach was proposed in [12,13], while a new bounding technique has been presented in [14] (also called Moon's inequality).By combining the descriptor system approach with the bounding technique, novel delaydependent sufficient conditions for the existence of a memoryless feedback guaranteed cost controller are derived for a class of discrete-time systems with delays in [6,7].
Although the descriptor system approach proposed in [12,13] is powerful to deal with the stability analysis of time-delay systems, there are too many matrix variables introduced.In [15], a simplified but equivalent descriptor system approach to delay-dependent stability analysis was established for the continuous-time systems with delays.It is shown in [15] that the bounding technique in [14] is not necessary when deriving the delay-dependent stability results.It should be pointed out that the result in [15] is only applicable to continuoustime systems with delays.In this paper, we focus our attention upon deriving a simplified descriptor system approach to delay-dependent stability analysis in the context of discretetime systems with delays.It is shown that the results derived by our approach are also equivalent to those obtained in [6,7] but with fewer variables to be determined.It is also proved that, for discrete-time systems, the bounding technique in [14] will introduce some redundant variables and thus is unnecessary.Via the proposed method, delay-dependent results on quadratic cost and  ∞ performance analysis are also presented.It is worth mentioning that through the approach proposed in this paper, the delay-dependent guaranteed cost control conditions in [6,7] obtained by the descriptor system approach and the bounding technique can also be simplified.
Notations.Throughout this paper, for real symmetric matrices  and , the notation  ≥  (resp.,  > ) means that the matrix  −  is positive semidefinite (resp., positive definite).The superscript "" represents the transpose. is an identity matrix with appropriate dimension.diag (⋅) denotes a diagonal matrix. 2 [0, ∞) refers to the space of square summable infinite vector sequences.In symmetric block matrices, we use an asterisk " * " to represent a term that is induced by symmetry.Matrices, if not explicitly stated, are assumed to have compatible dimensions for algebraic operations.

Main Results
In order to introduce the simplified descriptor system approach, we consider the following discrete time-delay system where () ∈ R  is the state,  0 () = 0, () is the initial condition, the scalar ℎ > 0 is an upper bound on the time delays   (),  = 1, 2, and   ,  = 0, 1, 2, are known real constant matrices.
Throughout this paper, we make the following assumption.
Assumption 1.   () are unknown but satisfy for all  ∈ Z + 0 <   () ≤   ,  = 1,2. ( Now, we are in a position to present the main result of this paper. Theorem 2. Under Assumption 1, the time-delay system (Σ  ) is asymptotically stable for all   (),  = 1, 2, satisfying (2) if there exist matrices  > 0,   ,   ,   , and   ,  = 1, 2, such that the following LMI holds: where Proof.For all   (),  = 1, 2, satisfying (2), it can be verified that (3) implies that Let It is easy to see that Then, the system (Σ  ) can be transformed into an equivalent descriptor form Now, choose a Lyapunov functional candidate as where Then,
Remark 3. It is noted that only two time delays are considered for the sake of simplicity.However, the results in Theorem 2 can be extended to the case of multiple delays.The simplified approach in Theorem 2 can also be used to tackle with the discrete time-delay systems with uncertainties, such as normbounded parameter uncertainties and linear fractional uncertainties.
Remark 4. Note that the delays considered here satisfy (2).
From the proof of Theorem 2, the delay-dependent results in this paper can be extended to the case of interval delays (see [16] for more details), where the delays vary between a lower bound (may be not zero) and an upper bound.
By the method proposed in Theorem 2, the quadratic cost analysis result derived by using the descriptor system approach, together with the inequality in [14] as shown in [6,7], can also be simplified.To make it clear, introduce the following quadratic cost function Then, by Theorem 2, we have the following result.
In the next, via the method proposed in Theorem 2, we will present the  ∞ performance analysis result.
Consider the following time-delay system: where () ∈ R  is the output and () ∈ R  is the disturbance signal which is assumed to be in  2 [0, ∞).

A Numerical Example
In this section, we present a numerical example to the effectiveness of the proposed algorithm.In order to show the comparison,we choose  2 = 0 and  2 = 0.
Based on Theorem 2, we seek the maximum value of  1 .Compared with three methods, which are in [6,17,18], respectively; we can illustrate the advantage of the proposed algorithm in this paper.Table 1 presents the result of comparison.

Conclusions
In this paper, we have proposed a simplified delay-dependent stability condition for discrete-time systems with delays.The given condition has fewer variables compared with those established using the descriptor system approach with Moon's bounding technique.It has been shown that Moon's bounding technique is unnecessary when deriving the delay-dependent stability conditions.By the proposed method in this paper, the delay-dependent results on quadratic cost and  ∞ performance analysis have also been provided.

Table 1 :
the maximum delay bound of  1 .