# Synchronization of Chaotic Neural Networks with Leakage Delay and Mixed Time-Varying Delays via Sampled-Data Control

Authors: Ting Lei; Qiankun Song; Zhenjiang Zhao; Jianxi Yang
Journal: Abstract and Applied Analysis
 (2013)

---

## Abstract

This paper investigates the synchronization problem for neural networks with leakage delay and both discrete and distributed time-varying delays under sampled-data control. By employing the Lyapunov functional method and using the matrix inequality techniques, a delay-dependent LMIs criterion is given to ensure that the master systems and the slave systems are synchronous. An example with simulations is given to show the effectiveness of the proposed criterion.


---

## Body

## 1. Introduction

Since the pioneering works of Pecora and Carroll [1], the synchronization of chaotic systems has received considerable attention due to its potential applications in biology, chemistry, secret communication, cryptography, nonlinear oscillation synchronization, and some other nonlinear fields [2]. It has been shown that the neural networks can exhibit chaotic behavior [3]. Therefore, it has a wider significance to study the problem on the synchronization of chaotic neural networks.In the past decades, some works dealing with the synchronization of neural networks have also appeared; for example, see [4–22] and references therein. In [4], authors discussed the synchronization and computation in a chaotic neural network. In [7], the local synchronization and global exponential stability for an array of linearly coupled identical connected neural networks with delays were investigated without assuming that the coupling matrix is symmetric or irreducible; the linear matrix inequality approach was used to judge synchronization with global convergence property. In [8], authors presented an adaptive synchronization scheme between two different kinds of delayed chaotic neural networks with partly unknown parameters. An adaptive controller was designed to guarantee the global asymptotic synchronization of state trajectories for two different chaotic neural networks with time delay. In [9], the concept of μ-synchronization was introduced; some sufficient conditions were derived for the global μ-synchronization for the linearly coupled neural networks with delayed couplings, where the intrinsic systems are recurrently connected neural networks with unbounded time-varying delays, and the couplings include instant couplings and unbounded delayed couplings. In [10], authors proposed a general array model of coupled delayed neural networks with hybrid coupling, which is composed of constant coupling, discrete-delay coupling, and distributed-delay coupling. Based on the Lyapunov functional method and Kronecker product properties, several sufficient conditions were established to ensure global exponential synchronization based on the design of the coupling matrices, the inner linking matrices, and/or some free matrices representing the relationships between the system matrices. The conditions are expressed within the framework of linear matrix inequalities, which can be easily computed by the interior-point method. In addition, a typical chaotic cellular neural network was used as the node in the array to illustrate the effectiveness and advantages of the theoretical results. In [11], the globally robust synchronization problem was investigated for an array of coupled neural networks with uncertain parameters and time delays. Both the cases of linear coupling and nonlinear coupling were simultaneously taken into account. Several criteria for checking the robust exponential synchronization were given for the considered coupled neural networks. In [12], authors presented a new linear matrix inequality-based approach to an H∞ output feedback control problem of master-slave synchronization of artificial neural networks with uncertain time delay. In [13], the problem of feedback controller design to achieve synchronization for neural network of neutral type with stochastic perturbation was considered. Based on Lyapunov method and LMI framework, a criterion for master-slave synchronization was obtained. In [16], authors investigated the globally exponential synchronization for linearly coupled neural networks with time-varying delay and impulsive disturbances. Since the impulsive effects discussed were regarded as disturbances, the impulses should not happen too frequently. The concept of average impulsive interval was used to formalize this phenomenon. By referring to an impulsive delay differential inequality, a criterion for the globally exponential synchronization of linearly coupled neural networks with impulsive disturbances was given. In [18], the projective synchronization between two continuous-time delayed neural systems with time-varying delay was investigated. A sufficient condition for synchronization of the coupled systems with modulated delay was presented analytically with the help of the Krasovskii-Lyapunov approach. In [19], the problem of guaranteed cost control for exponential synchronization of cellular neural networks with interval nondifferentiable and distributed time-varying delays via hybrid feedback control was considered. Several delay-dependent sufficient conditions for the exponential synchronization were obtained. In [20], authors studied the synchronization in an array of coupled neural networks with Markovian jumping and random coupling strength. By designing a novel Lyapunov function and using inequality techniques and the properties of random variables, several delay-dependent synchronization criteria were derived for the coupled networks of continuous-time version. Discrete-time analogues of the continuous-time networks were also formulated and studied. In [21], authors considered adaptive synchronization of chaotic Cohen-Grossberg neural networks with mixed time delays. In [22], pth moment exponential synchronization for stochastic delayed Cohen-Grossberg neural networks with Markovian switching was investigated.On the other hand, with the development of networked control systems, sampled-data control in the presence of a constant input delay has been an important research area in recent years, because networked control systems are usually modeled as sampled-data systems under variable sampling with an additional network-induced delay [23]. There are some results dealing with the synchronization problem using sampled-data control; for example, see [23–38] and references therein. In [23], a new approach, the input delay approach, has been proposed that can deal well with the sampled-data control problems. The main idea of this approach is to convert the considered sampling period into a time-varying but bounded delay and then accomplish the sampled-data control or state estimation tasks by using the existing theory of time-delayed systems. In [24], the synchronization of chaotic system using a sampled-data fuzzy controller was studied. In [25–27], the synchronization for chaotic Lur’e systems using sampled-data control was investigated; several criteria were given to ensure that the master systems synchronize with the slave systems by using Lyapunov-Krasovskii functional and LMI approach. In [28–35], authors discussed the synchronization of chaotic system and complex networks by using sampled-data control. In [36–38], the synchronization of neural networks with time-varying delays was considered; by using sampled-data control method, several criteria for checking the synchronization were obtained. To the best of the authors knowledge, there is no results on the problem of the synchronization for neural networks with leakage delay and both discrete and distributed time-varying delays [38]. Therefore, there is a need to further extend the synchronization results reported in [38].Motivated by the previous discussions, the objective of this paper is to study the synchronization for neural networks with leakage delay and both discrete and distributed time-varying delays by using sampled-data control approach. The obtained sufficient conditions do not require the differentiability of time-varying delays and are expressed in terms of linear matrix inequalities, which can be checked numerically using the effective LMI toolbox in MATLAB. An example is given to show the effectiveness and less conservatism of the proposed criterion.Notations. The notations are quite standard. Throughout this paper, ℝn and ℝn×m denote, respectively, the n-dimensional Euclidean space and the set of all n×m real matrices. ∥·∥ refers to the Euclidean vector norm. AT represents the transpose of matrix A and the asterisk “*” in a matrix is used to represent the term which is induced by symmetry. I is the identity matrix with compatible dimension. X>Y means that X and Y are symmetric matrices and that X-Y is positive definite. Matrices, if not explicitly specified, are assumed to have compatible dimensions.


## 2. Model Description and Preliminaries

Consider the following neural networks with leakage delay and mixed time-varying delays:(1)x˙(t)=-Dx(t-δ)+Af(x(t))+Bf(x(t-τ(t)))+C∫t-σ(t)tf(x(s))ds+J(t),
for t≥0, where x(t)=(x1(t),x2(t),…,xn(t))T∈ℝn is the state vector of the network at time t, n corresponds to the number of neurons, D∈ℝn×n is a positive diagonal matrix, A∈ℝn×n, B∈ℝn×n, and C∈ℝn×n are the connection weight matrix, the discretely delayed connection weight matrix, and the distributively delayed connection weight matrix, respectively, f(x(t))=(f1(x1(t)),f2(x2(t)),…,fn(xn(t)))T∈ℝn denotes the neuron activation at time t, J(t)=(J1(t),J2(t),…,Jn(t))T∈ℝn is an external input vector, and δ, τ(t), and σ(t) denote the leakage delay, discrete time-varying delay and the distributed time-varying delay, respectively.In this paper, system (1) is regarded as the master system and a slave system for (1) can be described by the following equation:
(2)y˙(t)=-Dy(t-δ)+Af(y(t))+Bf(y(t-τ(t)))+C∫t-σ(t)tf(y(s))ds+u(t)+J(t),
where u(t)∈ℝn is the appropriate control input that will be designed in order to obtain a certain control objective.Throughout this paper, we make the following assumptions.(H1)
For anyj∈{1,2,…,n}, there exist constants Fj- and Fj+ such that
(3)Fj-≤fj(α1)-fj(α2)α1-α2≤Fj+,for allα1≠α2.(H2)
The leakage delayδ, the discrete time-varying delays τ(t), and the distributed time-varying delay σ(t) satisfy the following conditions:
(4)0≤δ,0≤τ(t)≤τ,0≤σ(t)≤σ,whereδ, τ, and σ are constants.By defining the error signal ase(t)=y(t)-x(t), the error system for (1) and (2) can be represented as follows:
(5)e˙(t)=-De(t-δ)+Ag(e(t))+Bg(e(t-τ(t)))+C∫t-σ(t)tg(e(s))ds+u(t),
where g(e(t))=f(y(t))-f(x(t)).In many real-world applications, it is difficult to guarantee that the state variables transmitted to controllers are continuous. In addition, in order to make full use of modern computer technique, the sampled-data feedback control is applied to synchronize delayed neural networks [36]. In this paper, the following sampled-data controller is adopted [38]:
(6)u(t)=Ke(tk),tk≤t<tk+1,
where K is sampled-data feedback controller gain matrix to be determined, tk denotes the sampling instant and satisfies 0=t0<t1<t2<⋯<tk<⋯, limk→+∞tk=+∞. Moreover, the sampling period under consideration is assumed to be bounded by a known constant h; that is,
(7)tk+1-tk≤h,
for any integer k≥0, where h is a positive scalar and represents the largest sampling interval.Substituting control law (6) into the error system (5) yields
(8)e˙(t)=-De(t-δ)+Ag(e(t))+Bg(e(t-τ(t)))+C∫t-σ(t)tg(e(s))ds+Ke(tk).Clearly, it is difficult to analyze the synchronization of neural networks based on error system (8) because of the discrete term e(tk). Therefore, the input delay approach [23] is applied; that is, a sawtooth function is defined as follows:
(9)γ(t)=t-tk,tk≤t<tk+1.
It can be found from (7) and (9) that 0≤γ(t)<h and γ˙(t)=1 for t≠tk.By substituting (9) into (8), we get that
(10)e˙(t)=-De(t-δ)+Ag(e(t))+Bg(e(t-τ(t)))+C∫t-σ(t)tg(e(s))ds+Ke(t-γ(t)).The main purpose of this paper is to design controller with the form (6) to ensure that master system (1) synchronizes with slave system (2). In other words, we are interested in finding a feedback gain matrix K such that error system (10) is stable.To prove our result, the following lemmas that can be found in [39] are necessary.Lemma 1 (see [39]).
For any constant matrixW∈ℝm×m, W>0, scalar 0<h(t)<h, and vector function ω(·):[0,h]→ℝm such that the integrations concerned are well defined; then
(11)(∫0h(t)ω(s)ds)TW(∫0h(t)ω(s)ds)≤h(t)∫0h(t)ωT(s)Wω(s)ds.Lemma 2 (see [39]).
Given constant matricesP, Q, and R, where PT=P, QT=Q, then
(12)[PRRT-Q]<0
is equivalent to the following conditions:
(13)Q>0,P+RQ-1RT<0.


## 3. Main Results

Theorem 3.
Suppose that (H1) and (H2) hold. If there exist seven symmetric positive definite matricesPi (i=1,2,3,4,5,6,7), four positive diagonal matrices W1, W2, R1, and R2, and nine matrices X11, X12, X22, Q1, Q2, Q3, Q4, Q5, and Z such that the following LMIs hold:
(14)X=[X11X12*X22]>0,(15)Ω=[Ω1Ω2*Ω3]<0,
where(16)Ω1=[Ω11Ω12Ω13X22Q30Ω170Ω19Q1BQ1C*Ω22-Q1DX1200Z0Ω29Q1BQ1C**-P1-X120000000***-P20000000****Ω55Q2000F4R20*****-P300000******Ω77Q2000*******-P5000********Ω9900*********-R20**********-P7],Ω2=[Q3Q50000000000000000Q200000000Q40000000000000000],Ω3=[-1τP40000-1hP60000-1τP40000-1hP6],
in whichΩ11=X12+X12T+P1+δ2P2+P3+P5-Q3-Q3T-Q5-Q5T-F3R1, Ω12=X11-F1W1+F2W2-Q1, Ω13=-X12-Q1D, Ω17=Z+Q5, Ω19=Q1A+F4R1, Ω22=τP4+hP6-Q1-Q1T, Ω29=W1-W2+Q1A, Ω55=-Q2-Q2T-F3R2, Ω77=-Q4-Q4T, and Ω99=σ2P7-R1, then master system (1) and slave system (2) are synchronous. Moreover, the desired controller gain matrix K in (6) can be given by
(17)K=Q1-1Z.Proof.
From assumption (H1), we know that(18)∫0ei(t)(gi(s)-Fi-s)ds≥0,∫0ei(t)(Fi+s-gi(s))ds≥0,i=1,2,…,n.
Let W1=diag(w11,w12,…,w1n) and W2=diag(w21,w22,…,w2n), and consider the following Lyapunov-Krasovskii functional:
(19)V(t)=V1(t)+V2(t)+V3(t)+V4(t)+V5(t)+V6(t),
where
(20)V1(t)=[e(t)∫t-δt‍e(s)ds]T[X11X12*X22][e(t)∫t-δt‍e(s)ds],V2(t)=2∑i=1n‍w1i∫0ei(t)(gi(s)-Fi-s)ds+2∑i=1n‍w2i∫0ei(t)(Fi+s-gi(s))ds,V3(t)=∫t-δteT(s)P1e(s)ds+δ∫-δ0∫t+ξteT(s)P2e(s)dsdξ,V4(t)=∫t-τteT(s)P3e(s)ds+∫-τ0∫t+ξte˙T(s)P4e˙(s)dsdξ,V5(t)=∫t-hteT(s)P5e(s)ds+∫-h0∫t+ξte˙T(s)P6e˙(s)dsdξ,V6(t)=σ∫-σ0∫t+ξtgT(e(s))P7g(e(s))dsdξ.
Calculating the time derivative of Vi(t) (i=1,2,3,4,5,6), we obtain
(21)V˙1(t)=2[e(t)∫t-δte(s)ds][X11X12*X22][e˙(t)e(t)-e(t-δ)]T=eT(t)(X12+X12T)e(t)+2eT(t)X11e˙(t)-2eT(t)X12e(t-δ)+2eT(t)X22∫t-δte(s)ds+2e˙T(t)X12∫t-δte(s)ds-2eT(t-δ)X22∫t-δte(s)ds,(22)V˙2(t)=2e˙T(t)W1(g(e(t))-F1e(t))+2e˙T(t)W2(F2e(t)-g(e(t)))=2eT(t)(-F1W1+F2W2)e˙(t)+2e˙T(t)(W1-W2)g(e(t)),(23)V˙3(t)=eT(t)(P1+δ2P2)e(t)-eT(t-δ)P1e(t-δ)-δ∫t-δteT(s)P2e(s)ds≤eT(t)(P1+δ2P2)e(t)-eT(t-δ)P1e(t-δ)-(∫t-δte(s)ds)TP2(∫t-δte(s)ds),(24)V˙4(t)=eT(t)P3e(t)-eT(t-τ)P3e(t-τ)+τe˙T(t)P4e˙(t)-∫t-τte˙T(s)P4e˙(s)ds,(25)V˙5(t)=eT(t)P5e(t)-eT(t-h)P5e(t-h)+he˙T(t)P6e˙(t)-∫t-hte˙T(s)P6e˙(s)ds.(26)V˙6(t)=σ2gT(e(t))P7g(e(t))-σ∫t-σtgT(e(s))P7g(e(s))ds≤σ2gT(e(t))P7g(e(t))-σ(t)∫t-σ(t)tgT(e(s))P7g(e(s))ds≤σ2gT(e(t))P7g(e(t))-(∫t-σ(t)tg(e(s))ds)TP7(∫t-σ(t)tg(e(s))ds).
In deriving inequalities (23) and (26), we have made use of Lemma 1. It follows from inequalities (21)–(26) that
(27)V˙(t)≤eT(t)(X12+X12T+P1+δ2P2+P3+P5)e(t)+2eT(t)(X11-F1W1+F2W2)e˙(t)-2eT(t)X12e(t-δ)+2eT(t)X22×∫t-δte(s)ds+e˙T(t)(τP4+hP6)e˙(t)+2e˙T(t)×X12∫t-δte(s)ds+2e˙T(t)(W1-W2)g(e(t))-eT(t-δ)P1e(t-δ)-2eT(t-δ)X22×∫t-δte(s)ds-eT(t-τ)P3e(t-τ)-(∫t-δte(s)ds)TP2(∫t-δte(s)ds)-eT(t-h)P5e(t-h)-∫t-τte˙T(s)P4e˙(s)ds-∫t-hte˙T(s)P6e˙(s)ds+σ2gT(e(t))P7g(e(t))-(∫t-σ(t)tg(e(s))ds)TP7(∫t-σ(t)tg(e(s))ds).
From model (10), we have
(28)0=2(eT(t)+e˙T(t))Q1×[∫t-σ(t)tg(e(s))ds-e˙(t)-De(t-δ)+Ag(e(t))+Bg(e(t-τ(t)))+C∫t-σ(t)tg(e(s))ds+Ke(t-γ(t))].
From Newton-Leibniz formulation and assumption (H2), we have
(29)0=-2eT(t-τ(t))×Q2(e(t-τ(t))-e(t-τ)-∫t-τt-τ(t)e˙(s)ds)≤-2eT(t-τ(t))Q2e(t-τ(t))+2eT(t-τ(t))Q2e(t-τ)+τeT(t-τ(t))×Q2P4-1Q2Te(t-τ(t))+∫t-τt-τ(t)e˙T(s)P4e˙(s)ds,0=-2eT(t)Q3(e(t)-e(t-τ(t))-∫t-τ(t)te˙(s)ds)≤-2eT(t)Q3e(t)+2eT(t)Q3e(t-τ(t))+τeT(t)Q3P4-1Q3Te(t)+∫t-τ(t)te˙T(s)P4e˙(s)ds,0=-2eT(t-γ(t))×Q4(e(t-γ(t))-e(t-h)-∫t-ht-γ(t)‍e˙(s)ds)≤-2eT(t-γ(t))Q4e(t-γ(t))+2eT(t-γ(t))Q2e(t-h)+heT(t-γ(t))Q4P6-1Q4Te(t-γ(t))+∫t-ht-γ(t)e˙T(s)P6e˙(s)ds,0=-2eT(t)Q5(e(t)-e(t-γ(t))-∫t-γ(t)te˙(s)ds)≤-2eT(t)Q5e(t)+2eT(t)Q5e(t-γ(t))+heT(t)Q5P6-1Q5Te(t)+∫t-γ(t)te˙T(s)P6e˙(s)ds.
In addition, for positive diagonal matrices R1>0 and R2>0, we can get from assumption (H1) that [40]
(30)[e(t)g(e(t))]T[F3R1-F4R1-F4R1R1][e(t)g(e(t))]≤0,(31)[e(t-τ(t))g(e(t-τ(t)))]T[F3R2-F4R2-F4R2R2]×[e(t-τ(t))g(e(t-τ(t)))]≤0.
It follows from (27)–(31) that
(32)V˙(t)≤eT(t)(2X12+P1+δ2P2+P3+P5-2Q3+τQ3P4-1Q3T-2Q5+hQ5P6-1Q5T-F3R1)e(t)+2eT(t)(X11-F1W1+F2W2-Q1)e˙(t)-2eT(t)(X12+Q1D)e(t-δ)+2eT(t)X22∫t-δte(s)ds+2eT(t)Q3e(t-τ(t))+2eT(t)(Q1K+Q5)e(t-γ(t))+2eT(t)(Q1A+F4R1)g(e(t))+2eT(t)Q1Bg(e(t-τ(t)))+2eT(t)Q1C∫t-σ(t)tg(e(s))ds+e˙T(t)(τP4+hP6-2Q1)e˙(t)-2e˙T(t)Q1De(t-δ)+2e˙T(t)X12×∫t-δte(s)ds+2e˙T(t)Q1Ke(t-γ(t))+2e˙T(t)(W1-W2+Q1A)g(e(t))+2e˙T(t)Q1Bg(e(t-τ(t)))+2e˙T(t)Q1C×∫t-σ(t)tg(e(s))ds-eT(t-δ)P1e(t-δ)-2eT(t-δ)X22∫t-δte(s)ds-(∫t-δte(s)ds)T×P2(∫t-δte(s)ds)+eT(t-τ(t))×(-2Q2+τQ2P4-1Q2T-F3R2)e(t-τ(t))+2eT(t-τ(t))Q2e(t-τ)+2eT(t-τ(t))×F4R2g(e(t-τ(t)))-eT(t-τ)P3e(t-τ)+eT(t-γ(t))(-2Q4+hQ4P6-1Q4T)e(t-γ(t))+2eT(t-γ(t))Q2e(t-h)-eT(t-h)P5e(t-h)+gT(e(t))(σ2P7-R1)g(e(t))-gT(e(t-τ(t)))R2g(e(t-τ(t)))-(∫t-σ(t)tg(e(s))ds)TP7(∫t-σ(t)tg(e(s))ds)=ξT(t)Πξ(t),
where ξ(t)=(eT(t),e˙T(t),eT(t-δ),∫t-δt‍eT(s)ds,eT(t-τ(t)),eT(t-τ),eT(t-γ(t)),eT(t-h), gT(e(t)),gT(e(t-τ(t))),∫t-σ(t)t‍gT(e(s))ds)T and (33)Π=[Π11Ω12Ω13X22Q30Ω170Ω19Q1BQ1C*Ω22-Q1DX1200Q1K0Ω29Q1BQ1C**-P1-X120000000***-P20000000****Π55Q2000F4R20*****-P300000******Π77Q2000*******-P5000********Ω9900*********-R20**********-P7],
withΠ11=X12+X12T+P1+δ2P2+P3+P5-Q3-Q3T+τQ3P4-1Q3T-Q5-Q5T+hQ5P6-1Q5T-F3R1, Π55=-Q2-Q2T+τQ2P4-1Q2T-F3R2, Π77=-Q4-Q4T+hQ4P6-1Q4T.
By using Lemma2 and noting K=Q1-1Z, it is easy to verify the equivalence of Π<0 and Ω<0. Thus, one can derive from (15) and (32) that
(34)V˙(t)≤0,
which implies that error-state system (10) is global and asymptotically stable; that is, master system (1) and slave system (2) are synchronous. The proof is completed.


## 4. Numerical Example

To verify the effectiveness of the theoretical result of this paper, consider the following example.Example 1.
Consider master system (1) and slave system (2) with the following parameters:(35)D=(1001),A=(1.80.1-4.32.9),B=(-1.6-0.1-0.2-2.7),C=(-0.30.10.1-0.2),f1(α)=f2(α)=tanh(α),J1(t)=J2(t)=0,δ=0.3,τ(t)=0.5|sint|,σ(t)=0.2|cos(2t)|.The chaotic behaviors of master system (1) and slave system (2) with u(t)=0 are given in Figure 1 and Figure 2, respectively, with the initial states chosen as x(s)=(-0.1,0.1)T, y(s)=(-0.5sin(23t),-0.6cos(5t))T, and s∈[-0.5,0].Figure 1
The chaotic behavior of master system (1).Figure 2
The chaotic behavior of slave system (2) with u(t)=0.It can be verified that assumptions (H1) and (H2) are satisfied, andF1=0, F2=I, F3=0, F4=diag{0.5,0.5}, τ=0.5, and σ=0.2.Further, the sampling period is taken ash=0.7; by using the MATLAB LMI Control Toolbox, a solution to the LMIs in (14)-(15) is found as follows:
(36)P1=10-8[0.5575-0.0458-0.04580.0813],P2=10-7[0.1589-0.0521-0.05210.1440],P3=10-8[0.7818-0.0275-0.02750.0804],P4=10-9[0.5382-0.0061-0.00610.0069],P5=10-8[0.1046-0.0257-0.02570.0731],P6=10-8[0.2393-0.0215-0.02150.0690],P7=10-7[0.3430-0.0452-0.04520.3334],Q1=10-9[0.3710-0.0167-0.00640.0142],Q2=10-9[0.9695-0.0121-0.01210.0465],Q3=10-8[0.1136-0.0020-0.00130.0066],Q4=10-7[0.4169-0.0372-0.04030.1167],Q5=10-7[0.2032-0.0197-0.01990.0622],Z=10-9[-0.37650.04560.0973-0.1631],W1=10-10[0.3365000.3390],W2=10-9[0.7363000.0811],R1=10-8[0.6542000.4249],R2=10-8[0.2055000.0173],X11=10-10[0.9837-0.2378-0.23780.5765],X12=10-9[-0.08130.03400.0424-0.1056],X22=10-8[0.2687-0.0933-0.09330.2625].
Subsequently, we can obtain from K=Q1-1Z that
(37)K=[-0.7228-0.39946.5033-11.6367].
According to Theorem 3, master system (1) and slave system (2) are synchronous under sampled-data controller (6). Figure 3 depicts the synchronization errors of state variables between master system (1) and slave system (2). The numerical simulations clearly verify the effectiveness of the developed sampled-data control approach in the synchronization of two chaotic neural networks with discrete and distributed time-varying delays as well as leakage delay.State trajectory ofe1(t) and e2(t) of error system (8).
(a)
(b)


## 5. Conclusions

In this paper, we have dealt with the synchronization problems for chaotic neural networks with leakage delay and both discrete and distributed time-varying delays. Based on the sampled-data control techniques, Lyapunov stability theory, and the matrix inequality techniques, a delay-dependent criterion sufficient condition has been developed to guarantee synchronization of the considered coupled neural networks. An example has been provided to demonstrate the effectiveness of the proposed criterion since the feasible solutions to the given LMIs criterion in this paper have been found.



---

*Source: 290574-2013-11-24.xml*