Next Article in Journal
Haircut Capital Allocation as the Solution of a Quadratic Optimisation Problem
Next Article in Special Issue
RBFNN-Based Distributed Coverage Control on an Unknown Region
Previous Article in Journal
Adaptive Control for an Aircraft Wing System with Hysteresis Nonlinearity
Previous Article in Special Issue
Global Stabilization of Delayed Feedback Financial System Involved in Advertisement under Impulsive Disturbance
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Fixed-Time Synchronization of Complex-Valued Coupled Networks with Hybrid Perturbations via Quantized Control

College of Mathematics and Statistics, Sichuan University of Science and Engineering, Zigong 643000, China
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(18), 3845; https://doi.org/10.3390/math11183845
Submission received: 15 August 2023 / Revised: 2 September 2023 / Accepted: 6 September 2023 / Published: 7 September 2023
(This article belongs to the Special Issue Mathematic Control and Artificial Intelligence)

Abstract

:
This paper considers the fixed-time synchronization of complex-valued coupled networks (CVCNs) with hybrid perturbations (nonlinear bounded external perturbations and stochastic perturbations). To accomplish the target of fixed-time synchronization, the CVCNs can be separated into their real and imaginary parts and establish real-valued subsystems, a novel quantized controller is designed to overcome the difficulties induced by complex parameters, variables, and disturbances. By means of the Lyapunov stability theorem and the properties of the Wiener process, some sufficient conditions are presented for the selection of control parameters to guarantee the fixed-time synchronization, and an upper bound of the setting time is also obtained, which is only related to parameters of both systems and the controller, not to the initial conditions of the systems. Finally, a numerical simulation is given to show the correctness of theoretical results and the effectiveness of the control strategy.

1. Introduction

The dynamical behaviors of real-valued neural networks (RVNNs) have been widely studied in diverse areas such as biology, information processing, and secure communications [1,2,3]. Compared with RVNNs, complex-valued neural networks (CVNNs) have attracted much attention because of their wide application in nonlinear filtering [4], optoelectronics [5], computer vision [6], remote sensing [7], and synthesis [8], in view of their greater computing power and information storage capabilities. In addition, they have been applied to describe wave functions in quantum mechanics and calculate parameters such as the voltage, current, and power in alternating current circuits [9,10]. At present, the study of CVCNs has involved many aspects, such as stability [11,12], bifurcation [13], and synchronization [14]. Therefore, we investigate the dynamics of CVCNs. Synchronization is a very peculiar phenomenon where the dynamic signals of chaotic systems converge to identical behavior over time.
Since the concept of synchronization was first proposed by Pecora and Carroll [15], many researchers have investigated this hot topic, and many different synchronization types have been introduced, such as asymptotic synchronization [16,17], exponential synchronization [14,18,19,20], finite-time synchronization [21,22,23,24,25,26,27,28,29], and so on.
It should be noted that asymptotic and exponential synchronization can be achieved as time approaches infinity. However, when considering real-world applications influenced by uncertain factors, achieving infinite time synchronization of the systems is not conducive to secure communication. Therefore, in order to improve the security of communication, it is important to accomplish synchronization within a certain finite time, namely finite-time synchronization. In addition, due to the fast convergence speed, finite-time synchronization is a good choice, which can ensure better robustness and anti-interference. For finite-time synchronization, in order to estimate the synchronization setting time, the initial value conditions of the systems are needed. However, from a practical point of view, it is difficult to obtain initial value conditions of the networks, limiting the applications of the finite-time technique. Recently, the fixed-time technique, as a special case of the finite-time technique, was proposed [30]. The advantage of the fixed-time technique is that the synchronization setting times only relate to the parameters of the systems, independent of the initial conditions. Thus, with the aid of the fixed-time technique, many excellent results were presented. In [31,32], fixed-time synchronization of RVNN was studied. The synchronization of complex networks under a fixed-time technique was investigated in [33,34]. The fixed-time synchronization of CVNNs was considered in [35,36,37].
The control strategy plays an important role in the framework of the fixed-time control technique. Thus, the designed controllers should be easy to implement in practice and reduce the control costs as much as possible. In [35,36,37,38,39], the synchronization of complex-valued networks was studied by state feedback control with precise error signals. However, when the network is frequently disturbed by external factors due to unknown factors in the real world, the transmitted signal can become very weak. In addition, due to the limitation of information transmission channels and bandwidth, communication constraints will be encountered. Therefore, it is very difficult to obtain accurate error information from practical applications. Recently, since the quantizer can quantize the signals with restricted information before transmission, the quantification technique has been widely used to achieve the control goals. Compared with the control strategy presented in [35,36,37,38,39], quantitative control is more regnant. The synchronization of neural networks via quantized output control was studied in [19,20,40]. In [23], the stabilization for a class of switched dynamical networks in finite time was investigated by a quantification technique. In [41], the authors investigated cluster synchronization of neural networks within a finite timeframe by crafting new non-chattering quantized controllers. In [42], research was conducted on the finite-time synchronization of quantized Markovian-jump time-varying delayed neural networks, with the design centered on an event-triggered control scheme. It is worth noting that the above works focus on the synchronization of real-valued systems, and there is no relevant literature on the fixed-time synchronization of CVCNs using quantized control.
Because there are certain unknown factors in the environment, it is inevitable that the CVCNs are often disturbed, and these disturbances can lead to more complex dynamic behaviors in the network. Therefore, the study of networks with disturbances is more significant in practical applications. On the one hand, some random fluctuations produced in the process of information transmission can be denoted as random perturbations. At present, there are numerous works on stochastic perturbations [17,19,33,35,38,43]. In particular, the synchronization of complex variable chaotic systems with stochastic perturbations via adaptive control was studied in [17]. The fixed-time synchronization of stochastic complex-valued fuzzy neural networks was investigated in [35]. Nonlinear perturbations should also be taken into account for networks due to environmental factors. In addition, artificially adding nonlinear interference to the network can improve the message transmission security. For example, the finite-time synchronization of chaotic systems with nonidentical perturbations was investigated in [22,24,25]. It should be noted that only infinite time synchronization can be achieved in [17,38], and either random perturbations or nonlinear bounded external perturbations were considered in [22,24,35]. Overcoming the effects of random and nonlinear perturbations is more difficult than considering one or the other. To our understanding, few researchers have considered the fixed-time synchronization of CVCNs with random and nonlinear perturbations. Moreover, the received signal is weak when the information carrier system suffers from external disturbances; the control strategy in [17,22,24,25,38] cannot be directly applied to achieve synchronization. For this purpose, this paper aims to solve this challenging and significant problem via a suitable quantization controller.
Inspired by the above discussion, in this paper, we consider the fixed-time synchronization CVCNs with mixed perturbations (i.e., stochastic disturbances and nonlinear bounded external disturbances). Since the mixed perturbations are taken into account and the parameters of the slave system differ from those of the master system, the master system is more practical than the system in [21,22,27,38]. The control strategies proposed in this paper are more general than those in [35,36,37,38,39].
The main contributions are as follows. ( i ) Based on the advantage of a quantizer, a new quantized control method is proposed to further save communication resources and reduce control costs. Moreover, even though the received signal is weak, the target of fixed-time synchronization can be achieved under the design control strategy. ( ii ) The designing controller can simultaneously overcome the difficulties induced by complex parameters, variables, and disturbances, and it has better robustness and disturbance rejection. ( iii ) Several sufficient conditions are obtained to guarantee fixed-time synchronization, considering CVCNs. Compared with the literature [17,22,38,39], due to the practicability of the system and the superiority of the control strategy, the results of this paper have strong universality.
The organization of this paper is as follows: In Section 2, the model consisting of CVCNs with hybrid perturbations is proposed. Some necessary definitions, assumptions, and lemmas are also presented. In Section 3, the fixed-time synchronization of the CVCNs considered is studied. In Section 4, a numerical simulation is given to show the correctness of theoretical results and the effectiveness of the control strategy. In Section 5, the conclusion is provided.
Notations: C n denotes a set of n-dimensional complex vectors. For x = x R + x I · ι C n , x R and x I denote the real and imaginary parts of x, respectively, ι = 1 . · is the Euclidean norm, and R n denotes the n-dimensional Euclidean space. The superscript T denotes the transposition of a matrix or vector. I n is the n × n identity matrix. λ max ( A ) means the largest eigenvalue of A, A s = 1 2 ( A + A T ) . Moreover, let ( Ω , F , { F t } t 0 , P ) be a complete probability space with filtration { F t } t 0 satisfying the usual conditions (i.e., the filtration contains all P-null sets and is right-continuous). We denote by L F 0 P ( [ τ , 0 ] ; C n ) the family of all F 0 -measurable C ( [ τ , 0 ] ; C n ) -valued random variables ϖ = { ϖ ( s ) : τ s 0 } , such that sup τ s 0 E ϖ ( s ) p < , where E { · } stands for the mathematical expectation operators, with respect to the given probability measure P.

2. Model Description and Some Preliminaries

Considering the interactions among multiple neural networks, the coupled complex-valued system is composed of N nodes, and each node contains two different perturbations; the dynamic evolution of the CVCNs with hybrid perturbations is described by
d ( x i ( t ) ) = C x i ( t ) + f ( x i ( t ) ) + j = 1 N a i j Φ x j ( t ) + σ i ( t ) + U i ( t ) d t + δ i ( t ) d w i ( t ) ,
with the initial condition
x i ( 0 ) = x i 0 = x i 0 R + ι x i 0 I , i = 1 , 2 , , N ,
where x i ( t ) = ( x i 1 ( t ) , x i 2 ( t ) , , x i n ( t ) ) T C n represents the n-dimensional complex-valued state vector of the ith node with x i k ( t ) = x i k R ( t ) + ι · x i k I ( t ) , k = 1 , 2 , , n , ι = 1 , x i k R ( t ) and x i k I ( t ) are real and imaginary parts of x i k ( t ) , respectively, C = ( c k ) n × n C n × n represents the self-feedback connection weight, f ( x i ( t ) ) = ( f 1 ( x i ( t ) ) , f 2 ( x i ( t ) ) , , f n ( x i ( t ) ) ) T C n is a nonlinear complex-valued vector function, Φ R n × n describes the inner coupling matrix of the network, and A ( a i j ) N × N R N × N is the linear coupling matrix; it represents the topology configuration of the entire network, satisfying a i j > 0 if there is a connection between nodes i and j, otherwise, a i j = 0 . Moreover, the diagonal elements of matrix A are defined as a i j = j = 1 , j i N a i j . In addition, σ i ( t ) represents nonlinear external bounded perturbations, δ i ( t ) is the noise intensity function matrix, and w i ( t ) = ( w i 1 ( t ) , w i 2 ( t ) , , w i n ( t ) ) T R n is a vector-form Wiener process defined on a complete probability space ( Ω , F , F t 0 , P ) . U i ( t ) = U i R ( t ) + ι U i I ( t ) is a control input that will be designed later.
Consider the CVCNs (1) as the master system; the slave system is described by
d ( y ( t ) ) = [ C ¯ y ( t ) + g ( y ( t ) ) ] d t
where y ( t ) C n represents the n-dimensional complex-valued state vector of the slave system (2), the definitions of C ¯ = ( c ¯ k ) n × n C n × n , and g ( y ( t ) ) C n are similar to those of system (1). In addition, the initial value of system (2) is y ( 0 ) = y 0 = y 0 R + ι y 0 I C n .
In the following, we state the definition of fixed-time synchronization and present some lemmas.
Definition 1
([33]). The master system (1) is said to be synchronized with the slave system (2) within a fixed time, if there exists T max , which is independent of the initial value x i 0 , y 0 , i = 1 , 2 , , N , such that
lim t T max E x i ( t ) y ( t ) = 0 , E x i ( t ) y ( t ) 0
for t T max , where T max is called the setting time.
Let e i ( t ) = x i ( t ) y ( t ) , subtracting (2) from (1), then the error system is described by
d e i ( t ) = C e i ( t ) + f ˜ ( e i ( t ) ) + j = 1 N a i j Φ e j ( t ) + Σ i ( t ) + U i ( t ) d t + δ i ( t ) d w i ( t ) ,
with initial condition e i ( 0 ) = x i 0 y 0 , i = 1 , 2 , , N , where f ˜ ( e i ( t ) ) = f ( x i ( t ) ) f ( y ( t ) ) , Σ i ( t ) = ( C C ¯ ) y ( t ) + f ( y ( t ) ) g ( y ( t ) ) + σ i ( t ) . Let e i ( t ) = e i R + ι · e i I ( t ) , C = C R + ι · C I ( t ) f ˜ ( e i ( t ) ) = f ˜ R ( e i ( t ) ) + ι · f ˜ I ( e i ( t ) ) , Σ i ( t ) = Σ i R ( t ) + ι · Σ i I ( t ) , U i ( t ) = U i R ( t ) + ι · U i I ( t ) , δ i ( t ) = δ i R ( t ) + ι · δ i I ( t ) . Then the error system (3) can be separated into real and imaginary parts, as
d e i R ( t ) = C R e i R ( t ) C I e i I ( t ) + f ˜ R ( e i ( t ) ) + j = 1 N a i j Φ e j R ( t ) + Σ i R ( t ) + U i R ( t ) d t + δ i R ( t ) d w i ( t ) , d e i I ( t ) = C R e i I ( t ) + C I e i R ( t ) + f ˜ I ( e i ( t ) ) + j = 1 N a i j Φ e j I ( t ) + Σ i I ( t ) + U i I ( t ) d t + δ i I ( t ) d w i ( t ) ,
with the initial condition
e i R ( 0 ) = x i 0 R y 0 R , e i I ( 0 ) = x i 0 I y 0 I , i = 1 , 2 , , N .
Remark 1.
According to the above discussion, the synchronization between the master system (1) and slave system (2) in a fixed time is equivalent to the fixed-time stability of (4) since x i ( t ) y ( t ) = e i ( t ) = e i R ( t ) + ι · e i I ( t ) . Thus, the main goal is to investigate the fixed-time stability of error system (4).
In order to establish the main results, in the following, we present some assumptions.
Assumption 1.
Positive constants exist, h i R , h ˜ i R , h i I , h ˜ i I , such that f ν ( x i ( t ) ) f ν ( y ( t ) ) h i ν x i R ( t ) y R ( t ) + h ˜ i ν x i I ( t ) y I ( t ) , where ν = { R , I } , i = 1 , 2 , , N .
Assumption 2.
Systems (1) and (2) are chaotic, and positive constants exist, M i j 1 , M ¯ i j 1 , M j 2 , M ¯ j 2 , M j 3 , M ¯ j 3 , M i j 4 , and M ¯ i j 4 , such that | f i j R ( y ( t ) ) | M i j 1 , | f i j I ( y ( t ) ) | M ¯ i j 1 , | g j R ( y ( t ) ) | M j 2 , | g j I ( y ( t ) ) | M ¯ j 2 , | y j R ( t ) | M j 3 , | y j I ( t ) | M ¯ j 3 , | σ i j R ( t ) | M i j 4 , and | σ i j I ( t ) | M ¯ i j 4 .
Assumption 3.
Nonnegative constants— μ i j and μ ˜ i j —exist, such that
Trace ( δ i R ( t ) ) T ( δ i R ( t ) ) j = 1 N μ i j e j R ( t ) T e j R ( t ) , Trace ( δ i I ( t ) ) T ( δ i I ( t ) ) j = 1 N μ ˜ i j e j I ( t ) T e j I ( t ) .
In order to better achieve the objectives of this article, we present some properties of the Wiener processes [17,26].
(1) E ( δ i ν ( t ) d w i ( t ) ) = 0 , ( δ i ν ( t ) d w i ( t ) ) T ( δ i ν ( t ) d w i ( t ) ) = Trace ( δ i ν ( t ) T δ i ν ) d t ;
(2) For x = ( x 1 , x 2 , , x n ) T , V ( x ( t ) ) is a scalar function. We can obtain the It o ^ differential equation’s V differential form as follows
d V = V t d t + i = 1 n V x i d x i + 1 2 i , j = 1 n 2 V x i x j d x i d x j .
Lemma 1
([30]). If a continuous radially unbounded function exists, V : R N R + { 0 } , such that
(1)
V ( z ) = 0 z = 0 ;
(2)
for α , β > 0 , 0 < p < 1 , > 1 , any solution z ( t ) satisfies the following inequality:
V ˙ ( z ( t ) ) α V p ( z ( t ) ) β V ( z ( t ) ) ,
then the origin of the network is globally stable in fixed-time equilibrium, and the fixed settling time is given by T max = 1 α ( 1 p ) + 1 β ( 1 ) .
Lemma 2
([44]). Let a 1 , a 2 , , a N 0 and 0 < ϑ 1 ,   ς > 1 . Then the following two inequalities hold:
i = 1 N a i ϑ i = 1 N a i ϑ , i = 1 N a i ς N 1 ς i = 1 N a i ς .

3. Fixed-Time Synchronization of CVCNs

To discuss the fixed-time synchronization of the master–slave systems (1) and (2) described in Section 2, in this section, we extend the controller method in [20,41] and design a suitable quantification controller as follows:
U i R ( t ) = l i R q e i R ( t ) β i R sign q e i R ( t ) Υ i R ( t ) η | q e i R ( t ) | φ + ζ | q e i R ( t ) | ψ , U i I ( t ) = l i I q e i I ( t ) β i I sign q e i I ( t ) Υ i I ( t ) η | q e i I ( t ) | φ + ζ | q e i I ( t ) | ψ ,
where l i R , l i I , β i R and β i I are positive constants to be determined later, and η > 0 , ζ > 0 , 0 < φ < 1 , ψ > 1 are tunable constants. Υ i R ( t ) = diag sign q e i R ( t ) , Υ i I ( t ) = diag sign q e i I ( t ) , q e i R ( t ) = q ( e i 1 R ( t ) ) , q ( e i 2 R ( t ) ) , , q ( e i n R ( t ) ) T . The from of q e i I ( t ) is the same as q e i R ( t ) , q ( · ) : R Γ is a quantizer, where Γ = { ± w i : w i = ρ i w 0 , 0 < ρ < 1 , i = 0 , ± 1 , ± 2 , } { 0 } with w 0 > 0 . For θ R , the quantizer q ( θ ) is defined as follows:
q ( θ ) = w i , i f 1 1 + ϱ w i < θ 1 1 ϱ w i , 0 , i f θ = 0 , q ( θ ) , i f θ < 0 ,
where ϱ = 1 ρ 1 + ρ . According to the Filippov regularization in [45], there exists a Filippov solution π [ ϱ , ϱ ) , such that q ( θ ) = ( 1 + π ) θ ; since ϱ ( 0 , 1 ) , it is obvious to obtain sign q e i R ( t ) = sign e i R ( t ) and sign q e i I ( t ) = sign e i I ( t ) .
Remark 2.
In [35,37], the fixed-time synchronization of complex-valued chaotic systems was investigated by designing the state feedback control. Note that the continuity and precisely state signal are needed for the state feedback controller. However, from a practical of view, it is quite difficult to receive precision signs due to the limitations of the information transmission channel and bandwidth. Therefore, the quantification control strategy is more practical than the controller in [20,41]. Moreover, the controller (5) can save the resources of the channel and reduce control costs.
Remark 3.
In order to better understand the quantization controller, the following explanation is needed. The quantization process is based on the quantizer q ( · ) : R Γ to convert the received signal of the continuous change in time and amplitude into a digital signal. According to the definition of q ( θ ) , for any given ρ ( 0 , 1 ) , ϱ = 1 ρ 1 + ρ , it is easy to see that
(1) if the received signal θ = 0 , then q ( θ ) = 0 ;
(2) if the received signal θ > 0 , and 1 1 + ϱ w i < θ 1 1 ϱ w i with w i = ρ i w 0 , and w 0 > 0 , then (a) for i = 0 , 1 , 2 , , we have q ( θ ) = w i = ρ i w 0 ; (b) for i = 1 , 2 , , we have q ( θ ) = w i = ρ i w 0 ;
(3) if the received signal θ < 0 , and 1 1 + ϱ w i < θ 1 1 ϱ w i with w i = ρ i w 0 and w 0 > 0 , then (a) for i = 0 , 1 , 2 , , we have q ( θ ) = w i = ρ i w 0 ; (b) for i = 1 , 2 , , we have q ( θ ) = w i = ρ i w 0 .
Moreover, if θ > 0 and 1 1 + ϱ w i < θ 1 1 ϱ w i , then ( 1 ϱ ) θ ( θ ) = w i < ( 1 + ϱ ) θ . If θ < 0 and 1 1 + ϱ w i < θ 1 1 ϱ w i , then ( 1 + ϱ ) θ < q ( θ ) = w i ( 1 ϱ ) θ . Thus, there exists a Filippov solution π [ ϱ , ϱ ) , such that q ( θ ) = ( 1 + π ) θ .
In the following, some sufficient conditions are derived to achieve the fixed-time synchronization of the master–slave systems (1) and (2).
Theorem 1.
The master system (1) can be synchronized with the slave system (2) in a fixed time if Assumption 1–3 and the following conditions are satisfied:
( C R + C I ) I N + H + Φ Θ s + Ξ + ( ϱ 1 ) L R < 0 ,
( C R + C I ) I N + H ˜ + Φ Θ s + Ξ ˜ + ( ϱ 1 ) L I < 0 ,
Q i β i R < 0 , Q ˜ i β i I < 0 ,
where Θ = ( a ˜ i j ) N × N , a ˜ i j = a i j , i j , a ˜ i i = χ min Φ a i i , χ min is the minimum eigenvalue of Φ s ; Ξ = 1 2 ( μ i j ) N × N , Ξ ˜ = 1 2 ( μ ˜ i j ) N × N , L R = diag ( l 1 R , l 2 R , , l N R ) , L I = diag ( l 1 I , l 2 I , , l N I ) , H = diag ( H 1 , H 2 , , H N ) , H i = 1 2 1 + h i R ( h i R + h ˜ i R ) + h i I ( h ˜ i I + h i I ) H ˜ = diag ( H ˜ 1 , H ˜ 2 , , H ˜ N ) , H ˜ i = 1 2 1 + h ˜ i I ( h ˜ i I + h i I ) + h ˜ i R ( h i R + h ˜ i R ) , Q i = max k = 1 n ( | c j k R c ¯ j k R | M k 3 + | c ¯ j k I c j k I | M ¯ k 3 ) + M i j 1 + M j 2 + M i j 4 , j = 1 , 2 , , n , Q ˜ i = max k = 1 n ( | c j k R c ¯ j k R | M ¯ k 3 + | c j k I c ¯ j k I | M k 3 ) + M ¯ i j 1 + M ¯ j 2 + M ¯ i j 4 , j = 1 , 2 , , n . Moreover, the setting time is estimated as
T max = 1 2 1 + φ 2 ( 1 ϱ ) φ η ( 1 1 + φ 2 ) + 1 2 1 + ψ 2 ( 1 ϱ ) ψ ζ N 1 1 + ψ 2 ( 1 + ψ 2 1 ) .
Proof. 
Consider the Lyapunov function as follows:
V ( t ) = 1 2 i = 1 N e i R ( t ) T e i R ( t ) + e i I ( t ) T e i I ( t ) .
According to the properties of the Wiener process in [17,26], differentiating V ( t ) along the solution of the error system (4), one obtains that
d V ( t ) = i = 1 N e i R ( t ) T d e i R ( t ) + 1 2 d e i R ( t ) T d e i R ( t ) + e i I ( t ) T d ( e i I ( t ) ) + 1 2 d e i I ( t ) T d e i I ( t ) .
Taking the expectations on both sides of Equation (9), then applying (4) and Assumption 3, we have
d E ( V ( t ) ) d t = E { i = 1 N [ e i R ( t ) T ( C R e i R ( t ) C I e i I ( t ) + f ˜ R ( e i ( t ) ) + j = 1 N a i j Φ e j R ( t ) + Σ i R ( t ) + R i R ( t ) ) + e i I ( t ) T ( C R e i I ( t ) + C I e i R ( t ) + f ˜ I ( e i ( t ) ) + j = 1 N a i j Φ e j I ( t ) + Σ i I ( t ) + R i I ( t ) ) + 1 2 Trace ( ( δ i R ( t ) ) T ( δ i R ( t ) ) ) + 1 2 Trace ( ( δ i I ( t ) ) T ( δ i I ( t ) ) ) ] } E i = 1 N ( C R + C I ) e i R ( t ) 2 + e i I ( t ) 2 + i = 1 N e i R ( t ) T f ˜ R ( e i ( t ) ) + e i I ( t ) T f ˜ I ( e i ( t ) ) + i , j = 1 , j i N a i j Φ e i R ( t ) e j R ( t ) + e i I ( t ) e j I ( t ) + i = 1 N χ m i n a i i ( e i R ( t ) 2 + e i R ( t ) 2 ) + i = 1 N e i R ( t ) T Σ i R ( t ) + e i I ( t ) T Σ i I ( t ) ] + 1 2 i = 1 N j = 1 N μ i j e j R ( t ) 2 + 1 2 i = 1 N j = 1 N μ ˜ i j e j I ( t ) 2 + i = 1 N [ e i R ( t ) T R i R ( t ) + e i I ( t ) T R i I ( t ) .
It can be obtained from Assumption 1 that
i = 1 N ( e i R ( t ) ) T f ˜ R ( e i ( t ) ) 1 2 i = 1 N ( e i R ( t ) ) T e i R ( t ) + f ˜ R ( e i ( t ) ) T f ˜ R ( e i ( t ) ) 1 2 i = 1 N e i R ( t ) T e i R ( t ) + h R e i R ( t ) + h ˜ R e i I ( t ) 2 = i = 1 N 1 2 1 + h i R ( h i R + h ˜ i R ) e i R ( t ) 2 + 1 2 h ˜ i R ( h ˜ i R + h i R ) e i I ( t ) 2 ,
and
i = 1 N ( e i I ( t ) ) T f ˜ I ( e i ( t ) ) i = 1 N [ 1 2 1 + h ˜ i I ( h i I + h ˜ i I ) e i I ( t ) 2 + 1 2 h i I ( h ˜ i I + h i I ) e i R ( t ) 2 ] .
Applying (11) and (12), we can obtain
i = 1 N e i R ( t ) T f ˜ R e i ( t ) + e i I ( t ) T f ˜ I e i ( t ) i = 1 N H i e i R ( t ) 2 + H ˜ i e i I ( t ) 2 .
Applying (4) and Assumption 2, we can obtain
i = 1 N e i R ( t ) T Σ i R ( t ) = i = 1 N j = 1 n e i j R ( t ) { k = 1 n ( c j k R c ¯ j k R ) y k R ( t ) + ( c ¯ j k I c j k I ) y k I ( t ) + f i j R ( y ( t ) ) g j R ( y ( t ) ) + σ i j R ( t ) } i = 1 N j = 1 n | e i j R ( t ) | [ k = 1 n | c j k R c ¯ j k R | | y k R ( t ) | + | c ¯ j k I c j k I | | y k I ( t ) | + | f i j R ( y ( t ) ) | + | g j R ( y ( t ) ) | + | σ i j R ( t ) | ] i = 1 N j = 1 n | e i j R ( t ) | [ k = 1 n | c j k R c ¯ j k R | M k 3 + | c ¯ j k I c j k I | M ¯ k 3 + M i j 1 + M j 2 + M i j 4 ] i = 1 N j = 1 n Q i | e i j R ( t ) | ,
and
i = 1 N ( e i I ( t ) ) T Σ i I ( t ) i = 1 N j = 1 n | e i j I ( t ) | [ k = 1 n | c j k R c ¯ j k R | M ¯ k 3 + | c j k I c ¯ j k I | M k 3 + M ¯ i j 1 + M ¯ j 2 + M ¯ i j 4 ] i = 1 N j = 1 n Q ˜ i | e i j I ( t ) | .
Applying (5), we have the following estimates:
i = 1 N e i R ( t ) T R i R ( t ) = i = 1 N e i R ( t ) T [ l i R q ( e i R ( t ) ) β i R sign ( q ( e i R ( t ) ) ) Υ i R ( t ) η | q ( e i R ( t ) ) | φ + ζ | q ( e i R ( t ) ) | ψ ] = i = 1 N j = 1 n [ e i j R ( t ) T l i R ( 1 + π i j R ) e i j R ( t ) β i R | e i j R ( t ) | η | 1 + π i j R | φ | e i j R ( t ) | 1 + φ ζ | 1 + π i j R | ψ | e i j R ( t ) | 1 + ψ ] i = 1 N ( ϱ 1 ) l i R e i R ( t ) 2 i = 1 N j = 1 n β i R | e i j R ( t ) | i = 1 N j = 1 n ( 1 ϱ ) φ η | e i j R ( t ) | 1 + φ i = 1 N j = 1 n ( 1 ϱ ) ψ ζ | e i j R ( t ) | 1 + ψ ,
and
i = 1 N e i I ( t ) T R i I ( t ) i = 1 N ( ϱ 1 ) l i I e i I ( t ) 2 i = 1 N j = 1 n β i I | e i j I ( t ) | i = 1 N j = 1 n ( 1 ϱ ) φ η | e i j I ( t ) | 1 + φ i = 1 N j = 1 n ( 1 ϱ ) ψ ζ | e i j I ( t ) | 1 + ψ ,
where π i j R , π i j I [ ϱ , ϱ ) , i = 1 , 2 , , N , j = 1 , 2 , , n . Substituting (11)–(17) into (10) yields
d E ( V ( t ) ) d t E { e ˜ R ( t ) T [ C R + C I I N + H + Φ Θ s + Ξ + ( ϱ 1 ) L R ] e ˜ R ( t ) + e ˜ I ( t ) T [ C R + C I I N + H ˜ + Φ Θ s + Ξ ˜ + ( ϱ 1 ) L I ] e ˜ I ( t ) + i = 1 N j = 1 n ( Q i β i R ) | e i j R ( t ) | + i = 1 N j = 1 n ( Q ˜ i β i I ) | e i j I ( t ) | i = 1 N j = 1 n ( 1 ϱ ) φ η | e i j R ( t ) | 1 + φ i = 1 N j = 1 n ( 1 ϱ ) ψ ζ | e i j R ( t ) | 1 + ψ i = 1 N j = 1 n ( 1 ϱ ) φ η | e i j I ( t ) | 1 + φ i = 1 N j = 1 n ( 1 ϱ ) ψ ζ | e i j I ( t ) | 1 + ψ } E { i = 1 N j = 1 n ( 1 ϱ ) φ η | e i j R ( t ) | 1 + φ i = 1 N j = 1 n ( 1 ϱ ) ψ ζ | e i j R ( t ) | 1 + ψ i = 1 N j = 1 n ( 1 ϱ ) φ η | e i j I ( t ) | 1 + φ i = 1 N j = 1 n ( 1 ϱ ) ψ ζ | e i j I ( t ) | 1 + ψ } ,
where
e ˜ R ( t ) = e 1 R ( t ) , e 2 R ( t ) , , e N R ( t ) T , e ˜ I ( t ) = e 1 I ( t ) , e 2 I ( t ) , , e N I ( t ) T .
It can be obtained from Lemma 2 that
i = 1 N j = 1 n ( 1 ϱ ) φ η | e i j R ( t ) | 1 + φ i = 1 N j = 1 n ( 1 ϱ ) φ η | e i j I ( t ) | 1 + φ = ( 1 ϱ ) φ η i = 1 N e i R ( t ) 2 1 + φ 2 + e i I ( t ) 2 1 + φ 2 ( 1 ϱ ) φ η i = 1 N e i R ( t ) 2 + e i I ( t ) 2 1 + φ 2 = 2 1 + φ 2 ( 1 ϱ ) φ η 1 2 i = 1 N e i R ( t ) 2 + e i I ( t ) 2 1 + φ 2 ,
and
i = 1 N j = 1 n ( 1 ϱ ) ψ ζ | e i j R ( t ) | 1 + ψ i = 1 N j = 1 n ( 1 ϱ ) ψ ζ | e i j I ( t ) | 1 + ψ = ( 1 ϱ ) ψ ζ i = 1 N e i R ( t ) 2 1 + ψ 2 + e i I ( t ) 2 1 + ψ 2 2 1 + ψ 2 ( 1 ϱ ) ψ ζ N 1 1 + ψ 2 1 2 i = 1 N e i R ( t ) 2 + e i R ( t ) 2 1 + ψ 2 .
From (18)–(20), one can obtain
d E V ( t ) d t 2 1 + φ 2 ( 1 ϱ ) φ η E V 1 + φ 2 ( t ) 2 1 + ψ 2 ( 1 ϱ ) ψ ζ N 1 1 + ψ 2 E V 1 + ψ 2 ( t ) .
Therefore, according to Lemma 1, the solution of system (4) is stable in fixed time, which means that system (1) is synchronized with (2) under the controller (5). Moreover, the setting time is estimated as
T max = 1 2 1 + φ 2 ( 1 ϱ ) φ η ( 1 1 + φ 2 ) + 1 2 1 + ψ 2 ( 1 ϱ ) ψ ζ N 1 1 + ψ 2 ( 1 + ψ 2 1 ) .
The proof is completed. □
Remark 4.
From the proof of Theorem 1, we can see that the discontinuous terms β i R sign q ( e i R ( t ) ) and β i I sign q ( e i I ( t ) ) in controller (5) play an important role in realizing the fixed-time synchronization. The inequalities (14) and (15) show that these terms can overcome the effects of complex parameters, variables, and nonlinear-bounded external disturbances. However, the system parameters are identical, without considering both stochastic disturbances and nonlinear perturbations simultaneously in [36,37]. Therefore, our results are more general than those in [36,37].
Remark 5.
Although there are many literature studies that study the synchronization of chaotic systems, there is no work on the fixed-time synchronization of complex-valued chaotic systems with double perturbations. In [28,29,39], the finite-time synchronization of complex-valued chaotic systems is discussed, and the control techniques of these papers cannot be directly applied to realize fixed-time synchronization. Although references [35,36,37] also studied the fixed time synchronization of complex-valued chaotic systems, the system in [35] only considered random perturbations. Therefore, our results derived here can be extended to more general systems to achieve finite-time synchronization and fixed-time synchronization.
In the following, we present two special cases.
Case 1: Both C of system (1) and C ¯ of system (2) are real-valued matrices, i.e., C , C ¯ R n × n .
Case 2: All the nodes of system (1) are identical with the isolated node of system (2), i.e., C = C ¯ R n × n , f ( x i ( t ) ) = g ( y ( t ) ) . Then Corollary 1 and 2 can be obtained from Theorem 1.
Corollary 1.
Suppose that C , C ¯ R n × n , and Assumption 1–3 hold, then the system (1) can be synchronized with (2) in fixed time if the control parameters in (5) are chosen to satisfy
C I N + H + Φ Θ s + Ξ + ( ϱ 1 ) L R < 0 ; C I N + H ˜ + Φ Θ s + Ξ ˜ + ( ϱ 1 ) L I < 0 ; Q ^ i β i R < 0 , Q ˇ i β i I < 0 ,
where Q ^ i = max k = 1 n ( | c j k c ¯ j k | M k 3 ) + M i j 1 + M j 2 + M i j 4 , j = 1 , 2 , , n , Q ˇ i = max k = 1 n ( | c j k R c ¯ j k R | M ¯ k 3 ) + M ¯ i j 1 + M ¯ j 2 + M ¯ i j 4 , j = 1 , 2 , , n , the other parameters are defined as those in Theorem 1.
Corollary 2.
Suppose that C = C ¯ R n × n , f ( x i ( t ) ) = g ( y ( t ) ) , and Assumption 1–3 hold, then the system (1) can be synchronized with (2) in fixed time if the control parameters in (5) are chosen to satisfy
C I N + H + Φ Θ s + Ξ + ( ϱ 1 ) L R < 0 ; C I N + H ˜ + Φ Θ s + Ξ ˜ + ( ϱ 1 ) L I < 0 ; β i R > max { M i j 4 , j = 1 , 2 , , n } , β i I > max { M ¯ i j 4 , j = 1 , 2 , , n } ,
where the other parameters are defined as those in Theorem 1.
Remark 6.
By lemma 1, inequality (19) and (20) show that the terms of Υ i R ( t ) η | q ( e i R ( t ) ) | φ + ζ | q ( e i R ( t ) ) | ψ and Υ i I ( t ) η | q ( e i I ( t ) ) | φ + ζ | q ( e i I ( t ) ) | ψ in (5) plays a key role in investigating fixed-time synchronization. The setting time T max entirely depends on the tunable parameters of these terms and the dimensions of CNs, meaning that the setting time can be pre-designed. From a practical of view, faster convergence and improved security of communication can be guaranteed based on Theorem 1, as well as Corollaries 1 and 2.
Remark 7.
Corollaries 1 and 2 show that the fixed-time synchronization of the coupled networks is also achieved when parameters C and C ¯ of system (1) are real and the state variables are complex. More generally, if parameters η and ζ are zeros, then the asymptotic synchronization of coupled networks with complex-valued state variables can be obtained. Thus, the synchronization criteria in [17] are a special case of those discussed in this paper.

4. Simulation

In this section, an example is given to show the correctness of the theoretical results and the effectiveness of the control strategy.
Example 1.
In the following, we consider two types of complex-valued nodes. One is described as
d x ( t ) = [ C x ( t ) + f ( x ( t ) ) ] d t ,
where x ( t ) = ( x 1 ( t ) , x 2 ( t ) , x 3 ( t ) ) T , f ( x ( t ) ) = ( 0 , x 1 ( t ) x 3 ( t ) , 2 x 1 ( t ) x 1 ( t ) ¯ ) T , ι = 1 and
C = 4.5 3.5 ι 1.5 5.3 ι 2.1 + 0.2 ι 5 1.5 ι 2 + 1.2 ι 3.5 3 ι 8 + 1.2 ι 2.3 + 3.2 ι 1 + 5 ι .
We take the initial conditions as x 1 ( 0 ) = 1 + ι , x 2 ( 0 ) = 1 2 ι , x 3 ( 0 ) = 3 1.2 ι , the corresponding state trajectories of real and imaginary parts for system (22) are shown in Figure 1a,b. From Figure 1, it is clear that system (22) is chaotic. Moreover, the states are bounded with | x 1 R ( t ) | 9.4476 , | x 2 R ( t ) | 9.3992 , | x 3 R ( t ) | 14.5645 , | x 1 I ( t ) | 5.7798 , | x 2 I ( t ) | 11.9380 , and | x 3 I ( t ) | 24.2552 .
The other system with the slave system is described by
d y ( t ) = [ C ¯ y ( t ) + g ( y ( t ) ) ] d t ,
where y ( t ) = ( y 1 ( t ) , y 2 ( t ) , y 3 ( t ) ) T , g ( y ( t ) ) = ( 0 , y 1 ( t ) y 3 ( t ) , y 1 ( t ) ¯ y 2 ( t ) + y 1 ( t ) y 2 ( t ) ¯ 2 ) T and
C ¯ = 2 + 2 ι 4.5 4.1 ι 1 + ι 1.8 5 ι 1 + 3 ι 4.1 2 ι 6.5 2.5 ι 2 ι 1 + ι .
We take the initial conditions as y 1 ( 0 ) = 1.2 + 2 ι , y 2 ( 0 ) = 1.5 + ι , y 3 ( 0 ) = 2 ι , the corresponding state trajectories of the real and imaginary parts for system (23) are chaotic in Figure 2a,b. Moreover, the states are bounded with | y 1 R ( t ) | 9.0130 , | y 2 R ( t ) | 16.5525 , | y 3 R ( t ) | 25.4055 , | y 1 I ( t ) | 7.3375 , | y 2 I ( t ) | 14.9001 , and | y 3 I ( t ) | 10.2828 .
We consider a complex-valued coupled system composed of system (22) with 5 nodes as the master system; it is described by
d ( x i ( t ) ) = [ C x i ( t ) + f ( x i ( t ) ) + j = 1 5 a i j Φ x j ( t ) + σ i ( t ) + U i ( t ) ] d t + δ i ( t ) d w i ( t ) , i = 1 , 2 , , 5 ,
where x i ( t ) = ( x i 1 ( t ) , x i 2 ( t ) , x i 3 ( t ) ) T , Φ = diag ( 1 , 1 , 1 ) , the nonlinear bound external perturbations
σ i ( t ) = ( 0.5 sin ( t ) + 0.3 cos ( t ) ι , 0.2 cos 2 ( t ) 0.6 sin ( t ) ι , 0.6 sin ( t ) cos ( t ) + 0.3 cos ( t ) ι ) T ,
the noise intensity function matrix
δ i ( t ) = diag ( x i 1 ( t ) x i + 1 , 1 ( t ) , x i 2 ( t ) x i + 1 , 2 ( t ) , x i 3 ( t ) x i + 1 , 3 ( t ) ) ,
and the outer coupling matrix
A = 2 0 1 0 1 1 3 1 0 1 0 0 3 0 3 0 1 0 2 1 2 1 0 0 3 .
By a simple calculation, it is easy to see that max { h i R } = 7.1281 , max { h ˜ i R } = 7.2435 , max { h i I } = 6.9649 , max { h ˜ i R } = 5.3971 , i = 1 , 2 , , 5 . Then we can obtain
f R ( x i ( t ) ) f R ( y ( t ) ) 7.1281 x i R ( t ) y R ( t ) + 7.2435 x i I ( t ) y I ( t ) ,
and
f I ( x i ( t ) ) f I ( y ( t ) ) 6.9649 x i R ( t ) y R ( t ) + 5.3971 x i I ( t ) y I ( t ) .
Thus, the results of Assumption 1 are met. In addition, we have the following results from (24)
Trace ( δ i R ( t ) ) T δ i R ( t ) = x i 1 R ( t ) x i + 1 , 1 R ( t ) 2 + x i 2 R ( t ) x i + 1 , 2 R ( t ) 2 + x i 3 R ( t ) x i + 1 , 3 R ( t ) 2 2 x i R ( t ) 2 + x i + 1 R ( t ) 2 ,
and
Trace ( ( δ i I ( t ) ) T δ i I ( t ) ) 2 ( ( x i I ( t ) ) 2 + ( x i + 1 I ( t ) ) 2 ) .
Thus, the Assumption 3 is met. Moreover, Assumption 2 is also met with M i 1 4 = 0.5 , M i 2 4 = 0.2 , M i 3 4 = 0.3 , M ¯ i 1 4 = 0.3 , M ¯ i 2 4 = 0.6 , M ¯ i 3 4 = 0.3 , M i 1 1 = M ¯ i 1 1 = M ¯ i 3 1 = M 1 2 = M ¯ 1 2 = M ¯ 3 2 = 0 , M i 2 1 = M 2 2 = 0.4 , M ¯ i 2 1 = M ¯ 2 2 = 5.2 , M i 3 1 = 10.88 , M 3 2 = 5.4468 .
Now we embark on the fixed-time synchronization of the master–slave system (24) and (23). We take C R = 11.1071 , C I = 7.7477 , Φ = 1 , ϱ = 1 9 , H i = 94.7711 , H ˜ i = 85.9098 , L i R 129.2436 , L i I 118.9852 , β i R 595.9580 , β i I 590.1322 i = 1 , 2 , , 5 . Moreover, we choose parameters η = ζ = 1 , φ = 0.8 , ψ = 1.2 , and the time-step size is 0.0001 in the simulation computation. According to Theorem 1, the fixed-time synchronization of the master–slave system (24) and (23) is reached with the controller (5), and the setting time T max 107.3918 in Figure 3. Moreover, the quantized error trajectories are also shown in Figure 4. From a numerical experiment, it can be directly observed that the numerical conclusions affirm Theorem 1.
In order to verify that the synchronization setting times are independent of the initial conditions, in the following, we present two additional sets of initial conditions and plot the time responses of the corresponding synchronization errors, respectively. The results obtained are compared with Figure 3. We take the initial conditions x 1 ( 0 ) = 0.3 + 0.6 ι , x 2 ( 0 ) = 1.2 1.5 ι , x 3 ( 0 ) = 1.5 2.1 ι and y 1 ( 0 ) = 0.5 + 0.1 ι , y 2 ( 0 ) = 0.2 + 11.5 ι , y 3 ( 0 ) = 1.5 2.2 ι , where the states are bounded with | x 1 R ( t ) | 9.8374 , | x 2 R ( t ) | 10.7061 , | x 3 R ( t ) | 15.1971 , | x 1 I ( t ) | 6.4189 , | x 2 I ( t ) | 13.3253 , | x 3 I ( t ) | 25.9034 , and | y 1 R ( t ) | 8.9586 , | y 2 R ( t ) | 16.2040 , | y 3 R ( t ) | 24.8368 , | y 1 I ( t ) | 8.2740 , | y 2 I ( t ) | 14.7078 and | y 3 I ( t ) | 10.9797 . Figure 5 shows the time response of the synchronization error trajectories with control gains L i R 122.2531 , L i I 105.7952 , β i R 583.3351 , β i I 573.0937 , i = 1 , 2 , , 5 and the setting time T max 107.3918 . The other set of parameters is as follows. We take the initial conditions x 1 ( 0 ) = 0.6 1.6 ι , x 2 ( 0 ) = 1.2 + 1.5 ι , x 3 ( 0 ) = 1.5 0.5 ι , and y 1 ( 0 ) = 1.5 2.1 ι , y 2 ( 0 ) = 1.2 1.5 ι , y 3 ( 0 ) = 1.5 + 1.2 ι , where the states are bounded with | x 1 R ( t ) | 10.0371 , | x 2 R ( t ) | 11.3207 , | x 3 R ( t ) | 15.6418 , | x 1 I ( t ) | 6.6981 , | x 2 I ( t ) | 14.5356 , | x 3 I ( t ) | 26.6356 , and | y 1 R ( t ) | 8.9906 , | y 2 R ( t ) | 16.5049 , | y 3 R ( t ) | 25.2442 , | y 1 I ( t ) | 7.4007 , | y 2 I ( t ) | 14.7877 , and | y 3 I ( t ) | 10.2174 . Figure 6 shows the time responses of synchronization error trajectories with control gains L i R 133.5672 , L i I 125.3956 , β i R 599.0732 , β i I 602.3367 i = 1 , 2 , , 5 and the setting time T max 107.3918 . Therefore, from the results of Figure 3, Figure 5, and Figure 6, it is easy to see that the synchronization setting time is independent of the initial value conditions.

5. Conclusions

In this paper, we studied the synchronization for CVCNs with both stochastic disturbances and nonidentical bounded external disturbances in fixed time. To achieve fixed-time synchronization, we designed a novel quantized controller, which can restrict the effects of complex parameters, variables, and disturbances. Based on the framework of the Lyapunov stability theorem and the properties of the Wiener process, several synchronization criteria were obtained, and the settling time was estimated. Some existing results on the fixed-time synchronization of CVCNs were extended. Numerical simulations verify the correctness of the theoretical results and the effectiveness of the control strategy.
In this paper, we considered only the fixed-time synchronization of CVCNs with double disturbances in order to reduce the computational difficulties. But in real applications, many systems are affected by several different factors. Thus, in future work, we plan to investigate finite-time synchronization and fixed-time synchronization under many different kinds of disturbances by designing a suitable controller, which is important and interesting, but much more difficult.

Author Contributions

E.W.: investigation, methodology, validation, data curation, software, writing—original draft. Y.W.: investigation, methodology, data curation. Y.L.: investigation, software, data duration. K.L.: investigation, methodology, validation. F.L.: conceptualization, investigation, methodology, validation, data duration, writing—reviewing and editing. All authors have read and agreed to the published version of the manuscript.

Funding

This work is supported by the National Natural Science Foundation of China (grant nos. 11971019 and 61573010), the Opening Project of the Sichuan Province University Key Laboratory of Bridge Non-destruction Detecting and Engineering Computing (grant nos. 2022QZJ02, 2021QYJ03 and 2020QYJ03), the National Natural Science Foundation of Sichuan (grant no. 2023NSFSC1021).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Liao, T.; Huang, N. An observer-based approach for chaotic synchronization with applications to secure communications. IEEE Trans. Circuits Syst. I 1999, 46, 1144–1150. [Google Scholar] [CrossRef]
  2. Strogatz, H.S.; Stewart, I. Coupled oscillators and biological synchronization. Sci. Amer. 1993, 269, 102–109. [Google Scholar] [CrossRef]
  3. Abeles, M.; Prut, Y.; Bergman, H.; Vaadia, E. Synchronization in neuronal transmission and its importance for information processing. Prog. Brain Res. 1994, 102, 395–404. [Google Scholar] [PubMed]
  4. Cha, I.; Kassam, S.A. Channel equalization using adaptive complex radial basis function networks. IEEE J. Sel. Area. Comm. 1995, 13, 122–131. [Google Scholar]
  5. Chen, S.; Hanzo, L.; Tan, S. Symmetric complex-valued rbf receiver for multiple-antenna-aided wireless systems. IEEE Trans. Neural Netw. 2008, 19, 1659–1665. [Google Scholar] [CrossRef] [PubMed]
  6. Kim, T.; Adali, T. Fully complex multi-layer perceptron network for nonlinear signal processing. J. Vlsi Signal Process. 2002, 32, 29–43. [Google Scholar] [CrossRef]
  7. Nitta, T. Orthogonality of decision boundaries in complex-valued neural networks. Neural Comput. 2004, 16, 73–97. [Google Scholar] [CrossRef] [PubMed]
  8. Tanaka, G.; Aihara, K. Complex-valued multistate associative memory with nonlinear multilevel functions for gray-level image reconstruction. IEEE Trans. Neural Netw. 2009, 20, 1463–1473. [Google Scholar] [CrossRef]
  9. Wu, K.; Kondra, T.V.; Rana, S.; Scandolo, C.M.; Xiang, G.; Li, C.; Guo, G.; Streltsov, A. Resource theory of imaginarity: Quantification and state conversion. Phys. Rev. A 2021, 103, 032401. [Google Scholar] [CrossRef]
  10. Canay, I.M. Modelling of alternating-current machines having multiplt rotor circuits. IEEE Trans. Energy Convers. 1993, 2, 280–296. [Google Scholar] [CrossRef]
  11. Liang, J.; Gong, W.; Huang, T. Multistability of complex-valued neural networks with discontinuous activation functions. Neural Netw. 2016, 84, 125–142. [Google Scholar] [CrossRef] [PubMed]
  12. Velmurugan, G.; Rakkiyappan, R.; Cao, J. Further analysis of global μ-stability of complex-valued neural networks with unbounded time-varying delays. Neural Netw. 2015, 67, 14–27. [Google Scholar] [CrossRef] [PubMed]
  13. Huang, C.; Cao, J.; Xiao, M.; Alsaedi, A.; Hayat, T. Bifurcations in a delayed fractional complex-valued neural networks. Appl. Math. Comput. 2017, 292, 210–227. [Google Scholar] [CrossRef]
  14. Bao, H.; Park, J.H.; Cao, J. Exponential synchronization of coupled stochastic memristor-based neural networks with time-varying probabilistic delay coupling and impulsive delay. IEEE Trans. Neural Netw. 2016, 27, 190–201. [Google Scholar] [CrossRef] [PubMed]
  15. Pecora, L.M.; Carrol, T.L. Synchronization in chaotic systems. Phys. Rev. Lett. 1990, 64, 821–824. [Google Scholar] [CrossRef] [PubMed]
  16. Yang, Z.; Luo, B.; Liu, D.; Li, Y. Pinning synchronization of memristor-based neural networks with time-varying delays. Neural Netw. 2017, 93, 143–151. [Google Scholar] [CrossRef]
  17. Wu, E.; Yang, X. Adaptive synchronization of coupled nonidentical chaotic systems with complex variables and stochastic perturbations. Nonlinear Dyn. 2016, 84, 261–269. [Google Scholar] [CrossRef]
  18. Wang, G.; Yin, Q.; Shen, Y. Exponential synchronization of coupled fuzzy neural networks with disturbances and mixed time-delays. Neurocomputing 2013, 106, 77–85. [Google Scholar] [CrossRef]
  19. Zhang, W.; Yang, S.; Li, C.; Zhang, W.; Yang, X. Stochastic exponential synchronization of memristive neural networks with time-varying delays via quantized control. Neural Netw. 2018, 104, 93–103. [Google Scholar] [CrossRef]
  20. Yang, X.; Cheng, Z.; Li, X.; Ma, T. Exponential synchronization of coupled neutral-type neural networks with mixed delays via quantized output control. J. Frankl. Inst. 2019, 356, 8138–8153. [Google Scholar] [CrossRef]
  21. Zhang, C.; Wang, X.; Unar, S.; Wang, Y. Finite-time synchronization of a class of nonlinear complex-valued networks with time-varying delays. Phys. A 2019, 528, 120985. [Google Scholar] [CrossRef]
  22. Luo, F.; Xiang, Y.; Wu, E. Finite-time synchronization of coupled complex-valued chaotic systems with time-delays and bounded perturbations. Mod. Phys. Lett. B 2022, 35, 2150130. [Google Scholar] [CrossRef]
  23. Yang, X.; Cao, J.; Xu, C.; Feng, J. Finite-time stabilization of switched dynamical networks with quantized couplings via quantized controller. Sci. China Technol. Sci. 2018, 61, 299–308. [Google Scholar] [CrossRef]
  24. Shi, L.; Yang, X.; Li, Y.; Feng, Z. Finite-time synchronization of nonidentical chaotic systems with multiple time-varying delays and bounded perturbations. Nonlinear Dyn. 2016, 83, 75–87. [Google Scholar] [CrossRef]
  25. Yang, X.; Wu, Z.; Cao, J. Finite-time synchronization of complex networks with nonidentical discontinuous nodes. Nonlinear Dyn. 2010, 73, 2313–2327. [Google Scholar] [CrossRef]
  26. Yang, X.; Cao, J. Finite-time stochastic synchronization of complex networks. Appl. Math. Model. 2010, 34, 3631–3641. [Google Scholar] [CrossRef]
  27. Xiong, K.; Yu, J.; Hu, C.; Jiang, H. Synchronization in finite/fixed time of fully complex-valued dynamical networks via nonseparation approach. J. Frankl. Inst. 2020, 357, 473–493. [Google Scholar] [CrossRef]
  28. Zhang, Z.; Li, A.; Yu, S. Finite-time synchronization for delayed complex-valued neural networks via integrating inequality method. Neurocomputing 2018, 318, 248–260. [Google Scholar] [CrossRef]
  29. Sun, K.; Zhu, S.; Wei, Y.; Zhang, X.; Gao, F. Finite-time synchronization of memristor-based complex-valued neural networks with time delays. Phys. Lett. A 2019, 383, 2255–2263. [Google Scholar] [CrossRef]
  30. Polyakov, A. Nonlinear feedback design for fixed-time stabilization of linear control systems. IEEE Trans. Autom. Control 2012, 57, 2106–2110. [Google Scholar] [CrossRef]
  31. Wan, Y.; Cao, J.; Wen, G.; Yu, W. Robust fixed-time synchronization of delayed cohen-grossberg neural networks. Neural Netw. 2016, 73, 86–94. [Google Scholar] [CrossRef] [PubMed]
  32. Cao, J.; Li, R. Fixed-time synchronization of delayed memristor-based recurrent neural networks. Sci. China Inf. Sci. 2017, 60, 032201. [Google Scholar] [CrossRef]
  33. Zhang, W.; Yang, X.; Li, C. Fixed-time stochastic synchronization of complex networks via continuous control. IEEE Trans. Cybern. 2019, 49, 3099–3104. [Google Scholar] [CrossRef] [PubMed]
  34. Yang, X.; Lam, J.; Ho, D.W.C.; Feng, Z. Fixed-Time synchronization of complex networks with impulsive effects via nonchattering control. IEEE Trans. Autom. Control 2017, 99, 5511–5521. [Google Scholar] [CrossRef]
  35. Wang, P.; Li, X.; Lu, J.; Lou, J. Fixed-time synchronization of stochastic complex-valued fuzzy neural networks with memristor and proportional delays. Neural Process. Lett. 2023. [CrossRef]
  36. Feng, L.; Hu, C.; Yu, J.; Jiang, H.; Wen, S. Fixed-time synchronization of coupled memristive complex-valued neural networks. Chaos Solitons Fractals 2021, 148, 110993. [Google Scholar] [CrossRef]
  37. Ding, X.; Cao, J.; Alsaedi, A.; Alsaadi, F.E.; Hayat, T. Robust fixed-time synchronization for uncertain complex-valued neural networks with discontinuous activation functions. Neural Netw. 2017, 90, 42–55. [Google Scholar] [CrossRef] [PubMed]
  38. Wang, P.; Jin, W.; Su, H. Synchronization of coupled stochastic complex-valued dynamical networks with time-varying delays via aperiodically intermittent adaptive control. Chaos 2018, 28, 043114. [Google Scholar] [CrossRef]
  39. Zhang, C.; Wang, X.; Wang, S.; Zhou, W.; Xia, Z. Finite-time synchronization for a class of fully complex-valued networks with coupling delay. IEEE Access 2018, 6, 17923–17932. [Google Scholar] [CrossRef]
  40. Zhang, W.; Li, C.; Yang, S.; Yang, X. Synchronization criteria for neural networks with proportional delays via quantized control. Nonlinear Dyn. 2018, 94, 541–551. [Google Scholar] [CrossRef]
  41. Tang, R.; Yang, X.; Wan, X. Finite-time cluster synchronization for a class of fuzzy cellular neural networks via non-chattering quantized controllers. Neural Netw. 2019, 113, 79–90. [Google Scholar] [CrossRef]
  42. Shanmugam, S.; Vadivel, R.; Gunasekaran, N. Finite-time synchronization of quantized markovian-jump time-varying delayed neural networks via an event-triggered control scheme under actuator saturation. Mathematics 2023, 11, 2257. [Google Scholar] [CrossRef]
  43. Zhang, W.; Li, C.; Yang, S.; Yang, X. Cluster stochastic synchronization of complex dynamical networks via fixed-time control scheme. Neural Netw. 2020, 124, 12–19. [Google Scholar] [CrossRef]
  44. Khalil, H.K.; Grizzle, J.W. Nonlinear Systems; Prentice Hall: Upper Saddle River, NJ, USA, 2002. [Google Scholar]
  45. Filippov, A.F. Differential Equations with Discontinuous Righthand Sides; Kluwer Academic Publisher: Dordrecht, The Netherlands, 1988. [Google Scholar]
Figure 1. Chaotic trajectory of system (22) with the initial value ( 1 + ι , 1 2 ι , 3 1.2 ι ) T .
Figure 1. Chaotic trajectory of system (22) with the initial value ( 1 + ι , 1 2 ι , 3 1.2 ι ) T .
Mathematics 11 03845 g001
Figure 2. Chaotic trajectory of system (23) with the initial value ( 1.2 + 2 ι , 1.5 + ι , 2 ι ) T .
Figure 2. Chaotic trajectory of system (23) with the initial value ( 1.2 + 2 ι , 1.5 + ι , 2 ι ) T .
Mathematics 11 03845 g002
Figure 3. The time response of synchronization errors e i R ( t ) and e i I ( t ) , i = 1 , 2 , , 5 .
Figure 3. The time response of synchronization errors e i R ( t ) and e i I ( t ) , i = 1 , 2 , , 5 .
Mathematics 11 03845 g003
Figure 4. The time response of quantized error trajectories.
Figure 4. The time response of quantized error trajectories.
Mathematics 11 03845 g004
Figure 5. The time responses of synchronization errors e i R ( t ) and e i I ( t ) , i = 1 , 2 , , 5 .
Figure 5. The time responses of synchronization errors e i R ( t ) and e i I ( t ) , i = 1 , 2 , , 5 .
Mathematics 11 03845 g005
Figure 6. The time responses of synchronization errors e i R ( t ) and e i I ( t ) , i = 1 , 2 , , 5 .
Figure 6. The time responses of synchronization errors e i R ( t ) and e i I ( t ) , i = 1 , 2 , , 5 .
Mathematics 11 03845 g006
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Wu, E.; Wang, Y.; Li, Y.; Li, K.; Luo, F. Fixed-Time Synchronization of Complex-Valued Coupled Networks with Hybrid Perturbations via Quantized Control. Mathematics 2023, 11, 3845. https://doi.org/10.3390/math11183845

AMA Style

Wu E, Wang Y, Li Y, Li K, Luo F. Fixed-Time Synchronization of Complex-Valued Coupled Networks with Hybrid Perturbations via Quantized Control. Mathematics. 2023; 11(18):3845. https://doi.org/10.3390/math11183845

Chicago/Turabian Style

Wu, Enli, Yao Wang, Yundong Li, Kelin Li, and Fei Luo. 2023. "Fixed-Time Synchronization of Complex-Valued Coupled Networks with Hybrid Perturbations via Quantized Control" Mathematics 11, no. 18: 3845. https://doi.org/10.3390/math11183845

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