Abstract

This article is committed to filtering for linear discrete-time systems with time-varying delay. The novelty of the paper comes from the consideration of the new Wirtinger-based inequality with double accumulation terms and the idea of delay-partitioning, which guarantees a better asymptotic stability and is less conservative than the celebrated free-weighting matrix or Jensen’s inequality methods. In combination with the improved Wirtinger-based inequality to handle the modified Lyapunov-Krasovskii (L-K) functionals, a new delay-dependent bound real lemma (BRL) is gained. In the light of the derived performance analysis results, the filter will be designed in response to linear matrix inequality (LMI). The validness of the proposed methods will be expressed via some numerical examples by the comparison of existing results.

1. Introduction

Concerning the design of the filter for control systems, a large number of results were investigated in the literature (see, for example, [113] and reference therein). As we all know, one of its goals is to design a more suitable and stable filter to make the maximum ratio of noise signal to estimated error less than a certain positive value, thus ensuring that the norm from the interference input to the estimated error output is minimized. Because the classical Kalman filter provides the optimal estimation with the minimum root mean square error as the objective function and makes idealized assumptions in the filtering process, for example, the system model or system disturbance is available. However, in practical engineering applications, when problems such as model uncertainty and noise assumptions are not clear, the Kalman filter becomes incapable. Therefore, in order to cope with model uncertainty and parameter uncertainty, robust Kalman filtering and adaptive Kalman filtering have emerged, respectively. But the results are not satisfactory. Afterwards, researchers began to explore more realistic filters from the perspective of robustness, including the filter we have mentioned earlier. Compared with and Kalman filter, the filter merely requires the noise energy to be limited without statistical information or the prior knowledge of noise. Obviously, filter has better robustness and it is more suitable for practical engineering applications.

In addition, time delay is common and inevitable phenomenon existing in control systems, which often makes our systems property decline or even course instability. However, the results show that the stability condition of delay-dependent filter is less conservative than delay-independent filter [1418]. In order to reduce the conservativeness of the results obtained, many pieces of literature have studied the bounding techniques for cross-terms and model transformation and selected the appropriate Lyapunov-Krasovskii (L-K) functionals deeply in [1928]. As mentioned in [29, 30], for delay-dependent filter design for discrete-time systems, the authors had proposed using delay-partitioning idea [30, 31] to divide the constant lower bound into m partial intervals. As a result, this delay-partitioning method was included in the newly defined L-K functionals, which means the results acquired also rely on the number of divisions m for the lower bound . Therefore, the idea of delay-partitioning plays an important role in reducing the conservativeness of time-delay systems. Furthermore, in combination with some conventional methods, such as free-weighting matrix [32], Jensen’s inequality [33], and Wirtinger-based integral inequality with single summation [34], to deal with the chosen L-K functionals, we gained efficient stability analysis criteria for discrete-time systems with time-delay. In the latest article, researchers have proposed Wirtinger-based integral inequality with double summation [35] and reciprocally convex combination inequality [36], which have been applied in practice. And we note that the novel Wirtinger-based integral inequality also has a significant effect in dealing with some nonlinear systems. For example, in [37], Wei and Qiu skillfully combine the new Wirtinger-based integral inequality with the improved reciprocally convex approach and S-processes to obtain a novel performance analysis criterion for the underlying closed-loop system. Thus, it effectively reduces the conservativeness of the original results. As the same, for the nonlinear systems with time-varying delays, choosing the appropriate L-K functional and combining an improved Wirtinger-based inequality to handle with the quadratic accumulation term encountered in the derivation of L-K functional are equally effective, as in [38]. Accordingly, this novel summation inequality is more effective than the routine methods—free-weighting matrix, Jensen’s inequality, and Wirtinger-based inequality with single summation, which has introduced more system elements while adding a quadratic accumulation term. Thus, we can grasp more systematic information to achieve the purpose of reducing the conservativeness of the original results.

Inspired by the abovementioned, the main contribution of this paper is to further improve the stability criteria for discrete-time systems with time-varying delay and we work on reducing the conservativeness of the stability results. By introducing the new quadratic summation term, more system information is added to our consideration as much as possible in order to make full use of the novel Wirtinger-based inequality to deal with the integral term in L-K functional. For the effective means delay-partitioning and a novel summation inequality, an improved delay-dependent filter design for discrete-time systems with a state delay will be presented, importantly, utilizing the new Wirtinger-based inequality with double summation to further process the modified L-K functional, which can acquire a lower conservativeness contrast to what we have mentioned above. Finally, some elaborate numerical examples will be given to prove the effectiveness and the advantage of our ways.

Throughout our paper, the superscript “” represents the matrix transposition, denotes the set of nonnegative, expresses the n-dimensional Euclidean space, means the set of all real matrices, stands for zero matrix, I and indicate an identity matrix and a zero matrix with appropriate dimension, respectively, and is used to denote the matrix is positively defined and symmetric. Moreover, the shows , and means a block-diagonal matrix. And in the symmetric matrix, the symmetric term is defined as, e.g.,

2. System Description and Problem Analysis

Define the following linear time-invariant discrete-time system with a state delay:where stands for the state vector; represents the measured output; means the signal to be measured; is the noise input content ; = , =, is a given initial condition sequence; expresses the time delay and we assume that it satisfiesand besides, and indicate the known lower bounds and upper bounds of time delay, respectively. At the same time, , and are known constant systems matrices.

Given system (2), we are committed to design a linear time-invariant filter to guarantee the (output of the filter) tracks the original to be estimated. Consider a linear full-order filter described bywhere is the filter state, and , and are filer matrices to be determined.

Defining the augmented state vector , and the estimation error , we receive the following filtering error system:where

Owing to the fact that the original system model has no control input, to prove the asymptotic stability of the filtering error system, we need to assume that system (2) is asymptotically stable.

The propose of our paper is to design a stable full-order filter of the form (4) and meet the following two points: Firstly, the filter error system (5) is asymptomatically stable and secondly, the filtering error system in (5) has a prescribed level of noise attenuation, and under zero-initial condition, is satisfied for all nonzero

Before entering the next section, a vital lemma will be introduced to be used in the derivation of our conclusion. Then, for any sequence of discrete-time variable in , we define , , .

Lemma 1 (see [35, 39]). For any sequence of discrete-time variable in , matrices , , , and an arbitrary vector , the following summation inequality holds:where

Remark 2. As Lemma 1 described, if and , inequality (7) could be represented into the following inequality:where

3. Performance Analysis

In this part, we will conduct filtering stability analysis by using aforementioned Lemma 1. Before we begin, considering the idea of the delay-partitioning, we note that the lower bound of time-varying delay will be described as , where and are positive integers. Meanwhile, several definitions are as follows:

Theorem 3. In view of system (2), we assume integers and with satisfying . For an admissible filter and a prescribed scalar , the filtering error system (5) is asymptomatically stable if there exist real matricessuch that following LMIholds for , where

Proof. Now, considering the idea of a slack-variable [40] and using the similar lines as in [29], the following LMI (15) is equivalent to (13):Then, we consider the modified L-K functional candidate which contains the delay partitioning items:withAnd we note that , , , , , . Then utilizing the previously described , we will obtain the equation as follows:Applying inequality (9), to the summation terms in (21), and we can set = ), the following inequalities hold:Also, apply inequality (9), and set = , (1/()), ; we haveSimilarly, apply inequality (9), and set = ; then we haveThen, by combining (18)–(24), and we suppose that the input has zero noise, i.e., , and we havewhereAccording to the Schur complement, for all nonzero , is equivalent to the LMI in (13). Thus, the negative definition of the will guarantee the filtering error system (5) is asymptotically stable.
Furthermore, in order to construct the performance index, we define . And under zero initial condition , , and , one obtainswhere . By using the Schur complement, inequality (27) indicates that , which is equivalent to the LMI (15). Besides, for all , . Then, this completes the proof.

Remark 4. Different from the previous methods where free-weighting matrix and Jensen’s inequality are used to handle the double summation function in the proof of Theorem 3, the novel Wirtinger-based inequality with double summation could carry out an accurate summation inequality to bound the signal summation term and give rise to the derivative of the L-K functional to get vital in reducing the conservatism.

4. Filter Design

In this section, we will focus on the design of full-order filter for state delay in system (2).

Theorem 5. In view of system (2), we assume integers and with satisfying . For an admissible filter of form (4) ensure a prescribed norm bound and the asymmetric stability of the filtering error system (5) exist if there exist matrices of appropriate dimensions andsuch that following LMIs are satisfied:whereThen, the filtering problem can be solved. In addition, a suitable filter state space realization is presented by

Proof. Due to and LMI in (29), it follows that and , respectively, which means . Thus, we can conclude that is nonsingular and for arbitrary square and nonsingular matrices and , meeting . Then, we define the matrices:Then, matric and LMI (29) can be expressed asSo, by way of congruent transformation to LMI (34) and (35), respectively, with and , it is clear that LMI in (29) is equivalent to (13). Consequently, from Theorem 5, we could draw a conclusion that the filtering error system in (5) is asymptotically stable with a norm bound .
The next job is to get the filer state-space realization as (31). Through some conventional matrix processing in [10], substituting into (33), thencould be directly rewritten asDue to the fact that matrices and are nonsingular, we can infer thatis also nonsingular. And this makes the point that the following systems are algebraically equivalent:and thus, a state-space realization , which is defined in (4), of the desired filter could be acquired from (39). This completes the proof.

5. Numerical Examples

Example 1 (see [29]). Firstly, we consider system (2) with varying-delay:and , , , by processing of Theorem 5, the optimal , which is much less than [1], [29], [29], respectively. Our achieved results have lower conservativeness than presently existing methods. And when the filters parametersare given as follows:More detailed data will be listed in Table 1, which content the minimum with different upper bounds , and set .

Example 2 (see [10]). Then, we consider system (2) withand let , respectively, with different lower and upper bounds of time-delay. Thus, we could have the clear discovery that when , and , by processing of Theorem 5, we could acquire , which is much less than , respectively, in [10, 29]. The filters parameters are given in (44)Similarly, more specific data will be listed in Table 2, which content the minimum with different delay partitioning number and delay boundary.

6. Conclusions

By this we have completed the study for the delay-dependent filter design for discrete-time system with varying-delay. In the research process, by introducing the novel Wirtinger-based inequality to further handle the quadratic accumulative items coming from the modified Lyapunov-Krasovskii functionals and taking advantage of the delay-partitioning idea, a new BRL for the filtering system has been gained. Furthermore, the achieved result has lower conservativeness than presently existing methods, for instance, Jensen’s inequality and free-weighting matrix methods, etc. Eventually, a numerical example has been provided to verify the validness of our method.

Data Availability

The numerical simulation data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

Project is supported by the National Natural Science Foundation of China (Grant Nos. 61403278 and 61503280). Special thanks are given to the owners of documents that give reprint and referencing authority, which gives us great support in academic research.