Next Article in Journal
Asymmetric Control Limits for Weighted-Variance Mean Control Chart with Different Scale Estimators under Weibull Distributed Process
Previous Article in Journal
An Enhanced Northern Goshawk Optimization Algorithm and Its Application in Practical Optimization Problems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Fixed/Predefined-Time Synchronization of Complex-Valued Stochastic BAM Neural Networks with Stabilizing and Destabilizing Impulse

College of Mathematics and System Sciences, Xinjiang University, Urumqi 830046, China
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(22), 4384; https://doi.org/10.3390/math10224384
Submission received: 5 October 2022 / Revised: 9 November 2022 / Accepted: 14 November 2022 / Published: 21 November 2022
(This article belongs to the Section Dynamical Systems)

Abstract

:
This article is mainly concerned with the fixed-time and predefined-time synchronization problem for a type of complex-valued BAM neural networks with stochastic perturbations and impulse effect. First, some previous fixed-time stability results on nonlinear impulsive systems in which stabilizing and destabilizing impulses were separately analyzed are extended to a general case in which the stabilizing and destabilizing impulses can be handled simultaneously. Additionally, using the same logic, a new predefined-time stability lemma for stochastic nonlinear systems with a general impulsive effect is obtained by using the inequality technique. Then, based on these novel results, two novel controllers are implemented to derive some simple fixed/predefined-time synchronization criteria for the considered complex-valued impulsive BAM neural networks with stochastic perturbations using the non-separation method. Finally, two numerical examples are given to demonstrate the feasibility of the obtained results.

1. Introduction

The BAM neural network was initially introduced in 1987 [1], and consists of two layers of neurons, each of which is linked to all the neurons in the other layer, while the neurons in the same layer do not have any connection to each other. Due to the powerful associative memory and information association ability of BAM neural network, it has been widely studied by scholars in recent years [2,3,4], who have applied them to many key areas, such as pattern recognition, secure communication, and automatic control engineering [5,6,7,8], etc. For example, Ref. [3] investigated decentralized event-triggered stability analysis of neutral-type BAM neural networks with Markovian jump parameters and mixed time varying delays. Ref. [5] investigated the fixed-time (FXT) synchronization of complex-valued memristive BAM neural networks with leakage delays and its application to image encryption and decryption problem. Ref. [6] concerned the asymptotic anti-synchronization issue of memristive BAM neural networks, and then applied their results to a network security communication study. In Ref. [7], the authors investigated the finite-time (FNT) projection synchronization problem of memristive BAM neural networks together with application to image encryption.
The recent decades witnessed the wide investigation of various types of synchronization issue of neural networks with or without stochastic fluctuations including asymptotic synchronization, exponential synchronization, general decay synchronization, FNT synchronization, FXT synchronization, and predefined-time (PDT) synchronization. Among them, FNT synchronization has attracted a great concern because it can achieve the synchronization aim in a FNT and has good robustness and anti-interference properties [9,10,11]. However, the settling time (ST, which can be seen as the minimum upper bound of system state to reach zero) of FNT synchronization is extensively relevant to the initial values of system, and thus it is unable to exert its superiority when the initial values of a system are unknown or can not be obtained, which undoubtedly limits the specific application of the FNT control techniques. In order to cope with this difficult issue, Polyakov [12] introduced FXT stability concept, in which its ST does not depend on the initial values of the system but only relevant on the system parameters and the controller gains. On this basis, a great number of scholars have studied FXT synchronization of various types of nonlinear systems [13,14,15,16,17].
It is worth noting that, however, the FXT synchronization also has some limitations, such as its ST still being dependent on the system parameters, and it can therefore not be specified in advance. However, in some special engineering applications, such as DC Microgrid [18], secure communication [19], etc., it is required that the system states achieve the synchronization aim within a pre-defined time. Thus, another type of synchronization, PDT synchronization, has been introduced and well studied in the past few years [17]. The one advantage of PDT synchronization is that its ST can be an arbitrary number and can be scheduled in advance.
In addition, with the continuous development of neural network theory, it has been found that real-valued neural networks have some limitations when solving many practical application problems, for example XOR [20], reaction-convection-diffusion systems [21,22], etc. Thus, as a extension of real-valued neural network, the complex-valued neural network has been adopted and investigated in depth since they have a more complex structure and richer properties, which can solve the above problems more easily and effectively. Currently, two methods have been introduced and used to analyze the dynamical behaviors of complex-valued neural network: one is the separation method, in which the real part and imaginary part of network are divided into two real-valued systems and then the dynamics of the these systems are studied separately [23,24,25]. The separation method is feasible, but there are some disadvantages, such as, after separation, the dimensionality of the system becomes two-fold and there is a need to design controllers for the real and imaginary parts of the system separately, which greatly increases the computational effort and control cost. The other is the non-separated approach, i.e., discussing the dynamical behavior of the original complex-valued neural network directly on the complex domain [17,26]. Compared to the separation method, the non-separation method is much simpler, less computationally intensive, and easier to implement. Based on this, this paper uses a non-separated approach to discuss the synchronization of the considered complex-valued BAM neural network.
In addition, it is worth noting that in neural network systems, synaptic transmission can be seen as a noisy process of random fluctuation from the release of neurotransmitters and other probabilistic causes [27]. That is, there might exist stochastic disturbances in neural network systems. Currently, there are many excellent studies on the synchronization of neural networks with stochastic perturbations [28,29,30,31,32,33,34,35,36]. Such as, in Refs. [35,36], the FXT/PDT synchronization for a class of fuzzy neural networks with stochastic perturbations and the PDT synchronization of time-delayed BAM neural networks with stochastic fluctuations are discussed, respectively. However, in some actual situations, such as in the opening and closing of the operation buttons, the change of frequency or sudden noise may cause an unexpected change in the system state, i.e., the impulse effect [33,37,38,39]. Therefore, investigating the synchronization of impulsive neural networks with stochastic fluctuations is of great theoretical significance. So far, however, there are few results on the FXT/PDT synchronization of complex-valued neural networks with both of these two effects. Especially, there are very seldom works on the PDT synchronization of these kinds of networks due to the lack of available PDT stability results for impulsive systems, not to mention the PDT stability of nonlinear systems with both impulsive effects and stochastic perturbations.
Inspired by the above analysis, in this paper, we focused on the FXT/PDT synchronization issue of a class of complex-valued BAM neural networks with both impulsive effects and stochastic perturbations. The main contributions of our paper are mainly reflected in the following four aspects. (1) Some new unified FXT/PDT stability results for nonlinear impulsive systems with stabilizing and destabilizing impulses are introduced via employing the inequality technique. (2) Some simple FXT/PDT synchronization criteria for complex-valued BAM neural networks with stochastic perturbations and general impulse effects are derived via designing novel controllers. (3) The ST estimation obtained in the current study is more accurate compared to some early published works [15,40,41]. (4) Unlike the traditional separation method [5,25], this paper uses a non-separation method to deal with the FXT/PDT synchronization of considered complex-valued BAM neural networks, which is more simple analytically and can effectively reduce the computational and control burden.
Notation 1.
In this article, the set of natural numbers is denoted by N, the set of all real numbers is denoted by R, R + stands to the set of non-negative numbers, R n is the set consisting of all n dimensional real vectors. C is the set of complex numbers. C n denotes the n dimensional complex vector-valued space. For any λ C , λ ¯ is the conjugate of λ. R e ( λ ) and I m ( λ ) represent separately the real and imaginary parts of λ. | λ | = λ λ ¯ . ( Ω , F , P ) denotes a complete filtered probability space, in which the filtration F = { F t ; t R + } satisfies the usual condition that F 0 contains all P-null sets in F . E ( . ) denotes the mathematical expectation corresponding to the probability measure P. The sign function of λ is [ λ ] = s i g n ( R e ( λ ) ) + i s i g n ( I m ( λ ) ) . · denotes the Euclidean norm, that is ψ = ( ψ 1 , ψ 2 , , ψ n ) T R n , ψ = i = 1 n | ψ i | 2 .

2. System Description and Preliminary Knowledge

Consider the following complex-valued BAM neural network with stochastic perturbations
d x i ( t ) = [ a i x i ( t ) + j = 1 m c i j h ¯ j y j ( t ) + I i ( t ) ] d t + ϱ i t , x i ( t ) d ω ( t ) , t t τ , d y j ( t ) = [ b j y j ( t ) + i = 1 n d j i g ¯ i x i ( t ) + J j ( t ) ] d t + ϱ ˜ j t , y j ( t ) d ω ( t ) , t t τ , Δ x i ( t τ + ) = x i ( t τ + ) x i ( t τ ) = ( ξ i 1 ) x i ( t τ ) , t = t τ , Δ y j ( t τ + ) = y j ( t τ + ) y j ( t τ ) = ( ξ j ˜ 1 ) y j ( t τ ) , t = t τ ,
where τ N , i I ˜ { 1 , , n } , j J ˜ { 1 , , m } , positive integers n and m denote the number of neurons from the neural domains X u and Y u , respectively. x i ( t ) C and y j ( t ) C stand for the state variables of the ith neuron of neural domain X u and the jth neuron of neural domain Y u , respectively. a i C and b j C represent the self-inhibition rate of the ith neuron in the neural domain X u and the jth neuron in the neural domain Y u , respectively. c i j C and d j i C are the synaptic connection weights. h ¯ j ( . ) C and g ¯ i ( . ) C denote the activation functions. I i ( t ) C and J j ( t ) C stand for the external inputs. ϱ i ( t ) : C × R n C and ϱ ˜ j ( t ) : C × R n C denote the noise intensity function. ω ( t ) C denotes a Brown motion given on the probability space ( Ω , F , P ) . ξ i and ξ j ˜ are positive constants. For all τ N , x i t τ + = lim t t τ + 0 x i ( t ) , x i ( t τ ) = lim t t τ 0 x i ( t ) = x i t τ , y j t τ + = lim t t τ + 0 y j ( t ) , y j t τ = lim t t τ 0 y j ( t ) = y j t τ denote the impulse jumps at the impulse moments t τ . The impulse sequence { t τ } τ N satisfies t 1 < t 2 < < t τ < and lim τ + t τ = + . The initial conditions of system (1) are x i 0 = x i 0 C and y j 0 = y j 0 C .
The response system of the above drive system is described as follows:
d x ˜ i ( t ) = [ a i x ˜ i ( t ) + j = 1 m c i j h ¯ j y ˜ j ( t ) + I i ( t ) + u i ( t ) ] d t + ϱ i t , x ˜ i ( t ) d ω ( t ) , t t τ , d y ˜ j ( t ) = [ b j y ˜ j ( t ) + i = 1 n d j i g ¯ i x ˜ i ( t ) + J j ( t ) + v j ( t ) ] d t + ϱ ˜ j t , y j ˜ ( t ) d ω ( t ) , t t τ , Δ x ˜ i ( t τ ) = x ˜ i ( t τ + ) x ˜ i ( t τ ) = ( ξ i 1 ) x ˜ i ( t τ ) , t = t τ , Δ y ˜ j ( t τ ) = y ˜ j ( t τ + ) y ˜ j ( t τ ) = ( ξ ˜ j 1 ) y ˜ j ( t τ ) , t = t τ ,
where x ˜ i ( t ) C and y ˜ i ( t ) C denote the state variables of the response system. u i ( t ) and v j ( t ) are the controllers that will be designed in the next section. The initial values of system (2) are x ˜ i ( 0 ) = x ˜ i 0 C and y ˜ i ( 0 ) = y ˜ i 0 C .
Let s i ( t ) = x ˜ i ( t ) x i ( t ) and r j ( t ) = y ˜ j ( t ) y j ( t ) , then the error systems of (1) and (2) can be described as
d s i ( t ) = [ a i s i ( t ) + j = 1 m c i j h j ( r j ( t ) ) + u i ( t ) ] d t + σ i ( t , s i ( t ) ) d ω ( t ) , t t τ , d r j ( t ) = [ b j r j ( t ) + i = 1 n d j i g i ( s i ( t ) ) + v j ( t ) ] d t + σ ˜ j ( t , r j ( t ) ) d ω ( t ) , t t τ , Δ s i ( t τ ) = s i ( t τ + ) s i ( t τ ) = ( ξ i 1 ) s i ( t τ ) , t = t τ , Δ r j ( t τ ) = r j ( t τ + ) r j ( t τ ) = ( ξ ˜ j 1 ) r j ( t τ ) , t = t τ ,
where σ i ( t , s i ( t ) ) = ϱ i ( t , x ˜ i ( t ) ) ϱ i ( t , x i ( t ) ) , σ ˜ j ( t , r j ( t ) ) = ϱ ˜ j ( t , y ˜ j ( t ) ) ϱ ˜ j ( t , y j ( t ) ) , h j ( r j ( t ) ) = h ¯ j ( y ˜ j ( t ) ) h ¯ j ( y j ( t ) ) and g i ( s i ( t ) ) = g ¯ i ( x ˜ i ( t ) ) g ¯ i ( x i ( t ) ) .
The following are our assumptions about complex-valued activation functions and stochastic noise intensity functions.
Assumption A1.
The complex-valued activation functions h ¯ j ( t ) and g ¯ i ( t ) satisfy the Lipschitz condition, that is for z 1 , z 2 C ( z 1 z 2 ), there are scalers L i g > 0 and L j h > 0 such that
| g ¯ i ( z 1 ) g ¯ i ( z 2 ) | L i g | z 1 z 2 | , | h ¯ j ( z 1 ) h ¯ j ( z 2 ) | L j h | z 1 z 2 | .
where i I ˜ and j J ˜ .
Assumption A2.
For any complex-valued constant z, there exist positive constants η i and η ˜ j > 0 such that σ i ( t ) and σ ˜ j ( t ) satisfy
1 2 σ i ( t , z ) σ i ( t , z ) ¯ η i | z | 2 , 1 2 σ ˜ j ( t , z ) σ ˜ j ( t , z ( t ) ) ¯ η ˜ j | z | 2 .
Definition 1
([42]). If there exists a positive integer τ 0 and a constant ν τ > 0 , such that
t 2 t 1 ν τ τ 0 Ξ κ t 1 , t 2 t 2 t 1 ν τ + τ 0 ,
where Ξ κ ( t 1 , t 2 ) is the number of impulses of impulse sequence κ = { t τ } N in time interval ( t 1 , t 2 ) , then the impulse sequence κ = { t τ } τ N is said to have an average impulse interval ν τ .
Consider the following complex-valued stochastic nonlinear system
d ψ ( t ) = f ( t , ψ ( t ) ) d t + σ ( t , ψ ( t ) ) d ω ( t ) , ψ ( 0 ) = ψ 0 , t t τ , Δ x | t = t τ = J k ( t τ , ψ ( t τ ) ) , t τ N ,
where ψ ( t ) = ( ψ 1 ( t ) , ψ 2 ( t ) , , ψ n ( t ) ) T C n is the state vector of the system. f ( · ) : R × C n C n and σ ( · ) : C × R n C n are the continuous function given in advance and satisfy f ( 0 ) = 0 , σ ( 0 ) = 0 . ω ( t ) C denotes the Brown motion. J k : R + × C n C n is a continuous function. For all τ N , Δ ψ ( t τ ) = ψ ( t τ + ) ψ ( t τ ) denotes the impulse jump at the impulse moment t τ , and ψ ( t τ + ) = lim t t τ + 0 ψ ( t ) , ψ ( t τ ) = lim t t τ 0 ψ ( t ) = ψ ( t τ ) . The impulsive sequence { t τ } τ N satisfies 0 t 0 < t 1 < < t τ < and lim τ + t τ = + .
Definition 2
([43]). Let C 1 , 2 ( R + × C n ; R + ) be the set of all non-negative functions V ( t , ψ , ψ ¯ ) on R + × C n its partial derivative for t is continuous and second-order partial derivatives for ψ and ψ ¯ exist, then for each V C 1 , 2 ( R + × C n ; R + ) , its operator £ V ( t , ψ , ψ ¯ ) is defined as
£ V ( t , ψ , ψ ¯ ) = V ( t , ψ , ψ ¯ ) t + V ( t , ψ , ψ ¯ ) ψ f ( t ) + V ( t , ψ , ψ ¯ ) ψ ¯ f ¯ ( t ) + 1 2 σ T ( t ) 2 V ( t , ψ , ψ ¯ ) ψ 2 σ ( t ) + σ T ( t ) 2 V ( t , ψ , ψ ¯ ) ψ ψ ¯ σ ¯ ( t ) + 1 2 σ ¯ T ( t ) 2 V ( t , ψ , ψ ¯ ) ψ ¯ 2 σ ¯ ( t ) .
Definition 3
([44]). The zero solution of system (4) is called to be FXT stable in probability, if solution ψ ( t , ψ 0 ) which corresponds to initial condition ψ 0 C n satisfies
(1) 
For any initial condition ψ 0 ( 0 ) C n , there exists a ST function T ( ψ 0 , κ ) = inf { t | ψ ( t , ψ 0 ) = 0 } such that P r o { T ( ψ 0 , κ ) < } = 1 .
(2) 
Stability in probability: for every pair of ε ( 0 , 1 ) and υ > 0 , there exists a δ = δ ( ε , υ ) > 0 such that P r o { | ψ ( t , ψ 0 ) | υ for all t 0 } 1 ε , whenever | ψ 0 | < δ .
(3) 
The mathematical expectation of T ( ψ 0 , κ ) is bounded by a constant T ε > 0 such that
E ( T ( ψ 0 , κ ) ) T ε , ψ 0 C n .
Definition 4
([35]). For any initial value ψ 0 C n , the given positive constants T c , if the zero solution of system (4) is FXT stable in probability, and satisfies T ( ψ 0 , κ ) T c for any T c > 0 , the zero solution of (4) is called to be PDT stable in probability.
Lemma 1
([26]). For any z 0 C , one has
z 0 + z 0 ¯ = 2 R e ( z 0 ) 2 | z 0 | , [ z 0 ] ¯ z 0 + [ z 0 ] z 0 ¯ 2 | z 0 | .
Lemma 2
([45]). Assume α 1 , α 2 , , α e 0 , 0 < δ 1 , ζ > 1 , then
ι = 1 e α ι δ ( ι = 1 e α ι ) δ , ι = 1 e α ι ζ n 1 ζ ( ι = 1 e α ι ) ζ .
Lemma 3
([40,41]). Suppose there exists a function V ( t , ψ ( t ) ) satisfying V ( t , 0 ) = 0 , such that the following two statements hold
(i) α 1 ψ ( t ) 2 V ( t , ψ ( t ) ) α 2 ψ ( t ) 2 , for any t R + ,
(ii)
£ V ( t , ψ ( t ) ) K V ( t , ψ ( t ) ) μ V δ ( t , ψ ( t ) ) λ V γ ( t , ψ ( t ) ) , t t τ , V t τ + , ψ t τ + ξ V t τ , ψ t τ , t = t τ ,
where K < min { μ , λ , ln ξ ν τ } , α 1 , α 2 , μ , ξ and λ are positive scalers, 0 < δ < 1 and γ > 1 are constants, then the origin for system (4) is FXT stable in probability, and the ST T 1 is estimated by
T 1 = 1 η 1 γ ln 1 η λ ϖ + 1 η 1 δ ln μ μ η π 2 ,
where η = K + ln ξ ν τ , ϖ = ξ τ 0 1 γ s i g n 1 ξ , π = ξ τ 0 1 δ s i g n 1 ξ .
Proof. 
By combining the similar analysis employed in Theorem 3.1 in Ref. [30] and Theorems 1 and 2 in Ref. [41], we can prove Lemma 3 by constructing an impulsive comparison system and using some inequality techniques. The detailed proof of Lemma 3 is omitted here to save space.  □
Remark 1.
In fact, in a recent study [41], the authors investigated the FXT stable issue of deterministic nonlinear system with impulsive effects by using the well-known comparison principle of impulsive differential inequality and some analysis methods. However, due to the limitation of the applied analysis method in Ref. [41], it discusses the impulses separately as stabilizing and destabilizing impulsives, which was done in Theorems 1 and 2 in Ref. [41]. In Lemma 3, however, we have combined the results of these two Theorems by introducing a novel term s i g n 1 ξ , which reduces the mathematical expression of ST. In addition, Lemma 3 consider the stochastic perturbations besides impulsive effects. From this aspect, the FXT stable result concluded by Lemma 3 is more general and has a better applicability.
Lemma 4.
If there exists Lyapunov function V ( t , ψ ( t ) ) such that:
(i) α 1 ψ ( t ) 2 V ( t , ψ ( t ) ) α 2 ψ ( t ) 2 , for any t R + , z R n .
(ii)
£ ( V ) ( t , ψ ( t ) ) T 0 T c ( K V ( t , ψ ( t ) ) μ V δ ( t , ψ ( t ) ) λ V γ ( t , ψ ( t ) ) ) , t t τ , V t τ + , ψ t τ + ξ V t τ , ψ t τ , t = t τ ,
where T 0 = 1 λ ( γ 1 ) ϖ + π 2 μ ( 1 δ ) , T c is an arbitrary number given in advance. α 1 > 0 , α 2 > 0 , K < min { μ , λ , T c T 0 ln ξ ν τ } , positive constants μ, ξ , λ , δ and γ are given in Lemma 3, then the zero solution of the system (4) is PDT stable in probability.
Proof. 
It follows from Lemma 3 that the zero solution of the system (4) under conditions (i) and (ii) are FXT stable in probability and its ST satisfies
T 2 = 1 η ( 1 γ ) ln 1 η T 0 T c λ ϖ + 1 η ( 1 δ ) ln T 0 T c μ T 0 T c μ η π 2 ,
where η = T 0 T c K + ln ξ ν τ . According to the inequality 1 1 x < ln x < x 1 ( x > 0 ) , we have
T 2 1 η ( 1 γ ) η T 0 T c λ ϖ + 1 η ( 1 δ ) 1 T 0 T c μ η π 2 T 0 T c μ T c T 0 λ ( γ 1 ) ϖ + π 2 T c T 0 μ ( 1 δ ) = T c T 0 1 λ ( γ 1 ) ϖ + π 2 μ ( 1 δ ) = T c .
The proof is achieved.  □
Remark 2.
In some circumstance where the initial conditions of the system are not accessible, the PDT synchronization has better application prospects than FXT synchronization due to its ST being independent of the initial values and system parameters. Presently, some novel results have been introduced on PDT synchronization of nonlinear systems without the impulsive effect [19,46]. However, research results on PDT synchronization of nonlinear systems with impulses are still very few due to the inconvenience caused by impulsive gains, in particularly, there are almost no studies on PDT synchronization of nonlinear systems with both impulses and stochastic perturbations. Here, we derived the PDT stability criteria for these kinds of systems by applying the novel inequality technique.

3. Main Results

3.1. Fixed Time Synchronization

In this subsection, the FXT stable given in Lemma 4 will be applied to discuss FXT synchronization of complex-valued impulsive BAM neural networks with stochastic perturbations. To make the systems (1) and (2) achieve FXT synchronization, we only need to prove that the error system (3) is stable in FXT. To do this, the following control protocol is developed
u i ( t ) = χ i [ s i ( t ) ] | s i ( t ) | θ ζ i [ s i ( t ) ] | s i ( t ) | ϑ , v j ( t ) = ρ j [ r j ( t ) ] | r j ( t ) | θ γ j [ r j ( t ) ] | r j ( t ) | ϑ ,
where i I ˜ , j J ˜ , χ i , ζ i , ρ j , γ j are positive real numbers, 0 < θ < 1 and ϑ > 1 . Before giving the main theorem, for convenience, we also denote
p i = η i R e ( a i ) + 1 2 j = 1 m | c i j | L j h + 1 2 j = 1 m | d j i | L i g , q j = η ˜ j R e ( b j ) + 1 2 i = 1 n | d j i | L i g + 1 2 i = 1 n | c i j | L j h , α = 2 θ + 1 2 min { min i I ˜ { χ i } , min j J ˜ { ρ j } } , β = 2 min { n 1 ϑ 2 min i I ˜ { ζ i } , m 1 ϑ 2 min j J ˜ { γ j } } , ξ = max { max i I ˜ { ξ i 2 } , max j J ˜ { ξ ˜ j 2 } } , k = max i I ˜ , j J ˜ { 2 p i , 2 q j } .
Theorem 1.
Based on Assumptions 1 and 2, if the inequality k < min α , β , ln ξ ν τ is satisfied, then the systems (1) and (2) with control scheme (7) are FXT synchronized in probability, and the ST is estimated by
T 3 = 2 η 1 ϑ ln 1 η β ϖ ˘ + 2 η ( 1 θ ) ln α α η π ˘ 2 ,
where η = k + ln ξ ν τ , ϖ ˘ = ξ τ 0 ( 1 ϑ + 1 2 ) s i g n ( 1 ξ ) and π ˇ = ξ τ 0 ( 1 θ + 1 2 ) s i g n ( 1 ξ ) .
Proof. 
Constructing the Lyapunov function as
V ( t ) = V 1 ( t ) + V 2 ( t ) ,
where
V 1 ( t ) = 1 2 i = 1 n s i ( t ) ¯ s i ( t ) , V 2 ( t ) = 1 2 j = 1 m r j ( t ) ¯ r j ( t ) .
Calculating the £ V 1 ( t ) along the trajectory of the system (3), yields
£ V 1 ( t ) = 1 2 i = 1 n s i ( t ) ¯ { a i s i ( t ) + j = 1 m c i j h j r j ( t ) χ i [ s i ( t ) ] | s i ( t ) | θ ζ i [ s i ( t ) ] | s i ( t ) | ϑ } + 1 2 i = 1 n s i ( t ) { a i s i ( t ) ¯ + j = 1 m c i j h j r j ( t ) ¯ χ i [ s i ( t ) ] | s i ( t ) | θ ¯ ζ i [ s i ( t ) ] | s i ( t ) | ϑ ¯ } + 1 2 i = 1 n σ i ( t , s i ( t ) ) σ i ( t , s i ( t ) ) ¯
= i = 1 n R e ( a i ) s i ( t ) s i ( t ) ¯ + 1 2 i = 1 n j = 1 m s i ( t ) ¯ c i j h j r j ( t ) + s i ( t ) c i j h j ( r j ( t ) ) ¯ 1 2 i = 1 n χ i s i ( t ) ¯ [ s i ( t ) ] + s i ( t ) [ s i ( t ) ] ¯ | s i ( t ) | θ 1 2 i = 1 n ζ i s i ( t ) ¯ [ s i ( t ) ] + s i ( t ) [ s i ( t ) ] ¯ | s i ( t ) | ϑ + 1 2 i = 1 n σ i ( t , s i ( t ) ) σ i ( t , s i ( t ) ) ¯ .
From Lemma 1 and Assumption 1, we can get
1 2 i = 1 n j = 1 m s i ( t ) ¯ c i j h j ( r j ( t ) ) + s i ( t ) c i j h j ( r j ( t ) ) ¯ i = 1 n j = 1 m | s i ( t ) ¯ c i j h j ( r j ( t ) ) | i = 1 n j = 1 m ( | c i j | L j h | r j ( t ) | | s i ( t ) | ) 1 2 i = 1 n j = 1 m | c i j | L j h ( | r j ( t ) | 2 + | s i ( t ) | 2 ) .
In view of Assumption 2, we have
1 2 i = 1 n σ i ( t , s i ( t ) ) σ i ( t , s i ( t ) ) ¯ i = 1 n η i | s i ( t ) | 2 .
According to Lemma 2, one has
1 2 i = 1 n χ i s i ( t ) ¯ [ s i ( t ) ] + s i ( t ) [ s i ( t ) ] ¯ | s i ( t ) | θ i = 1 n χ i | s i ( t ) | θ + 1 ,
1 2 i = 1 n ζ i s i ( t ) ¯ [ s i ( t ) ] + s i ( t ) [ s i ( t ) ] ¯ | s i ( t ) | ϑ i = 1 n ζ i | s i ( t ) | ϑ + 1 .
By combining above inequalities, we obtain
£ V 1 ( t ) i = 1 n ( R e ( a i ) ) | s i ( t ) | 2 + 1 2 i = 1 n j = 1 m | c i j | L j h | r j ( t ) | 2 + | s i ( t ) | 2 i = 1 n χ i | s i ( t ) | θ + 1 i = 1 n ζ i | s i ( t ) | ϑ + 1 + i = 1 n η i | s i ( t ) | 2 = i = 1 n R e a i + 1 2 j = 1 m | c i j | L j h + η i | s i ( t ) | 2 + 1 2 i = 1 n j = 1 m | c i j | L j h | r j ( t ) | 2 i = 1 n χ i | s i ( t ) | θ + 1 i = 1 n ζ i | s i ( t ) | θ + 1 .
Similarly, for V 2 ( t ) it is not difficult to get
£ V 2 ( t ) j = 1 m R e ( b j ) + 1 2 i = 1 n | d j i | L i g + η ˜ j | r j ( t ) | 2 + 1 2 j = 1 m i = 1 n | d j i | L i g | s i ( t ) | 2 j = 1 m ρ j | r j ( t ) | θ + 1 j = 1 m γ j | r j ( t ) | ϑ + 1 .
Therefore, finally we have
£ V ( t ) = £ V 1 ( t ) + £ V 2 ( t ) i = 1 n η i R e ( a i ) + 1 2 j = 1 m | c i j | L j h + 1 2 j = 1 m | d j i | L i g | s i ( t ) | 2 + j = 1 m η j ˜ R e ( b j ) + 1 2 i = 1 n | d j i | L i g + 1 2 i = 1 n | c i j | L j h | r j ( t ) | 2 i = 1 n χ i | s i ( t ) | θ + 1 j = 1 m ρ j | r j ( t ) | θ + 1 i = 1 n ζ i | s i ( t ) | ϑ + 1 j = 1 m γ j | r j ( t ) | ϑ + 1 i = 1 n p i | s i ( t ) | 2 + j = 1 m q j | r j ( t ) | 2 min i I ˜ { χ i } i = 1 n | s i ( t ) | θ + 1 min j J ˜ { ρ j } j = 1 m | r j ( t ) | θ + 1 min i I ˜ { ζ i } i = 1 n | s i ( t ) | ϑ + 1 min j J ˜ { γ j } j = 1 m | r j ( t ) | ϑ + 1 max i I ˜ { 2 p i } 1 2 i = 1 n | s i ( t ) | 2 + max j J ˜ { 2 q j } 1 2 j = 1 m | r j ( t ) | 2 min i I ˜ { χ i } i = 1 n | s i ( t ) | 2 θ + 1 2 min 1 j m { ρ j } j = 1 m | r j ( t ) | 2 θ + 1 2 min i I ˜ { ζ i } n 1 ϑ 2 i = 1 n | s i ( t ) | 2 ϑ + 1 2 min 1 j m { γ j } m 1 ϑ 2 j = 1 m | r j ( t ) | 2 ϑ + 1 2 k ( V 1 ( t ) + V 2 ( t ) ) α ( V 1 ( t ) ) θ + 1 2 + ( V 2 ( t ) ) θ + 1 2 2 ϑ 1 2 β ( V 1 ( t ) ) ϑ + 1 2 + ( V 2 ( t ) ) ϑ + 1 2 k V ( t ) α ( V 1 ( t ) + V 2 ( t ) ) θ + 1 2 β ( V 1 ( t ) + V 2 ( t ) ) ϑ + 1 2 = k V ( t ) α V ( t ) θ + 1 2 β V ( t ) ϑ + 1 2 .
When t = t τ ,
V t τ + = V 1 t τ + + V 2 t τ + = 1 2 i = 1 n s i t τ + ¯ s i t τ + + 1 2 j = 1 m r j t τ + ¯ r j t τ + 1 2 max i I ˜ { ξ i 2 } i = 1 n s i ( t τ ) ¯ s i t τ + 1 2 max 1 j m { ξ j ˜ 2 } j = 1 m r j ( t τ ) ¯ r j ( t τ ) max { max i I ˜ { ξ i 2 } , max 1 j m { ξ j ˜ 2 } } 1 2 i = 1 n s i ( t ) ¯ s i ( t ) + 1 2 j = 1 m r j ( t ) ¯ r j ( t ) = ξ V ( t τ ) .
Thus, in view of Equations (15) and (16), we obtain from Lemma 3 that the error system (3) can achieve FXT stable in probability with ST T 3 , so that systems (1) and (2) achieve FXT synchronization in probability, and its ST obtained as
T 3 = 2 η ( 1 ϑ ) ln ( 1 η β ϖ ˘ ) + 2 η ( 1 θ ) ln ( α α η π ˘ 2 ) .
The proof is finished.  □
In Theorem 1 we consider the FXT synchronization of complex-valued BAM neural networks with both impulsive and stochastic effects. Since there is no stochastic perturbations in original drive-response systems, they become
d x i ( t ) = [ a i x i ( t ) + j = 1 m c i j h j y j ( t ) + I i ( t ) ] d t , t t τ , d y j ( t ) = [ b j y j ( t ) + i = 1 n d j i g i x i ( t ) + J j ( t ) ] d t , t t τ , Δ x i ( t τ + ) = x i ( t τ + ) x i ( t τ ) = ( ξ i 1 ) x i ( t τ ) , t = t τ , Δ y j ( t τ + ) = y j ( t τ + ) y j ( t τ ) = ( ξ j ˜ 1 ) y j ( t τ ) , t = t τ ,
d x ˜ i ( t ) = [ a i x ˜ i ( t ) + j = 1 m c i j h j y j ˜ ( t ) + I i ( t ) + u i ( t ) ] d t , t t τ d y j ˜ ( t ) = [ b j y j ˜ ( t ) + i = 1 n d j i g i x ˜ i ( t ) + J j ( t ) + v j ( t ) ] d t , t t τ Δ x ˜ i ( t τ + ) = x ˜ i ( t τ + ) x ˜ i ( t τ ) = ( ξ i 1 ) x ˜ i ( t τ ) , t = t τ , Δ y j ˜ ( t τ + ) = y j ˜ ( t τ + ) y j ˜ ( t τ ) = ( ξ j ˜ 1 ) y j ˜ ( t τ ) , t = t τ .
At this time, by denoting
p ˜ i = R e ( a i ) + 1 2 j = 1 m | c i j | L j h + 1 2 j = 1 m | d j i | L i g , i I ˜ , q ˜ j = R e ( b j ) + 1 2 i = 1 n | d j i | L i g + 1 2 i = 1 n | c i j | L j h , j J ˜ ,
then we have a following result from the Theorem 1.
Corollary 1.
Suppose that Assumption 1 and the inequality k ˜ max i I ˜ , j J ˜ { 2 p ˜ i , 2 q ˜ j } < { α , β , ln ξ ν τ } is satisfied, then, under the controller (7), the system (17) and (18) will achieve FXT stabilization with a ST
T 4 = 2 η ˜ ( 1 ϑ ) ln ( 1 η ˜ β ϖ ˘ ) + 2 η ˜ ( 1 θ ) ln ( α α η ˜ π ˘ 2 ) ,
where η ˜ = k ˜ + ln ξ ν τ , ϖ ˘ and π ˇ are defined above.
Further, if there is no impulsive effect in systems (1) and (2), then they will degenerate to the following form
d x i ( t ) = [ a i x i ( t ) + j = 1 m c i j h j y j ( t ) + I i ( t ) ] d t + ϱ i t , x i ( t ) d ω ( t ) , t t τ , d y j ( t ) = [ b j y j ( t ) + i = 1 n d j i g i x i ( t ) + J j ( t ) ] d t + ϱ ˜ j t , y j ( t ) d ω ( t ) , t t τ ,
d x ˜ i ( t ) = [ a i x ˜ i ( t ) + j = 1 m c i j h j y j ˜ ( t ) + I i ( t ) + u i ( t ) ] d t + σ i t , x ˜ i ( t ) d ω ( t ) , t t τ , d y j ˜ ( t ) = [ b j y j ˜ ( t ) + i = 1 n d j i g i x ˜ i ( t ) + J j ( t ) + v j ( t ) ] d t + σ j ˜ t , y j ˜ ( t ) d ω ( t ) , t t τ .
In this case, for FXT synchronization of (19) and (20), we have a following result from the Theorem 1 and Lemma 2 of Ref. [9].
Corollary 2.
Under the Assumptions 1 and 2, if the parameter k in Theorem 1 is satisfied k < min { α , β } , then the systems (19) and (20) will FXT synchronized in probability with ST E [ T ( s 0 , r 0 ) ] < T 5 , where E [ T ( s 0 , r 0 ) ] < T 5 given as
T 5 T 5 1 = 2 k ϵ ( 1 ν ) ln 1 k α α β ϵ , k < 0 , T 5 2 = 2 π ( ν θ ) α α β ϵ c s c ( ϵ π ) , k = 0 , T 5 3 = 2 π c s c ( ϵ π ) β ( ν θ ) β α k 1 ϵ I β ς , ϵ , 1 ϵ + π c s c ( ϵ π ) α ( ν θ ) α β k ϵ I α ς , 1 ϵ , ϵ , 0 < k < min { β , α } ,
where ϵ = ( 1 θ ) ( ν θ ) , ς = β + α k . Particularly, if ν + θ = 2 , ST is estimated more precisely as E [ T ( s 0 , r 0 ) ] < T 6 , where
T 6 T 6 1 = 1 ν 1 2 Λ π 2 + arctan k Λ , 2 α β < k < 2 α β T 6 2 = 2 k ( ν 1 ) , k = 2 α β , T 6 3 = 1 ( ν 1 ) Λ ln k + Λ k Λ , k < 2 α β ,
where Λ = 4 α β k 2 .
Remark 3.
During the synchronization analysis of complex-valued NNs, there are some works that divided the original complex-valued networks into real and imaginary networks and then investigated their synchronization performance separately [19,21,24,47]. Undoubtedly, this will double the dimension of the system and increase the control burden. In this article, we investigated the FXT synchronization of the considered stochastic complex-valued stochastic NNs with general impulses using the non-separation method. Compared to the separation method used in Refs. [19,21,24,47], it makes the theocratical analysis much easier and helps to simplify the control process.

3.2. Predefined Time Synchronization

In this subsection, we will investigate the PDT synchronization of drive-response networks (1) and (2) by designing a new controller given as follows
u i ( t ) = T 0 T c χ i [ s i ( t ) ] | s i ( t ) | θ + ζ i [ s i ( t ) ] | s i ( t ) | ϑ , v j ( t ) = T 0 T c ρ j [ r j ( t ) ] | r j ( t ) | θ + γ j [ r j ( t ) ] | r j ( t ) | ϑ ,
where j J ˜ , i I ˜ , T c is PDT given in advance, T 0 = 2 β ( ϑ 1 ) ϖ 0 + 2 π 0 2 α ( 1 θ ) , ϖ 0 = ξ 0.5 τ 0 1 ϑ s i g n 1 ξ , π 0 = ξ 0.5 τ 0 1 θ s i g n 1 ξ . χ i , ζ i , ρ j , γ j are positive scalars, 0 < θ < 1 and ϑ > 1 .
Theorem 2.
Under the Assumptions 1 and 2, if the inequality k < min α , β , T c T 0 ln ξ ν τ is satisfied, then systems (1) and (2) are PDT synchronized in probability via controller (21).
Proof. 
Define the Lyapunov function as
V ( t ) = V 1 ( t ) + V 2 ( t ) ,
where
V 1 ( t ) = 1 2 i = 1 n s i ( t ) ¯ s i ( t ) , V 2 ( t ) = 1 2 j = 1 m r j ( t ) ¯ r j ( t ) .
Calculating £ V 1 ( t ) for V 1 ( t ) along the trajectory of the system (3), we get
£ V 1 ( t ) = 1 2 i = 1 n s i ( t ) ¯ a i s i ( t ) + j = 1 m c i j h j ( r j ( t ) ) T 0 T c χ i [ s i ( t ) ] | s i ( t ) | θ T 0 T c ζ i [ s i ( t ) ] | s i ( t ) | ϑ + 1 2 i = 1 n s i ( t ) a i s i ( t ) ¯ + j = 1 m c i j h j ( r j ( t ) ) ¯ T 0 T c χ i [ s i ( t ) ] | s i ( t ) | θ ¯ T 0 T c ζ i [ s i ( t ) ] | s i ( t ) | ϑ ¯ + 1 2 i = 1 n σ i ( t , s i ( t ) ) σ i ( t , s i ( t ) ) ¯ = i = 1 n R e a i s i ( t ) s i ( t ) ¯ + 1 2 i = 1 n j = 1 m s i ( t ) ¯ c i j h j r j ( t ) + s i ( t ) c i j h j r j ( t ) ¯ 1 2 T 0 T c i = 1 n χ i s i ( t ) ¯ [ s i ( t ) ] + s i ( t ) [ s i ( t ) ] ¯ | s i ( t ) | θ 1 2 T 0 T c i = 1 n ζ i s i ( t ) ¯ [ s i ( t ) ] + s i ( t ) [ s i ( t ) ] ¯ | s i ( t ) | ϑ + 1 2 i = 1 n σ i ( t , s i ( t ) ) σ i ( t , s i ( t ) ) ¯ .
In view of Lemma 1 and Assumption 1, we obtain
1 2 i = 1 n j = 1 m s i ( t ) ¯ c i j h j ( r j ( t ) ) + s i ( t ) c i j h j ( r j ( t ) ) ¯ i = 1 n j = 1 m | s i ( t ) ¯ c i j h j ( r j ( t ) ) | i = 1 n j = 1 m ( | c i j | L j h | r j ( t ) | | s i ( t ) | ) 1 2 i = 1 n j = 1 m | c i j | L j h ( | r j ( t ) | 2 + | s i ( t ) | 2 ) .
In addition by Assumption 2, we have
1 2 i = 1 n σ i T ( t , s i ( t ) ) σ i ( t , s i ( t ) ) ¯ i = 1 n η i | s i ( t ) | 2 .
According to Lemma 2, one has
1 2 T 0 T c i = 1 n χ i s i ( t ) ¯ [ s i ( t ) ] + s i ( t ) [ s i ( t ) ] ¯ | s i ( t ) | θ T 0 T c i = 1 n χ i | s i ( t ) | θ + 1 ,
1 2 T 0 T c i = 1 n ζ i s i ( t ) ¯ [ s i ( t ) ] + s i ( t ) [ s i ( t ) ] ¯ | s i ( t ) | ϑ T 0 T c i = 1 n ζ i | s i ( t ) | ϑ + 1 .
By introducing Equations (25)–(28) into (24), we get
£ V 1 ( t ) i = 1 n ( R e ( a i ) ) | s i ( t ) | 2 + 1 2 i = 1 n j = 1 m | c i j | L j h | r j ( t ) | 2 + | s i ( t ) | 2 i = 1 n T 0 T c χ i | s i ( t ) | θ + 1 i = 1 n T 0 T c ζ i | s i ( t ) | ϑ + 1 + i = 1 n η i | s i ( t ) | 2
= i = 1 n R e a i + 1 2 j = 1 m | c i j | L j h + η i | s i ( t ) | 2 + 1 2 i = 1 n j = 1 m | c i j | L j h | r j ( t ) | 2 i = 1 n T 0 T c χ i | s i ( t ) | θ + 1 i = 1 n T 0 T c ζ i | s i ( t ) | θ + 1 .
Similarly, for V 2 ( t ) , it is not difficult to get
£ V 2 ( t ) j = 1 m R e ( b j ) + 1 2 i = 1 n | d j i | L i g + η ˜ j | r j ( t ) | 2 + 1 2 j = 1 m i = 1 n | d j i | L i g | s i ( t ) | 2 j = 1 m ρ j T 0 T c | r j ( t ) | θ + 1 j = 1 m γ j T 0 T c | r j ( t ) | ϑ + 1 .
Therefore, we have
£ V ( t ) = £ V 1 ( t ) + £ V 2 ( t ) i = 1 n η i R e ( a i ) + 1 2 j = 1 m | c i j | L j h + 1 2 j = 1 m | d j i | L i g | s i ( t ) | 2 + j = 1 m η j ˜ R e ( b j ) + 1 2 i = 1 n | d j i | L i g + 1 2 i = 1 n | c i j | L j h | r j ( t ) | 2 j = 1 m ρ j T 0 T c | r j ( t ) | θ + 1 i = 1 n χ i T 0 T c | s i ( t ) | θ + 1 j = 1 m γ j T 0 T c | r j ( t ) | ϑ + 1 i = 1 n ζ i T 0 T c | s i ( t ) | ϑ + 1 i = 1 n p i | s i ( t ) | 2 + j = 1 m q j | r j ( t ) | 2 min { T 0 T c χ i } i = 1 n | s i ( t ) | θ + 1 min { T 0 T c ζ i } i = 1 n | s i ( t ) | ϑ + 1 min { T 0 T c ρ j } j = 1 m | r j ( t ) | θ + 1 min { T 0 T c γ j } j = 1 m | r j ( t ) | ϑ + 1 max i I ˜ { 2 p i } 1 2 i = 1 n | s i ( t ) | 2 + max j J ˜ { 2 q j } 1 2 j = 1 m | r j ( t ) | 2 min { T 0 T c χ i } i = 1 n | s i ( t ) | 2 θ + 1 2 min { T 0 T c ζ i } n 1 ϑ 2 i = 1 n | s i ( t ) | 2 ϑ + 1 2 min { T 0 T c ρ j } j = 1 m | r j ( t ) | 2 θ + 1 2 min { T 0 T c γ j } m 1 ϑ 2 j = 1 m | r j ( t ) | 2 ϑ + 1 2 k ( V 1 ( t ) + V 2 ( t ) ) α T 0 T c ( V 1 ( t ) ) θ + 1 2 ( V 2 ( t ) ) θ + 1 2 2 ϑ 1 2 β T 0 T c ( V 1 ( t ) ) ϑ + 1 2 + ( V 2 ( t ) ) ϑ + 1 2 k V ( t ) α T 0 T c ( V 1 ( t ) + V 2 ( t ) ) θ + 1 2 β T 0 T c ( V 1 ( t ) + V 2 ( t ) ) ϑ + 1 2 T 0 T c k V ( t ) α V ( t ) θ + 1 2 β V ( t ) ϑ + 1 2 .
When t = t τ
V t τ + = V 1 t τ + + V 2 t τ + = 1 2 i = 1 n s i t τ + ¯ s i t τ + + 1 2 j = 1 m r j t τ + ¯ r j t τ + = 1 2 max i I ˜ { ξ i 2 } i = 1 n s i ( t τ ) ¯ s i t τ + 1 2 max 1 j m { ξ j ˜ 2 } j = 1 m r j ( t τ ) ¯ r j ( t τ ) max { max i I ˜ { ξ i 2 } , max 1 j m { ξ j ˜ 2 } } 1 2 i = 1 n S ¯ i s i + 1 2 j = 1 m r j ¯ r j = ξ V ( t τ ) .
Therefore, from Lemma 4, we conclude that the error system (3) will be PDT stable in probability, so the systems (1) and (2) can be PDT synchronized in probability.
Similar to Corollaries 1 and 2, when there is no impulsive effects or stochastic perturbations in systems (1) and (2), we have following results from Theorem 2 and Lemma 3 of Ref. [9].  □
Corollary 3.
Under the Assumption 1, if the inequality k ˜ < { α , β , T c T 0 ln ξ ν τ } is satisfied, then the systems (17) and (18) can be PDT synchronized in probability via controller (21), where parameter k ˜ is given in Corollary 1.
Corollary 4.
Suppose that Assumptions 1 and 2 hold true. If the parameter of Theorem 2 satisfied the inequality k < min α , β , T c T 0 ln ξ ν τ , where T 0 was chosen as T 0 = T 5 when θ + ϑ = 2 and T 0 = T 6 when θ + ϑ 2 , then the system (19) and (20) can be PDT synchronized in probability via controller (21).
Remark 4.
Currently there are many works on the PDT synchronization of various types of chaotic systems with or without stochastic perturbations such as [19,26,35]. However, due to the lack of available PDT stability results for nonlinear impulsive systems, there are few works on the PDT synchronization of chaotic nonlinear systems with impulsive effects, not to mention those with both impulsive effects and stochastic perturbations. In this paper, for the first time, we have considered the PDT synchronization of complex-valued stochastic BAM neural networks with a general type of impulsive effects, where the impulsive gains can be stabilizing or destabilizing. Since, compared to FXT synchronization, the ST of in PDT synchronization can be given in advance on the basis of application requirement and it has nothing to do with the initial vales and intrinsic system parameters, the PDT synchronization studied in Section 3.2 has a broader application background.

4. Numerical Examples and Simulations

Now we verify the FXT and PDT synchronization criteria obtained in the above section by giving two relevant numerical examples.
Example 1.
For n = m = 2 , consider the following complex-valued impulse BAM neural network with stochastic perturbations:
d x i ( t ) = [ a i x i ( t ) + j = 1 2 c i j h ¯ j y j ( t ) ] d t + ϱ i t , x i ( t ) d ω ( t ) , t t τ , d y j ( t ) = [ b j y j ( t ) + i = 1 2 d j i g ¯ i x i ( t ) ] d t + ϱ j ˜ t , y j ( t ) d ω ( t ) , t t τ , Δ x i ( t τ + ) = ( ξ i 1 ) x i ( t τ ) , t = t τ , Δ y j ( t τ + ) = ( ξ j ˜ 1 ) y j ( t τ ) , t = t τ ,
its related parameters are chosen as a 1 = 0.3744 1.0464 i , a 2 = 0.3072 1.4592 i , b 1 = 1.8 [ 0.45 1.07 i , 0 ; 0 , 0.22 1.43 i ] , b 2 = 0.3960 2.5740 i , c 11 = 0.624 + 1.812 i , c 12 = 1.656 + 0.120 i , c 21 = 1.740 + 2.040 i , c 22 = 0.624 1.452 i , d 11 = 0.624 + 1.812 i , d 12 = 1.656 + 0.120 i , d 21 = 1.740 + 2.040 i , d 22 = 0.624 1.452 i , h ¯ 1 ( u ) = h ¯ 2 ( u ) = g ¯ 1 ( u ) = g ¯ 2 ( u ) = 1.2 tanh ( R e ( u ) ) + 1.2 tanh ( I m ( u ) ) i , ϱ 1 ( t , · ) = 0.080 0.680 i , ϱ 2 ( t , · ) = 0.282 + 0.826 i , ϱ ˜ 1 = 0.258 + 0.444 i , ϱ ˜ 2 = 0.432 1.016 i .
By setting the impulsive moments as t τ = 2 τ for τ N and impulsive gains ξ i = 0.42 and ξ j ˜ = 0.45 , then the MATLAB simulations of system (31) with initial conditions x 1 0 = 0.63 + 0.82 i , x 2 0 = 0.98 0.71 i , y 1 0 = 0.46 0.38 i and y 2 0 = 1.27 + 0.82 i are shown in Figure 1, which indicates that system (31) has a chaotic attractor.
Now, we introduce the response system of system (31) as follows
d x ˜ i ( t ) = [ a i x ˜ i ( t ) + j = 1 2 c i j h ¯ j y ˜ j ( t ) + u i ( t ) ] d t + ϱ i t , x ˜ i ( t ) d ω ( t ) , t t τ , d y j ˜ ( t ) = [ b j y j ˜ ( t ) + i = 1 2 d j i g ¯ i x ˜ i ( t ) + v j ( t ) ] d t + ϱ ˜ j t , y ˜ j ( t ) d ω ( t ) , t t τ , Δ x ˜ i ( t τ ) = ( ξ i 1 ) x ˜ i ( t τ ) , t = t τ , Δ y ˜ j ( t τ ) = ( ξ ˜ j 1 ) y ˜ j ( t τ ) , t = t τ ,
where the corresponding parameter is the same as in system (31).
By simple computation we can obtain that L i g = L j h = 1 , η i = η ˜ j = 0.5 , i , j = 1 , 2 . Thus, the Assumptions 1 and 2 are satisfied. To simplify the demonstration, we first reselect the impulsive moments as t τ = 0.12 τ for τ N , and then choose the control parameters as χ 1 = χ 2 = 8.6 , ζ 1 = ζ 2 = 5.6 , ρ 1 = ρ 2 = 7.8 , γ 1 = γ 2 = 6.8 , θ = 0.25 , ϑ = 1.12 , we can calculate that α = 12.0292 , β = 10.7438 , ξ = 0.2025 and ς = k + ln ξ ν τ = 3.4103 < 0 . This means that all the criteria of Theorem 1 hold true. Therefore, from Theorem 1, drive-response impulsive neural networks (31) and (32) will achieve FXT time synchronization with ST T 3 = 1.5424 . The time evolution of FXT synchronization errors between systems (31) and (32) are given in Figure 2, where the initial values of system (32) are arbitrarily taken in [−5, 5].
Next we consider the PDT synchronization of systems (31) and (32) under controller (21). By choosing T c = 1.32 , the condition k < min { α , β , T c T 0 ln ξ ν τ } in Theorem 2 is satisfied, where T 0 = 1.7730 . Therefore, according to Theorem 2, the drive-response systems (31) and (32) are PDT synchronized in a PDT T c = 1.32 that is less than T 0 = 1.7730 and T 3 = 1.5424 . The time evolution of the PDT synchronization error between the systems (31) and (32) under the PDT controller is shown in Figure 3.
Example 2.
For n = m = 3 , consider the following complex-valued impulse BAM neural network with stochastic perturbations:
d x i ( t ) = [ a i x i ( t ) + j = 1 3 c i j h ¯ j y j ( t ) ] d t + ϱ i t , x i ( t ) d ω ( t ) , t t τ , d y j ( t ) = [ b j y j ( t ) + i = 1 3 d j i g ¯ i x i ( t ) ] d t + ϱ j ˜ t , y j ( t ) d ω ( t ) , t t τ , Δ x i ( t τ + ) = ( ξ i 1 ) x i ( t τ ) , t = t τ , Δ y j ( t τ + ) = ( ξ j ˜ 1 ) y j ( t τ ) , t = t τ ,
where h ¯ 1 ( u ) = h ¯ 2 ( u ) = h ¯ 3 ( u ) = g ¯ 1 ( u ) = g ¯ 2 ( u ) = g ¯ 3 ( u ) = 1.2 ( c o s ( R e ( u ) ) + i s i n ( I m ( u ) ) ) , ϱ 1 = ϱ 2 = ϱ 3 = 1.8 + 0.56 i and ω t is a real-valued Brown motion. The other parameters of (33) are chosen as c 11 = 0.672 + 1.812 i , c 12 = 1.656 + 0.12 i , c 21 = 1.74 + 2.04 i , c 23 = 0.624 1.452 i , c 32 = 1.74 + 2.04 i , c 33 = 0.624 1.452 i , c 13 = c 22 = c 31 = 0 , d 11 = 0.915 0.615 i , d 12 = 2.1 + 2.565 i , d 13 = 2.265 2.58 i , d 21 = 1.86 + 7.725 i , d 22 = 0.435 2.685 i , d 23 = 1.725 2.04 i , d 31 = 1.8 + 2.256 i , d 32 = 2.46 + 4.725 i , d 33 = 1.725 2.176 i , a 1 = 0.48 1.308 i , a 2 = 0.384 1.824 i , a 3 = 0.624 1.584 i , b 1 = 0.54 1.284 i , b 2 = 0.264 1.716 i , b 3 = 0.504 1.356 i . Figure 4 shows the MATLAB simulations of system (33) with initial values x 1 ( θ ) = 0.4 + 0.8 i , x 2 ( θ ) = 0.9 0.7 i , x 3 ( θ ) = 0.29 0.47 i , y 1 ( θ ) = 0.6 0.3 i , y 2 ( θ ) = 1.2 + 0.8 i , y 3 ( θ ) = 0.4 + 0.8 i , and ξ i = 0.58 , ξ ¯ j = 0.9 , i , j = 1 , 2 , 3 which indicates that system (33) has a chaotic attractors.
The corresponding slave system is described as
d x ˜ i ( t ) = [ a i x ˜ i ( t ) + j = 1 3 c i j h ¯ j y ˜ j ( t ) + u i ( t ) ] d t + ϱ i t , x ˜ i ( t ) d ω ( t ) , t t τ , d y ˜ j ( t ) = [ b j y ˜ j ( t ) + i = 1 3 d j i g ¯ i x ˜ i ( t ) + v j ( t ) ] d t + ϱ ˜ j t , y ˜ j ( t ) d ω ( t ) , t t τ , Δ x ˜ i ( t τ ) = ( ξ i 1 ) x ˜ i ( t τ ) , t = t τ , Δ y ˜ j ( t τ ) = ( ξ ˜ j 1 ) y ˜ j ( t τ ) , t = t τ ,
where a i , b i , c i j , d j i , h ¯ j , g ¯ i , ϱ i , ϱ ˜ j , i , j = 1 , 2 , 3 are defined in system (33). It is not difficult to check that Assumptions 1 and 2 are satisfied with L i g = L j h = 1 , η i = η ˜ j = 2.2 for i , = 1 , 2 , 3 . In addition, by simple computation, we get k 1 = max { k i } = 9.6279 , k 2 = max { κ } = 9.7479 , k = max { 2 k 1 , 2 k 2 } = 19.4957 . Choosing χ 1 = χ 2 = χ 3 = 4.2 , ζ 1 = ζ 2 = ζ 3 = 4.6 , ρ 1 = ρ 2 = ρ 3 = 4.5 , γ 1 = γ 2 = γ 3 = 3.7 , θ = 0.7 and ϑ = 1.7 , then the conditions in Theorem 1 are satisfied. Therefore, according to Theorem 1, the master-slave systems (33) and (34) are FXT synchronized within T = 0.6743 . Figure 5 shows the time changes of the solutions of errors dynamics between (33) and (34) under the controller (7), where the initial values of system (34) are randomly selected in [−8, 8].
Next we consider the PDT synchronization of systems (33) and (34) under controller (21). By choosing T c = 0.521 , the condition k < min { α , β , T p T 0 ln ξ ν τ } in Theorem 2 is satisfied, where T 0 = 1.773 . Therefore, according to Theorem 2, the drive-response systems (31) and (32) are PDT synchronized in a PDT T p = 0.521 that is less than T 0 = 1.7730 and T 3 = 0.6743 . The time evolution of the PDT synchronization error between the systems (33) and (34) under the PDT controller is shown in Figure 6.

5. Conclusions

In this article, we considered the FXT and PDT synchronization issue of a class of complex-valued neural networks with stochastic perturbations and impulsive effects. First, some FXT and PDT stability results are introduced for general complex-valued stochastic nonlinear systems with impulsive effects. Then, based on these developed results, we have derived some novel FXT and PDT synchronization criteria for the considered complex-variable neural networks by designing novel controllers and employing some analysis methods. The introduced controllers are simple and they do not include a linear feedback term k i e i ( t ) , which is used by most of the recent published works on FXT and PDT synchronization studies, Thereby, the control burden is relaxed to some extent. In addition, the feasibility of the theocratical results are demonstrated by giving one numerical example and its numerical simulations. It is worth to mention that the devolved theoretical results of the paper will provide some insights to investigate the more complex types of neural networks with impulsive effects such as Clifford-valued neural networks and quaternion-valued neural networks, etc.

Author Contributions

J.Y., writing, methodology, and visualization. A.A., visualization, review, editing and funding acquisition. H.S., review and editing. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Outstanding Youth Program of Xinjiang, China (Grant no. 2022D01E10).

Conflicts of Interest

The authors declare that they have no any competing interests regarding the publication of this article.

References

  1. Kosko, B. Adaptive bidirectional associative memories. Appl. Opt. 1987, 26, 4947–4960. [Google Scholar] [CrossRef] [Green Version]
  2. Ali, M.S.; Vadivel, R.; Kwon, O.M. Decentralized event-triggered stability analysis of neutral-type BAM neural networks with Markovian jump parameters and mixed time varying delays. Int. J. Control Autom. Syst. 2018, 16, 983–993. [Google Scholar] [CrossRef]
  3. Dong, T.; Xiang, W.; Huang, T. Pattern formation in a reaction-diffusion BAM neural network with time delay: (k1, k2) mode Hopf-zero bifurcation case. IEEE Trans. Neural Netw. Learn. Syst. 2021, 3, 15–28. [Google Scholar] [CrossRef]
  4. Ali, M.S.; Saravanakumar, R.; Cao, J. New passivity criteria for memristor-based neutral-type stochastic BAM neural networks with mixed time-varying delays. Neurocomputing 2016, 171, 1533–1547. [Google Scholar]
  5. Guo, Y.; Luo, Y.; Wang, W. Fixed-time synchronization of complex-valued memristive BAM neural network and applications in image encryption and decryption. Int. J. Control Autom. Syst. 2020, 18, 462–476. [Google Scholar] [CrossRef]
  6. Yuan, M.; Wang, W.; Luo, X. Asymptotic anti-synchronization of memristor-based BAM neural networks with probabilistic mixed time-varying delays and its application. Mod. Phys. Lett. Condens. Matter Phys. Stat. Phys. Appl. Phys. 2018, 32, 1850278. [Google Scholar] [CrossRef]
  7. Wang, W.; Wang, X.; Luo, X. Finite-time projective synchronization of memristor-based BAM neural networks and applications in image encryption. IEEE Access 2018, 6, 56457–56476. [Google Scholar] [CrossRef]
  8. Nejadgholi, I.; Seyyedsalehi, S.A.; Chattier, S. A chaotic feature extracting BAM and its application in implementing memory search. Neural Process. Lett. 2012, 36, 69–99. [Google Scholar] [CrossRef]
  9. Abdurahman, A.; Jiang, H.; Teng, Z. Finite-time synchronization for memristor-based neural networks with time-varying delays. Neural Netw. 2015, 69, 20–28. [Google Scholar] [CrossRef]
  10. Liu, X.; Cao, J.; Yu, W. Nonsmooth finite-time synchronization of switched coupled neural networks. IEEE Trans. Cybern. 2015, 46, 2360–2371. [Google Scholar] [CrossRef]
  11. Bhat, S.P.; Bernstein, D.S. Finite-time stability of homogeneous systems. In Proceedings of the 1997 American Control Conference, Albuquerque, NM, USA, 6 June 1997; IEEE: Piscataway, NJ, USA, 1997; Volume 4, pp. 2513–2514. [Google Scholar]
  12. Polyakov, A. Nonlinear feedback design for fixed-time stabilization of Linear Control Systems. IEEE Trans. Autom. Control 2011, 57, 2106–2110. [Google Scholar] [CrossRef]
  13. Liu, X.; Chen, T. Fixed-time cluster synchronization for complex networks via pinning control. arXiv 2015, arXiv:1509.03350. [Google Scholar]
  14. Wan, Y.; Cao, J.; Wen, G. Robust fixed-time synchronization of delayed Cohen-Grossberg neural networks. Neural Netw. 2016, 73, 86–94. [Google Scholar] [CrossRef] [PubMed]
  15. Yang, X.; Lam, J.; Ho, D.W.C. Fixed-time synchronization of complex networks with impulsive effects via nonchattering control. IEEE Trans. Autom. Control 2017, 62, 5511–5521. [Google Scholar] [CrossRef]
  16. Jia, H.; Luo, D.; Wang, J.; Shen, H. Fixed-time synchronization for inertial CohenC-Grossberg delayed neural networks: An event-triggered approach. Knowl.-Based Syst. 2022, 250, 109104. [Google Scholar] [CrossRef]
  17. Pang, M.; Zhang, Z.; Wang, X.; Wang, Z.; Lin, C. Fixed/Preassigned-time synchronization of high-dimension-valued fuzzy neural networks with time-varying delays via nonseparation approach. Knowl.-Based Syst. 2022, 255, 109774. [Google Scholar] [CrossRef]
  18. Zhang, Y.; Wang, Y.W.; Xiao, J.W. Predefined-time secondary control for DC microgrid. IEEE Trans. Ind. Electron. 2021, 69, 13504–13513. [Google Scholar] [CrossRef]
  19. Li, Q.; Liu, S. Predefined-time vector-polynomial-based synchronization among a group of chaotic systems and its application in secure information transmission. AIMS Math. 2021, 6, 11005–11028. [Google Scholar] [CrossRef]
  20. Nitta, T. Solving the XOR problem and the detection of symmetry using a single complex-valued neuron. Neural Netw. 2003, 16, 1101–1105. [Google Scholar] [CrossRef]
  21. Gibbon, J.D.; Mcguinness, M.J. The real and complex Lorenz equations in rotating fluids and lasers. Physical D 1982, 5, 108–122. [Google Scholar] [CrossRef]
  22. Bolognani, S.; Smyshlyaev, A.; Krstic, M. Adaptive output feedback control for complex-valued reaction-advection-diffusion systems. In Proceedings of the American Control Conference, Seattle, WA, USA, 11–13 June 2008; IEEE: Piscataway, NJ, USA, 2008; pp. 961–966. [Google Scholar]
  23. Sun, K.; Zhu, S.; Wei, Y. Finite-time synchronization of memristor-based complex-valued neural networks with time delays. Phys. Lett. A 2019, 383, 2255–2263. [Google Scholar] [CrossRef]
  24. Ding, X.; Cao, J.; Alsaedi, A. Robust fixed-time synchronization for uncertain complex-valued neural networks with discontinuous activation functions. Neural Netw. 2017, 90, 42–55. [Google Scholar] [CrossRef] [PubMed]
  25. Zhang, Z.; Guo, R.; Liu, X.; Zhong, M.; Lin, C.; Chen, B. Fixed-time synchronization for complex-valued BAM neural networks with time delays. Asian J. Control 2019, 23, 298–314. [Google Scholar] [CrossRef]
  26. Feng, L.; Yu, J.; Hu, C. Nonseparation method-based finite/fixed-time synchronization of fully complex-valued discontinuous neural networks. IEEE Trans. Cybern. 2021, 51, 3212–3223. [Google Scholar] [CrossRef] [PubMed]
  27. Zhu, Q.; Cao, J. Stability analysis of Markovian jump stochastic BAM neural networks with impulse control and mixed time delays. IEEE Trans. Neural Netw. Learn. Syst. 2012, 23, 467–479. [Google Scholar] [PubMed]
  28. Shi, P.; Zhang, Y.; Agarwal, R.K. Stochastic finite-time state estimation for discrete time-delay neural networks with Markovian jumps. Neurocomputing 2015, 151, 168–174. [Google Scholar] [CrossRef]
  29. Xu, D.; Liu, Y.; Liu, M. Finite-time synchronization of multi-coupling stochastic fuzzy neural networks with mixed delays via feedback control. Fuzzy Sets Syst. 2021, 411, 85–104. [Google Scholar] [CrossRef]
  30. Yu, J.; Yu, S.; Li, J. Fixed-time stability theorem of stochastic nonlinear systems. Int. J. Control 2019, 92, 2194–2200. [Google Scholar] [CrossRef]
  31. Li, L.; Xu, R.; Gan, Q. A switching control for finite-time synchronization of memristor-based BAM neural networks with stochastic disturbances. Nonlin. Anal. Control 2020, 25, 958–979. [Google Scholar] [CrossRef]
  32. Ren, H.; Peng, Z.; Gu, Y. Fixed-time synchronization of stochastic memristor-based neural networks with adaptive control. Neural Netw. 2020, 130, 165–175. [Google Scholar] [CrossRef]
  33. Sun, G.; Zhang, Y. Exponential stability of impulsive discrete-time stochastic BAM neural networks with time-varying delay. Neurocomputing 2014, 131, 323–330. [Google Scholar] [CrossRef]
  34. Gu, H. Mean square exponential stability in high-order stochastic impulsive BAM neural networks with time-varying delays. Neurocomputing 2011, 74, 720–729. [Google Scholar] [CrossRef]
  35. Abudusaimaiti, M.; Abdurahman, A.; Jiang, H. Fixed/predefined-time synchronization of fuzzy neural networks with stochastic perturbations. Chaos Solitons Fractals 2022, 154, 111596. [Google Scholar] [CrossRef]
  36. Wang, Q.; Zhao, H.; Liu, A. Predefined-time Synchronization of Stochastic Memristor-based Bidirectional Associative Memory Neural Networks with Time-varying Delays. IEEE Trans. Cogn. Dev. Syst. 2021. [Google Scholar] [CrossRef]
  37. Wang, X.; Liu, X.; She, K. Pinning impulsive synchronization of complex dynamical networks with various time-varying delay sizes. Nonlin. Anal. Syst. 2017, 26, 307–318. [Google Scholar] [CrossRef]
  38. Rajchakit, G.; Sriraman, R. Robust passivity and stability analysis of uncertain complex-valued impulsive neural networks with time-varying delays. Neural Process. Lett. 2021, 53, 581–606. [Google Scholar] [CrossRef]
  39. Hu, H.; Gao, B.; Xu, L. Finite-Time and Fixed-Time Attractiveness for Nonlinear Impulsive Systems. IEEE Trans. Autom. Control. 2021, 67, 5586–5593. [Google Scholar] [CrossRef]
  40. Li, H.; Li, C.; Huang, T. Fixed-time stability and stabilization of impulsive dynamical systems. J. Frankl. Inst. 2017, 354, 8626–8644. [Google Scholar] [CrossRef]
  41. Jamal, M.A.; Kumar, R.; Mukhopadhyay, S. Fixed-time stability of dynamical systems with impulsive effects. J. Frankl. Inst. 2022, 359, 3164–3182. [Google Scholar] [CrossRef]
  42. Lee, L.; Liu, Y.; Liang, J. Finite time stability of nonlinear impulsive systems and its applications in sampled-data systems. ISA Trans. 2015, 57, 172–178. [Google Scholar] [CrossRef]
  43. Oksendal, B. Stochastic Differential Equations: An Introduction with Applications; Springer Science and Business Media: Berlin/Heidelberg, Germany, 2013. [Google Scholar]
  44. Yin, J.; Khoo, S.; Man, Z. Finite-time stability and instability of stochastic nonlinear systems. Automatica 2011, 47, 2671–2677. [Google Scholar] [CrossRef]
  45. Hardy, G.H.; Littlewood, J.E.; Plya, G. Inequalities; Cambridge University Press: Cambridge, UK, 1952. [Google Scholar]
  46. Anguiano-Gijón, C.A.; Muñoz-Vázquez, A.J.; Sxaxnchez-Torres, J.D. On predefined-time synchronisation of chaotic systems. Chaos Solitons Fractals 2019, 122, 172–178. [Google Scholar] [CrossRef]
  47. Song, Q.; Yan, H.; Zhao, Z. Global exponential stability of complex-valued neural networks with both time-varying delays and impulsive effects. Neural Netw. 2016, 79, 108–116. [Google Scholar] [CrossRef] [PubMed]
Figure 1. The chaotic attractor of the real and imaginary parts of system (31).
Figure 1. The chaotic attractor of the real and imaginary parts of system (31).
Mathematics 10 04384 g001
Figure 2. Evaluation of the real and imaginary parts of FXT synchronization errors s i and r i .
Figure 2. Evaluation of the real and imaginary parts of FXT synchronization errors s i and r i .
Mathematics 10 04384 g002
Figure 3. Evaluation of the real and imaginary parts of PDT synchronization errors s i and r i .
Figure 3. Evaluation of the real and imaginary parts of PDT synchronization errors s i and r i .
Mathematics 10 04384 g003
Figure 4. The chaotic attractor of the real and imaginary parts of system (33).
Figure 4. The chaotic attractor of the real and imaginary parts of system (33).
Mathematics 10 04384 g004
Figure 5. Evaluation of the real and imaginary parts of FXT synchronization errors s i and r i .
Figure 5. Evaluation of the real and imaginary parts of FXT synchronization errors s i and r i .
Mathematics 10 04384 g005
Figure 6. Evaluation of the real and imaginary parts of PDT synchronization errors s i and r i .
Figure 6. Evaluation of the real and imaginary parts of PDT synchronization errors s i and r i .
Mathematics 10 04384 g006
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

You, J.; Abdurahman, A.; Sadik, H. Fixed/Predefined-Time Synchronization of Complex-Valued Stochastic BAM Neural Networks with Stabilizing and Destabilizing Impulse. Mathematics 2022, 10, 4384. https://doi.org/10.3390/math10224384

AMA Style

You J, Abdurahman A, Sadik H. Fixed/Predefined-Time Synchronization of Complex-Valued Stochastic BAM Neural Networks with Stabilizing and Destabilizing Impulse. Mathematics. 2022; 10(22):4384. https://doi.org/10.3390/math10224384

Chicago/Turabian Style

You, Jingjing, Abdujelil Abdurahman, and Hayrengul Sadik. 2022. "Fixed/Predefined-Time Synchronization of Complex-Valued Stochastic BAM Neural Networks with Stabilizing and Destabilizing Impulse" Mathematics 10, no. 22: 4384. https://doi.org/10.3390/math10224384

APA Style

You, J., Abdurahman, A., & Sadik, H. (2022). Fixed/Predefined-Time Synchronization of Complex-Valued Stochastic BAM Neural Networks with Stabilizing and Destabilizing Impulse. Mathematics, 10(22), 4384. https://doi.org/10.3390/math10224384

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop