Next Article in Journal
Properties of Un-Torrefied and Torrefied Poplar Plywood (PW) and Medium-Density Fiberboard (MDF)
Previous Article in Journal
Preparation of Graphene Oxide Hydrogels and Their Adsorption Applications toward Various Heavy Metal Ions in Aqueous Media
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Analytical Studies on Approximate Lag and Anticipating Synchronization in Two Unidirectionally Coupled Hyperchaotic Chen Systems without Time Delay

1
School of Environment and Architecture, University of Shanghai for Science and Technology, Shanghai 200093, China
2
Department of Civil Engineering, Wenzhou Polytechnic, Wenzhou 325035, China
*
Author to whom correspondence should be addressed.
Appl. Sci. 2023, 13(21), 11949; https://doi.org/10.3390/app132111949
Submission received: 6 October 2023 / Revised: 25 October 2023 / Accepted: 26 October 2023 / Published: 1 November 2023

Abstract

:
In this paper, approximate lag synchronization (LS) and anticipating synchronization (AS) between two unidirectionally coupled hyperchaotic Chen systems without time-delay coupling are analytically investigated. Firstly, the synchronization condition for exact LS in two unidirectionally coupled hyperchaotic Chen systems with time delay in signal transmission is analytically obtained. Under such conditions, approximate LS and AS are discussed by replacing the true time-delay terms with their Taylor expansions up to the third order.Differently from other research studies, the condition for exact LS is derived by regarding LS as a special type of generalized synchronization (GS), which has nothing to do with the value of the time delay. It is convenient to individually change the value of the lag and anticipation time of approximate LS and AS without considering the synchronization condition. Our study shows the power of a new method for recreating the past signals or predicting the future signals of a hyperchaotic Chen system by using its current signals. The results provide a simple way to eliminate the negative effects of time delay in the signal transmission between two hyperchaotic systems.

1. Introduction

The synchronization of chaotic systems plays a tremendous role in nonlinear system analysis and has been applied in a large variety of physical, chemical, neural network and biological systems [1,2,3] since the pioneering work of Pecora and Carroll [4]. The synchronization of chaotic systems is a process wherein two chaotic systems adjust a certain characteristic of their motion to standard performance because of a coupling or a forcing. Many different synchronization regimes have been studied in the past several decades, for instance, complete (or identical) synchronization (CS) [5,6], phase synchronization (PS) [7], lag synchronization (LS) [8,9,10,11,12], generalized synchronization (GS) [13,14], anticipating synchronization (AS) [15,16,17] and so on. Among all types of synchronization, CS is the simplest one, where the states of all oscillators are identical. GS is considered to be the type of chaos synchronization most frequently occurring in natural systems and is characterized by the existence of a functional relation between the state variables of drive–response systems. Different types of synchronization, such as CS, LS and AS, can be viewed as special types of GS with different functional relations.
In technology and nature, the time delay is ubiquitous due to finite signal transmission times, switching speeds as well as memory effects. LS, typically appearing as a coincidence of the shifted-in-time states of two systems, has received extensive attention in secure communications [18], laser networks [9] and digital image encryption [19]. AS was firstly proposed by Voss [20,21], who considered two chaotic systems unidirectionally coupled in a drive–response configuration and showed that the current states of a response system can be synchronized with the future states of a drive system. Two different coupling schemes were suggested by Voss: One is for the case where there exists an internal delay in a drive system that defines the anticipation time of a synchronized state. The other is for the case where a drive system does not possess internal delays, while in a salve system, there exists time-delay self-feedback. The work by Voss has led to the proven possibility of a real-time predictor of chaotic dynamics for systems without delays. Moreover, the scheme allows one to change the anticipation time without altering the dynamics of a drive system. As a possible application, AS can be used to design control methods for avoiding unwanted pulses from a drive system. AS has been reported in many applications in semiconductor lasers [22], chaotic laser diodes and cryptography [23,24].
Both LS and AS are mostly observed in systems using a time-delay factor. However, approximate LS has been found in bidirectionally and unidirectionally coupled oscillators with parameter mismatch [25]. AS has been also observed in systems without time delay. Such a type of phenomenon was first reported in the classical Voss scheme, where the true time-delay term was replaced with its first-order approximation [26]. Nevertheless, AS is not exact, that is, the advanced trajectory of a drive system only approximately coincides with the current trajectory of a response system. In addition, the anticipation time, in this case, is small. Blakely et al. [25] considered a more general case of nonidentical systems without time delay in which the mean frequency of a free response system is greater than the mean frequency of a master system. They showed that AS may occur in the Voss coupling scheme with vanishing time delay. If the above condition is satisfied in neural systems, the chaotic spikes of a presynaptic neuron may be predicted by a postsynaptic neuron. The Voss scheme provides a simple memoryless method to achieve LS and AS between coupled oscillators. In previous research studies on approximate LS and AS between two unidirectionally coupled chaotic systems without time-delay coupling, the true time-delay terms are first replaced by using their first-order approximations, which results in parameter mismatch between the drive and response systems. However, the value of the lag or anticipation time in approximate LS and AS significantly affects the synchronization condition for the two chaotic systems with such parameter mismatches. To guarantee synchronization, the value has to be limited to a very finite range. Furthermore, extending the result derived for two chaotic systems to larger arrays must also take into account possible instabilities caused by additional spatial modes. To overcome the disadvantage, the nature of the evolution of approximate LS and AS needs to be further studied in detail.
In this paper, approximate LS and AS between two unidirectionally coupled hyperchaotic Chen systems [27] without time-delay coupling are investigated. A hyperchaotic system is classified as a chaotic system with more than one positive Lyapunov exponent or unstable direction, which generates high complexity. We first analyze the synchronization condition for exact LS in two unidirectionally coupled hyperchaotic Chen systems with time delay in the signal transmission from the drive systems. Differently from most research studies, LS is regarded as a special type of GS, which can be studied by using the auxiliary system approach [28,29]. We show that the synchronization condition for exact LS analytically obtained in this paper is effective for any value of time delay in the signal transmission between two hyperchaotic Chen systems. Under such conditions, approximate LS and AS are discussed by replacing the true time-delay terms with their Taylor expansions up to the third order. Our research provides an effective method for recreating the past signals or predicting the future signals of a hyperchaotic Chen system by using its current signals.
The rest of this paper is organized as follows: In Section 2, two unidirectionally coupled hyperchaotic Chen systems with time delay in signal transmission are introduced. In Section 3, the synchronization condition for exact LS in the drive–response system is derived by regarding LS as a special type of GS, in which the auxiliary system approach and Laplace transform, combined with the successive approximation approach [30] in the Volterra integral equation theory, are used. In Section 4, numerical simulations are presented to verify the effectiveness of the synchronization condition for exact LS obtained in this paper. Approximate LS and AS are discussed in Section 5 and Section 6, respectively. The conclusions are finally drawn in Section 7.

2. System Description

The hyperchaotic Chen system [27] is described as follows:
u ˙ = a ( v u ) + p , v ˙ = d u + c v u w , w ˙ = b w + u v , p ˙ = r p + v w ,
where u ,   v ,   w and p are state variables and a ,   b ,   c ,   d and r are real parameters. Assume that ( u 0 ,   v 0 ,   w 0 ,   p 0 ) is one equilibrium point in system (1). For convenience, by moving the equilibrium to the origin, system (1) can be written as
x ˙ 1 = a x 1 + a x 2 + x 4 , x ˙ 2 = α x 1 + c x 2 u 0 x 3 x 1 x 3 , x ˙ 3 = v 0 x 1 + u 0 x 2 b x 3 + x 1 x 2 , x ˙ 4 = w 0 x 2 + v 0 x 3 + r x 4 + x 2 x 3 ,
where x 1 = u u 0 , x 2 = v v 0 , x 3 = w w 0 , x 4 = p p 0 , and α = d w 0 . System (2) is chosen as the drive system. The response system is given as:
y ˙ 1 = a y 1 + a y 2 + y 4 + k 1 ( x 1 ( t τ ) y 1 ) , y ˙ 2 = α y 1 + c y 2 u 0 y 3 y 1 y 3 + k 2 ( x 2 ( t τ ) y 2 ) , y ˙ 3 = v 0 y 1 + u 0 y 2 b y 3 + y 1 y 2 + k 3 ( x 3 ( t τ ) y 3 ) , y ˙ 4 = w 0 y 2 + v 0 y 3 + r y 4 + y 2 y 3 + k 4 ( x 4 ( t τ ) y 4 ) ,
where y 1 , 2 , 3 , 4 are state variables, k 1 ,   2 ,   3 ,   4 are coupling strengths and τ is the time delay in signal transmission between systems (2) and (3). LS in systems (2) and (3) is reached if
| | y i x i ( t τ ) | | 0 , i = 1 ,   2 ,   3 ,   4 ,   f o r t .

3. The Synchronization Condition for Exact LS between Systems (2) and (3)

Condition (4) is a functional relation between y i and x i , i = 1 ,   2 ,   3 ,   4 . Then, LS between systems (2) and (3) can be regarded as a special type of GS between them, which can be investigated by using the auxiliary system approach [28]. The auxiliary system corresponding to systems (2) and (3) is given by
z ˙ 1 = a z 1 + a z 2 + z 4 + k 1 ( x 1 ( t τ ) z 1 ) , z ˙ 2 = α z 1 + c z 2 u 0 z 3 z 1 z 3 + k 2 ( x 2 ( t τ ) z 2 ) , z ˙ 3 = v 0 z 1 + u 0 z 2 b z 3 + z 1 z 2 + k 3 ( x 3 ( t τ ) z 3 ) , z ˙ 4 = w 0 z 2 + v 0 z 3 + r z 4 + z 2 z 3 + k 4 ( x 4 ( t τ ) z 4 ) ,
where z 1 , 2 , 3 , 4 are state variables. The following condition is necessary to obtain condition (4):
| | y i z i | | 0 , i = 1 , 2 , 3 , 4 , f o r t .
By letting
e i = y i z i 2 , e i + 4 = y i + z i 2 , i = 1 , 2 , 3 , 4 ,
the synchronization error system for condition (6) can be given as
e ˙ 1 = ( k 1 + a ) e 1 + a e 2 + e 4 , e ˙ 2 = α e 1 + ( c k 2 ) e 2 u 0 e 3 e 1 e 7 e 3 e 5 , e ˙ 3 = v 0 e 1 + u 0 e 2 ( b + k 3 ) e 3 + e 1 e 6 + e 2 e 5 , e ˙ 4 = w 0 e 2 + v 0 e 3 + ( r k 4 ) e 4 + e 2 e 7 + e 3 e 6 .
Condition (6) becomes
| | e i | | 0 , i = 1 , 2 , 3 , 4 , f o r t .
Consider the Laplace transform, defined as follows:
E i ( s ) = L [ e i ] = 0 + e i ( t ) e s t d t , e i ( t ) = L 1 [ E i ] = 1 2 π j σ j σ + j E i ( s ) e s t d s , i = 1 , 2 , 3 , 4 .
By taking the Laplace transform on both sides of system (7), it yields
s I 4 M E 1 E 2 E 3 E 4 = e 10 W 1 + e 20 W 2 + e 30 W 3 + e 40
where e 0 i , i = 1 ,   2 ,   3 ,   4 are the given initial values for system (7), I 4 is the 4 × 4 identity real matrix,
M = k 1 a a 0 1 α c k 2 u 0 0 v 0 u 0 b k 3 0 0 w 0 v 0 r k 4
and W i , i = 1 ,   2 ,   3 are the Laplace transform of the nonlinear parts in the last three equations in system (7), respectively,
W 1 = 0 + [ e 1 e 7 + e 3 e 5 ] e s t d t , W 2 = 0 + [ e 1 e 6 + e 2 e 5 ] e s t d t , W 3 = 0 + [ e 2 e 7 + e 3 e 6 ] e s t d t .
Solving Equation (10) by using Cramer’s rule, one has
E 1 = 1 D ( s ) e 10 a 0 1 W 1 + e 20 c k 2 u 0 0 W 2 + e 30 u 0 b k 3 0 W 3 + e 40 w 0 v 0 r k 4 , E 2 = 1 D ( s ) k 1 a e 10 0 1 α W 1 + e 20 u 0 0 v 0 W 2 + e 30 b k 3 0 0 W 3 + e 40 v 0 r k 4 , E 3 = 1 D ( s ) k 1 a a e 10 1 α c k 2 W 1 + e 20 0 v 0 u 0 W 2 + e 30 0 0 w 0 W 3 + e 40 r k 4 ,
E 4 = 1 D ( s ) k 1 a a 0 e 10 α c k 2 u 0 W 1 + e 20 v 0 u 0 b k 3 W 2 + e 30 0 w 0 v 0 W 3 + e 40 ,
where
D ( s ) = s 4 + β 1 s 3 + β 2 s 2 + β 3 s + β 4 ,
β 1 = a + b c k r , β 2 = b α c r a c + k + r b + k + r c + k r + u 0 2 , β 3 = a k r u 0 2 + a u 0 v 0 + ( α + c ) r α + c + r b a + c k + r c + k r b k r c α w 0 v 0 2 , β 4 = r k a u 0 2 + w 0 a r α u 0 v 0 + c v 0 2 + α + c a b r k r c + α w 0 b .
D ( s ) is just the characteristic polynomial of matrix (11). In fact, we do not need to know the actual formulas of the numerators of E i , i = 1 ,   2 ,   3 ,   4 . They must have the following forms:
E i = h i 0 ( s ) D ( s ) + j = 1 3 h i j ( s ) D ( s ) W j , i = 1 ,   2 ,   3 ,   4 ,
in which h i j ( s ) ( i = 1 ,   2 ,   3 ,   4 , j = 0 ,   1 ,   2 ,   3 ) are polynomials of s whose orders are less than four. Taking the inverse Laplace transform for E i , i = 1 ,   2 ,   3 ,   4 and considering the convolution theorem in the Laplace transform produces
e i = γ i 0 ( t ) 0 t γ i 1 ( t τ ) [ e 1 e 7 + e 3 e 5 ] d τ + 0 t γ i 2 ( t τ ) [ e 1 e 6 + e 2 e 5 ] d τ + 0 t γ i 3 ( t τ ) [ e 2 e 7 + e 3 e 6 ] d τ , i = 1 ,   2 ,   3 ,   4 ,
where γ i j ( t ) = L 1 [ h i j ( s ) D ( s ) ] , i = 1 ,   2 ,   3 ,   4 and j = 0 ,   1 ,   2 ,   3 . If the denominator D ( s ) in Equation (14) can be decomposed into D ( s ) = Q 1 ( s ) Q 2 ( s ) , and Q 1 , 2 have no common factors, then h i j ( s ) / D ( s ) , i { 1 ,   2 ,   3 ,   4 } , j { 0 ,   1 ,   2 ,   3 } can be decomposed into
h i j ( s ) D ( s ) = h ¯ i j ( s ) Q 1 ( s ) + h ^ i j ( s ) Q 2 ( s ) , i { 1 ,   2 ,   3 ,   4 } , j { 0 ,   1 ,   2 ,   3 } ,
where h ¯ i j ( s ) and h ^ i j ( s ) are polynomials of s. Moreover, the highest powers are less than those of Q 1 ( s ) and Q 2 ( s ) . One can continue the process until only the following two classes of functions retain
A 1 ( s ) ( s η 0 ) m , A 2 ( s ) ( s 2 + η 1 s + η 2 ) n ,
in which m { 1 ,   2 ,   3 ,   4 } , n { 1 ,   2 } , η 0 , 1 , 2 R , η 1 2 4 η 2 < 0 and the highest powers of polynomials A 1 , 2 are less than m and n, respectively. Consider the inverse Laplace transform in the following three cases:
  • A 1 ( s ) ( s η 0 ) m = B 1 s η 0 + B 2 ( s η 0 ) 2 + + B m ( s η 0 ) m ,
    where B ( m i ) = 1 i ! d i d s i [ A 1 ( s ) ( s η 0 ) m ( s η 0 ) m ] | s = η 0 , i = 1 ,   2 , ,   m 1 ,
    B m = [ A 1 ( s ) ( s η 0 ) m ( s η 0 ) m ] | s = η 0 ,
    L 1 [ A 1 ( s ) ( s η 0 ) m ] = ( B 1 + B 2 t + B 3 t 2 + + B m t m 1 ) e η 0 t
  • A 2 ( s ) s 2 + η 1 s + η 2 = A 2 ( s ) ( s ω 1 j ω 2 ) ( s ω 1 + j ω 2 ) = B 1 s ω 1 j ω 2 + B 2 s ω 1 + j ω 2 ,
    where B 1 , 2 = A 2 ( s ) 2 s + η 1 | s = ω 1 ± j ω 2 ,
    L 1 [ A 2 ( s ) s 2 + η 1 s + η 2 ] = B 1 e ( ω 1 + j ω 2 ) t + B 2 e ( ω 1 j ω 2 ) t
  • A 2 ( s ) ( s 2 + η 1 s + η 2 ) 2 = B 1 ( s ω 1 j ω 2 ) 2 + B 2 s ω 1 j ω 2 + B 3 ( s ω 1 + j ω 2 ) 2 + B 4 s ω 1 + j ω 2 ,
    where B 1 , 3 = A 2 ( s ) s 2 + η 1 s + η 2 ( s ω 1 ± j ω 2 ) 2 | s = ω 1 ± j ω 2 ,
    B 2 , 4 = d d s [ A 2 ( s ) s 2 + η 1 s + η 2 ( s ω 1 ± j ω 2 ) 2 ] | s = ω 1 ± j ω 2 ,
    L 1 [ A 2 ( s ) ( s 2 + η 1 s + η 2 ) 2 ] = ( B 1 t + B 2 ) e ( ω 1 + j ω 2 ) t + ( B 3 t + B 4 ) e ( ω 1 j ω 2 ) t
From Equation (15), the necessary conditions for | | e i | | 0 , i = 1 , 2 , 3 , 4 are γ i j ( t ) 0 , i { 1 , 2 , 3 , 4 } and j { 0 , 1 , 2 , 3 } . According to the above analysis for the inverse Laplace transform, all eigenvalues of matrix (11) should have negative real parts. Under such conditions, when t 0 system (15) becomes
e i = 0 t γ i 1 ( t τ ) [ e 1 e 7 + e 3 e 5 ] d τ + 0 t γ i 2 ( t τ ) [ e 1 e 6 + e 2 e 5 ] d τ + 0 t γ i 3 ( t τ ) [ e 2 e 7 + e 3 e 6 ] d τ , i = 1 ,   2 ,   3 ,   4 .
Actually, these are a set of Volterra integral equations in system (16) that can be solved based on the successive approximation method [30]. For the sake of clarity, we briefly introduce the successive approximation method below. Consider the integral equation of the following form
y ( t ) = Φ ( t ) + 0 t g ( t τ ) h ( τ , y ( τ ) ) d τ ,
where g is an n × n matrix; Φ ( t ) and h ( t , y ( t ) ) are vectors with n components. If the following conditions are satisfied, then Equation (17) has a unique continuous solution:
  • | y | < ;
  • Φ and h are continuous for 0 < t < t 0 , in which 0 < t 0 < + ;
  • | g | L [ 0 , ϵ ] holds for any 0 < ϵ < t 0 ;
  • For any ξ > 0 , if | y 1 y 2 |   < ξ there must exist a constant ϵ > 0 such that | h ( t , y 1 ) h ( t , y 2 ) |   < ϵ .
Moreover, the following successive approximations
ω 0 ( t ) = 0 , ω n + 1 ( t ) = Φ ( t ) + 0 t g ( t τ ) h ( τ , ω n ( τ ) ) d τ , n = 0 ,   1 ,   2 ,  
will uniformly converge to the unique continuous solution to Equation (17).
It is clear that the functions and parameters in Equation (16) satisfy the assumptions for Equation (17). Then, Equation (16) has the unique continuous solution e i = 0 , i = 1 ,   2 ,   3 ,   4 .
Remark 1.
The steps required to derive the synchronization condition for CS between systems (3) and (5) are listed below:
  • System (7) is obtained with variable substitution;
  • Through the Laplace transform and the convolution theorem, system (7) is converted into a set of Volterra integral equations (system(15)), which can be further simplified to Equation (16) based on the convergence requirement;
  • The successive approximation method [30] is used to solve Equation (16). Then, the synchronization condition for CS between systems (3) and (5) is determined.
Remark 2.
The condition that all roots of D ( s ) defined in Equation (13) have negative real parts guarantees the occurrence of CS between systems (3) and (5). D ( s ) is the characteristic polynomial of matrix (11). From the auxiliary system approach, under such conditions the functional relationship y i = x i ( t τ ) , i = 1 ,   2 ,   3 ,   4 will be achieved between systems (2) and (3).
Remark 3.
According to the Routh–Hurwitz criteria, the necessary and sufficient condition that all roots of D ( s ) have negative real parts can be written as
β 1 > 0 , β 3 > 0 , β 4 > 0 , a n d β 1 β 2 β 3 > β 3 2 + β 1 2 β 4 .
In particular, if u 0 = v 0 = w 0 = p 0 = 0 , Equation (13) becomes
D ( s ) = [ s 2 + ( k 1 + k 2 c + a ) s + ( k 1 + a ) ( k 2 c ) a d ] ( s + k 3 + b ) ( s + k 4 r ) .
Condition (19) can be written as:
k 1 + k 2 > a c , ( k 1 + a ) ( k 2 c ) a d > 0 , k 3 < b , a n d k 4 > r .
Remark 4.
The time delay τ has nothing to do with conditions (19) or (21), which implies that the synchronization condition obtained in this paper is effective for any value of τ. In the next section, we numerically verify the effectiveness of condition (21).

4. Numerical Simulations

In this section, numerical simulations are carried out to verify the effectiveness of the criterion obtained in the previous section for the appearance of LS between systems (2) and (3). When a = 35 , b = 3 , c = 12 , d = 7 and 0 r 0.085 , system (1) is chaotic; when a = 35 , b = 3 , c = 12 , d = 7 and 0.085 < r 0.798 , system (1) is hyperchaotic; and when a = 35 , b = 3 , c = 12 , d = 7 and 0.798 < r 0.90 , system (1) is periodic. In the following, we consider the hyperchaotic case. By calculation, when a = 35 , b = 3 , c = 12 , d = 7 and 0.085 < r 0.798 , the hyperchaotic Chen system (1) only has one equilibrium ( 0 ,   0 ,   0 ,   0 ) .
In the following simulations, the parameters in systems (2), (3) and (5) are taken as a = 35 , b = 3 , c = 12 , d = 7 and r = 0.5 . From condition (21), the functional relationship y i = x i ( t τ ) , i = 1 ,   2 ,   3 ,   4 between systems (2) and (3) can be achieved if one chooses k 1 = 0 , k 2 = 19 , k 3 = 2 and k 4 = 0.6 . The numerical results are presented in Figure 1, Figure 2, Figure 3 and Figure 4 for different values of the time delay τ , where the initial conditions are taken as x 1 ( τ ,   0 ] = 0.1 ; x 2 ( τ ,   0 ] = 0.2 ; x 3 ( τ ,   0 ] = 0.3 ; x 4 ( τ ,   0 ] = 0.4 ; y 1 ( τ ,   0 ] = 0.2 ; y 2 ( τ ,   0 ] = 0.2 ; y 3 ( τ ,   0 ] = 0.3 ; y 4 ( τ ,   0 ] = 0.4 ; z 1 ( τ , 0 ] = 0.3 ; z 2 ( τ ,   0 ] = 0.4 ; z 3 ( τ ,   0 ] = 0.3 ; and z 4 ( τ ,   0 ] = 0.4 . It is depicted that the synchronization errors y i z i , i = 1 ,   2 ,   3 ,   4 between systems (3) and (5) approach zero and the functional relation y i = x i ( t τ ) , i = 1 ,   2 ,   3 ,   4 between systems (2) and (3) can be achieved for different values of the time delay: τ = 0 , 0.2 , 1 and 2, respectively. The time delay in the signal transmission results in the transition from CS to LS between two hyperchaotic Chen systems under condition (21). In fact, the synchronization condition obtained in this paper for exact LS between systems (2) and (3) is not involved with the value of τ . We show in Figure 5 that even if the value of τ is extremely large, exact LS between systems (2) and (3) still can be achieved, where the initial conditions remain as those in Figure 1, Figure 2, Figure 3 and Figure 4.

5. The Approximation of LS between Two Hyperchaotic Chen Systems without Time-Delay Coupling

The synchronization condition for exact LS between two unidirectionally coupled hyperchaotic Chen systems with time-delay coupling serves as the foundation to realize approximate LS between two unidirectionally coupled hyperchaotic Chen systems without time-delay coupling. Synchronization condition (21) is valid for any value of the time delay. Under such conditions, we replace the time-delay terms in Equation (3) with their Taylor expansions to achieve approximate LS between Equations (2) and (3).
Near τ = 0 , y i = x i ( x τ ) , i = 1 ,   2 ,   3 ,   4 , can be approximately expanded as
x i ( t τ ) = x i ( t ) d x i d t τ + 1 2 ! d 2 x i d t 2 τ 2 1 3 ! d 3 x i d t 3 τ 3 + O ( τ 3 ) , i = 1 ,   2 ,   3 ,   4 ,
where O ( τ 3 ) represents the higher order terms of τ . It is theoretically possible that Equation (22) holds for any value of τ . To demonstrate the feasibility of approximate LS, we define the following function of τ :
H i ( τ ) = x i ( t ) d x i d t τ + 1 2 ! d 2 x i d t 2 τ 2 1 3 ! d 3 x i d t 3 τ 3 , i = 1 ,   2 ,   3 ,   4 .
H i ( τ ) is the truncation up to the third order of each x i ( t τ ) in Equation (22), i = 1 ,   2 ,   3 ,   4 . From system (2), one has
d x 1 d t = a x 1 + a x 2 + x 4 , d 2 x 1 d t 2 = a x 3 + a 2 + a d x 1 + a 2 + a c + x 3 x 2 + a + r x 4 , d 3 x 1 d t 3 = a x 2 x 1 2 + x 2 2 x 3 2 + 2 a 2 + a b a c + d x 3 a 2 + a d a + a 2 + a c d x 1 + a 2 a b + c + r x 3 + a 2 + a d a + a 2 + a c c x 2 a x 4 x 3 + a 2 + a d + a + r r x 4 ,
d x 2 d t = c x 2 + d x 1 x 1 x 3 , d 2 x 2 d t 2 = c c x 2 + d x 1 x 1 x 3 + ( d x 3 ) a x 1 + a x 2 + x 4 x 1 b x 3 + x 1 x 2 , d 3 x 2 d t 3 = c c c x 2 + d x 1 x 1 x 3 + ( d x 3 ) a x 1 + a x 2 + x 4 x 1 b x 3 + x 1 x 2 + ( d x 3 ) a a x 1 + a x 2 + x 4 + a c x 2 + d x 1 x 1 x 3 + r x 4 + x 3 x 2 2 a x 1 + a x 2 + x 4 b x 3 + x 1 x 2 x 1 ( b b x 3 + x 1 x 2 + a x 1 + a x 2 + x 4 x 2 + x 1 c x 2 + d x 1 x 1 x 3 ) ,
d x 3 d t = b x 3 + x 1 x 2 , d 2 x 3 d t 2 = b b x 3 + x 1 x 2 + a x 1 + a x 2 + x 4 x 2 + x 1 c x 2 + d x 1 x 1 x 3 , d 3 x 3 d t 3 = b b b x 3 + x 1 x 2 + a x 1 + a x 2 + x 4 x 2 + x 1 c x 2 + d x 1 x 1 x 3 + a a x 1 + a x 2 + x 4 + a c x 2 + d x 1 x 1 x 3 + r x 4 + x 2 x 3 x 2 + 2 a x 1 + a x 2 + x 4 c x 2 + d x 1 x 1 x 3 + x 1 ( c c x 2 + d x 1 x 1 x 3 + d a x 1 + a x 2 + x 4 a x 1 + a x 2 + x 4 x 3 x 1 b x 3 + x 1 x 2 ) ,
d x 4 d t = r x 4 + x 2 x 3 , d 2 x 4 d t 2 = r r x 4 + x 2 x 3 + c x 2 + d x 1 x 1 x 3 x 3 + x 2 b x 3 + x 1 x 2 , d 3 x 4 d t 3 = 4 x 3 + 3 d x 2 x 1 2 + ( r + 3 c a b x 2 2 + r c + a + 3 b x 3 2 + a d 2 d b + c d + r d x 3 ) x 1 + a x 2 3 + x 4 x 2 2 x 4 x 3 2 + d x 4 x 3 + r 3 x 4 + a x 3 2 + r b + c + r + a d + c 2 2 c b + b 2 x 3 x 2 ,
Replacing the time-delay terms in Equation (3) with x i ( t τ ) = H i ( τ ) , i = 1 ,   2 , 3   ,   4 , yields
y ˙ 1 = a y 1 + a y 2 + y 4 + k 1 ( H 1 ( τ ) y 1 ) , y ˙ 2 = α y 1 + c y 2 u 0 y 3 y 1 y 3 + k 2 ( H 2 ( τ ) y 2 ) , y ˙ 3 = v 0 y 1 + u 0 y 2 b y 3 + y 1 y 2 + k 3 ( H 3 ( τ ) y 3 ) , y ˙ 4 = w 0 y 2 + v 0 y 3 + r y 4 + y 2 y 3 + k 4 ( H 4 ( τ ) y 4 ) .
Next, we investigate approximate LS between Equations (2) and (28) involving no time-delay terms. For convenience, we choose the following auxiliary system:
z ˙ 1 = a z 1 + a z 2 + z 4 + k 1 ( H 1 ( τ ) z 1 ) , z ˙ 2 = α z 1 + c z 2 u 0 z 3 z 1 z 3 + k 2 ( H 2 ( τ ) z 2 ) , z ˙ 3 = v 0 z 1 + u 0 z 2 b z 3 + z 1 z 2 + k 3 ( H 3 ( τ ) z 3 ) , z ˙ 4 = w 0 z 2 + v 0 z 3 + r z 4 + z 2 z 3 + k 4 ( H 4 ( τ ) z 4 ) .
By using the method presented in the previous section, GS between systems (2) and (28) with the functional relation y i = H i ( τ ) , i = 1 ,   2 ,   3 ,   4 can be achieved under condition (19). As long as H i approaches x i ( t τ ) , i = 1 ,   2 ,   3 ,   4 , the GS between systems (2) and (28) means approximate LS between them. Numerical simulations are carried out to verify the conclusion, where the parameters remain the same as those in Figure 1, Figure 2, Figure 3, Figure 4 and Figure 5, and the initial conditions are taken as x 1 ( 0 ) = 0.1 ; x 2 ( 0 ) = 0.2 ; x 3 ( 0 ) = 0.3 ; x 4 ( 0 ) = 0.4 ; y 1 ( 0 ) = 0.2 ; y 2 ( 0 ) = 0.2 ; y 3 ( 0 ) = 0.3 ; y 4 ( 0 ) = 0.4 ; z 1 ( 0 ) = 0.3 ; z 2 ( 0 ) = 0.4 ; z 3 ( 0 ) = 0.3 ; and y 4 ( 0 ) = 0.4 . The numerical results are shown in Figure 6, Figure 7, Figure 8 and Figure 9, in which the values of τ are chosen as τ = 0.02 , 0.05 , 0.1 and 0.15 , respectively. It is shown that for different values of τ , GS always occurs between systems (2) and (28). If τ is very small (Figure 6b and Figure 7b), LS can be approximately reached between systems (2) and (28). With the increase in τ , approximate LS between systems (2) and (28) is destroyed (Figure 8b and Figure 9b) because H i no longer approaches x i ( t τ ) , i = 1 ,   2 ,   3 ,   4 . More higher order terms of τ need to be added into Equation (23) to keep approximate LS between systems (2) and (28). Figure 6, Figure 7, Figure 8 and Figure 9 indicate that it is feasible to approximately reconstruct the past signals of a hyperchaotic Chen system by using its current signals.

6. The Approximation of AS between Two Hyperchaotic Chen Systems without Time-Delay Coupling

Consider system (2) as the drive system; systems (28) and (29) are the response and auxiliary systems, respectively. Now, we consider τ < 0 in the function H i ( τ ) , i = 1 ,   2 ,   3 ,   4 as performing the numerical simulations, where all other parameters and the initial conditions remain the same as those in the case of τ > 0 . The numerical results are depicted in Figure 10, Figure 11, Figure 12 and Figure 13, in which the values of τ are chosen as τ = 0.02 , 0.05 , 0.1 and 0.15 , respectively. It is clear that GS still appears between systems (2) and (28) for different values of τ under condition (21). If τ approaches 0 (Figure 10b and Figure 11b), AS can be approximately achieved between systems (2) and (28). With the decrease in τ , the approximation begins to disappear (Figure 12b and Figure 13b). To maintain approximate AS between systems (2) and (28), more higher order terms of τ need to be added into H i ( τ ) , i = 1 ,   2 ,   3 ,   4 in Equation (23). Figure 10, Figure 11, Figure 12 and Figure 13 imply that it is feasible to approximately predict the future signals of a hyperchaotic Chen system by using its current signals.

7. Conclusions

In this paper, approximate LS and AS in two unidirectionally coupled hyperchaotic Chen systems without time-delay coupling are analytically investigated. Firstly, the synchronization condition for exact LS between two unidirectionally coupled hyperchaotic Chen systems with time delay in signal transmission is obtained. Differently from other studies, LS is viewed as a special type of GS, which can be analyzed by using the auxiliary system approach. Based on the Laplace transform and the successive approximation method, the synchronization condition for exact LS is analytically obtained, and its effectiveness is verified using numerical simulations. Our analysis shows that the condition for exact LS is valid for any value of the time delay in signal transmission. Under such conditions, approximate LS and AS in two unidirectionally coupled hyperchaotic Chen systems without time-delay coupling are discussed by replacing the true time-delay terms with their Taylor expansions up to the third order. For a small time delay, the approximate LS and AS are precise enough. Our research indicates the possibility of recreating the past signals or predicting the future signals of a hyperchaotic Chen system using its current signals.
In previous research studies, the true time-delay terms are first replaced by using their first-order approximations. Then, synchronization conditions for approximate LS and AS are discussed by considering two chaotic systems with parameter mismatch. The lag and anticipation time of approximate LS and AS have to be involved in the synchronization condition, which are difficult to change within a wide range. In our study, the synchronization condition for exact LS between the drive and response systems with time-delay coupling is firstly obtained, which has nothing to do with the time delay. That is, the condition for exact LS is valid for any value of the time delay. Then, the value of the lag and anticipation time in approximate LS and AS can be individually varied. It is theoretically possible that any value of the lag and anticipation time in approximate LS and AS can be reached as long as there are enough truncated terms in Equation (23). The calculation of terms, of course, is tedious with the increase in truncated terms. In addition, it will become difficult to physically realize such a controller in the real world [31,32]. This is the disadvantage of the proposed scheme achieving approximate LS and AS between two undirectionally coupled hyperchaotic Chen systems without time-delay coupling.
Our research provides a simple and effective way to achieve approximate LS and AS between two hyperchaotic systems without time-delay coupling, which can be applied to eliminate the negative effects of the time delay in signal transmission.

Author Contributions

Conceptualization, L.-J.O. and B.-Q.X.; methodology, B.D.; software, B.-Q.X.; validation, B.-Q.X.; formal analysis, L.-J.O.; investigation, B.D.; resources, B.D.; data curation, B.-Q.X.; writing—original draft preparation, L.-J.O.; writing—review and editing, B.D.; visualization, B.-Q.X.; supervision, B.D.; project administration, B.D.; funding acquisition, B.D. All authors have read and agreed to the published version of the manuscript.

Funding

The Zhejiang Provincial Natural Science Foundation of China (Nos:LY20E080017), the National Natural Science Foundation of China (Nos:51708349) and the Service Innovation Project of the Wenzhou Association for Science and Technology, China. (Grant No.KJFW53).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The study did not report any data.

Acknowledgments

The authors greatly appreciate the anonymous referees for their valuable suggestions and questions.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Uchida, A.; Rogister, F.; García-Ojalvo, J.; Roy, R. Synchronization and communication with chaotic laser systems. Prog. Opt. 2005, 48, 203–341. [Google Scholar] [CrossRef]
  2. Li, Y.N.; Chen, L.; Cai, Z.S.; Zhao, X. Experimental study of chaos synchronization in the Belousov–Zhabotinsky chemical system. Chaos Solitons Fractals 2004, 22, 767–771. [Google Scholar] [CrossRef]
  3. Uhlhaas, P.J.; Singer, W. Neural synchrony in brain disorders: Relevance for cognitive dysfunctions and pathophysiology. Neuron 2006, 52, 155–168. [Google Scholar] [CrossRef] [PubMed]
  4. Carroll, T.L.; Perora, L.M. Synchronization in chaotic systems. Phys. Rev. Lett. 1990, 64, 821–824. [Google Scholar] [CrossRef]
  5. Wang, P.; Wen, G.; Yu, X.; Yu, W.; Huang, T. Synchronization of multi-layer networks: From node-to-node synchronization to complete synchronization. IEEE Trans Circuits Syst. 2018, 66, 1141–1152. [Google Scholar] [CrossRef]
  6. Fatemeh, P.; Mohadeseh, S.K.; Yaser, M.; Karthikeyan, R.; Sajad, J. Complete and partial synchronization in empirical brain networks. Int. J. Electron. Commun. (AEU) 2023, 170, 154863. [Google Scholar] [CrossRef]
  7. Hoon, Y.; Mohd, R.M.; Mohd, Z.M.; Zawawi, M. Shunt active power filter: A review on phase synchronization control techniques. Electronics 2019, 8, 791. [Google Scholar] [CrossRef]
  8. Sun, W.; Wang, S.; Wang, G.; Wu, Y. Lag synchronization via pinning control between two coupled networks. Nonlinear Dyn. 2015, 79, 2659–2666. [Google Scholar] [CrossRef]
  9. Mihana, T.; Fujii, K.; Kanno, K.; Naruse, M.; Uchida, A. Laser network decision making by lag synchronization of chaos in a ring configuration. Opt. Express 2020, 28, 40112–40130. [Google Scholar] [CrossRef]
  10. Long, C.; Zhang, G.; Zeng, Z.; Hu, J. Finite-time lag synchronization of inertial neural networks with mixed infinite time-varying delays and state-dependent switching. Neurocomputing 2021, 433, 50–58. [Google Scholar] [CrossRef]
  11. Ibrahim, M.M.; Kamran, M.A.; Mannan, M.M.N.; Jung, I.H.; Kim, S. Lag synchronization of coupled time-delayed Fitzhugh–Nagumo neural networks via feedback control. Sci. Rep. 2021, 11, 1–15. [Google Scholar] [CrossRef] [PubMed]
  12. Rasa, S.; Loreta, S.; Minvydas, R. Detection of lag synchronization based on matrices of delayed differences. Commun. Nonlinear Sci. Numer. Simul. 2023, 116, 106864. [Google Scholar] [CrossRef]
  13. Ahmadlou, M.; Adeli, H. Visibility graph similarity: A new measure of generalized synchronization in coupled dynamic systems. Physica D 2012, 241, 326–332. [Google Scholar] [CrossRef]
  14. Wu, Z.; Zhang, X.; Zhong, X. Generalized chaos synchronization circuit simulation and asymmetric image encryption. IEEE Access 2019, 7, 37989–38008. [Google Scholar] [CrossRef]
  15. Ciszak, M.; Mayol, C.; Mirasso, C.R.; Toral, R. Anticipated synchronization in coupled complex Ginzburg-Landau systems. Phys. Rev. E 2015, 92, 032911. [Google Scholar] [CrossRef] [PubMed]
  16. Emad, E.; Mahmoud, M.; Higazy, T.M.; Al, H. A New Nine-Dimensional Chaotic Lorenz System with Quaternion Variables: Complicated Dynamics, Electronic Circuit Design, Anti-Anticipating Synchronization, and Chaotic Masking Communication Application. Mathematics 2019, 7, 877. [Google Scholar] [CrossRef]
  17. Srinivasan, K.; Sivaganesh, G.; Fonzin, F.T.; Raja, M.I. Analytical studies on complete, lag and anticipation synchronization in cascaded circuits with numerical and experimental confirmation. Int. J. Electron. Commun. (AEU) 2023, 159, 154491. [Google Scholar] [CrossRef]
  18. Thang, M.H.; Sanjay, K.P.; Sayan, M.; Santo, B. Synchronization and secure communication in time delayed semiconductor laser systems. Optik 2016, 127, 10930–10947. [Google Scholar] [CrossRef]
  19. Kamal, F.; Elsonbaty, A.; Elsaid, A. A novel fractional nonautonomous chaotic circuit model and its application to image encryption. Chaos Solitons Fractals 2021, 144, 110686. [Google Scholar] [CrossRef]
  20. Voss, H.U. Anticipating chaotic synchronization. Phys. Rev. 2000, 61, 5115. [Google Scholar] [CrossRef]
  21. Voss, H.U. Dynamic long-term anticipation of chaotic states. Phys. Rev. Lett. 2001, 87, 014102. [Google Scholar] [CrossRef] [PubMed]
  22. Masoller, A.P.C. Anticipation in the synchronization of chaotic semiconductor lasers with optical feedback. Phys. Rev. Lett. 2001, 86, 2782. [Google Scholar] [CrossRef] [PubMed]
  23. Pyragiene, T.; Pyragas, K. Anticipating synchronization in a chain of chaotic oscillators with switching parameters. Phys. Lett. 2015, 379, 3084–3088. [Google Scholar] [CrossRef]
  24. Mousa, S.K.; Al Naimee, K.A. Experimental investigations of Synchronization in two optically coupled chaotic systems utilizing optical feedback and optical injection. J. Univ. Anbar Pure Sci. 2017, 11, 49–56. [Google Scholar] [CrossRef]
  25. Blakely, J.N.; Stahl, M.T.; Corron, N.J. Time-shifted synchronization of chaotic oscillator chains without explicit coupling delays. Chaos 2009, 19, 043117. [Google Scholar] [CrossRef] [PubMed]
  26. Corron, N.J.; Blakely, J.N.; Pethel, S.D. Lag and anticipating synchronization without time-delay coupling. Chaos 2005, 15, 023110. [Google Scholar] [CrossRef]
  27. Smaoui, N.; Karouma, A.; Zribi, M. Secure communications based on the synchronization of the hyperchaotic Chen and the unified chaotic systems. Commun. Nonlinear Sci. Numer. Simul. 2011, 16, 3279–3293. [Google Scholar] [CrossRef]
  28. Abarbanel, H.D.I.; Rulkov, N.F.; Suschik, M.M. Generalized synchronization of chaos: The auxiliary system approach. Phys. Rev. E 1996, 53, 4528–4535. [Google Scholar] [CrossRef]
  29. Bin, Z.; Ran, L. The study of generalized synchronization between two identical neurons based on the Laplace transform method. Appl. Sci. 2021, 11, 11774. [Google Scholar] [CrossRef]
  30. Nohel, J.A. Some problems in nonlinear Volterra integral equations. Bull. Am. Math. Soc. 1962, 68, 323–330. [Google Scholar] [CrossRef]
  31. Roman, R.C.; Precup, R.E.; Petriu, E.M. Hybrid data-driven fuzzy active disturbance rejection control for tower crane systems. Eur. J. Control 2021, 58, 373–387. [Google Scholar] [CrossRef]
  32. Chi, R.H.; Li, H.Y.; Shen, D.; Hou, Z.S.; Huang, B. Enhanced P-type control: Indirect adaptive learning rrom set-point updates. IEEE Trans. Autom. Control 2023, 68, 1600–1613. [Google Scholar] [CrossRef]
Figure 1. (a) Synchronization errors between systems (3) and (5); (b) the time series of x i , y i , i = 1 ,   2 ,   3 ,   4 in systems (2) and (3) with k 1 = 0 , k 2 = 19 , k 3 = 2 , k 4 = 0.6 and τ = 0 .
Figure 1. (a) Synchronization errors between systems (3) and (5); (b) the time series of x i , y i , i = 1 ,   2 ,   3 ,   4 in systems (2) and (3) with k 1 = 0 , k 2 = 19 , k 3 = 2 , k 4 = 0.6 and τ = 0 .
Applsci 13 11949 g001
Figure 2. (a) Synchronization errors between systems (3) and (5); (b) the time series of x i , y i , i = 1 ,   2 ,   3 ,   4 , in systems (2) and (3) with k 1 = 0 , k 2 = 19 , k 3 = 2 , k 4 = 0.6 and τ = 0.2 .
Figure 2. (a) Synchronization errors between systems (3) and (5); (b) the time series of x i , y i , i = 1 ,   2 ,   3 ,   4 , in systems (2) and (3) with k 1 = 0 , k 2 = 19 , k 3 = 2 , k 4 = 0.6 and τ = 0.2 .
Applsci 13 11949 g002
Figure 3. (a) Synchronizationerrors between systems (3) and (5); (b) The time series of x i , y i , i = 1 ,   2 ,   3 ,   4 , in systems (2) and (3) with k 1 = 0 , k 2 = 19 , k 3 = 2 , k 4 = 0.6 , τ = 1 .
Figure 3. (a) Synchronizationerrors between systems (3) and (5); (b) The time series of x i , y i , i = 1 ,   2 ,   3 ,   4 , in systems (2) and (3) with k 1 = 0 , k 2 = 19 , k 3 = 2 , k 4 = 0.6 , τ = 1 .
Applsci 13 11949 g003
Figure 4. (a) Synchronization errors between systems (3) and (5); (b) the time series of x i , y i , i = 1 ,   2 ,   3 ,   4 , in systems (2) and (3) with k 1 = 0 , k 2 = 19 , k 3 = 2 , k 4 = 0.6 and τ = 2 .
Figure 4. (a) Synchronization errors between systems (3) and (5); (b) the time series of x i , y i , i = 1 ,   2 ,   3 ,   4 , in systems (2) and (3) with k 1 = 0 , k 2 = 19 , k 3 = 2 , k 4 = 0.6 and τ = 2 .
Applsci 13 11949 g004
Figure 5. (a) Synchronization errors between systems (3) and (5); (b) the time series of x i , y i , i = 1 ,   2 ,   3 ,   4 , in systems (2) and (3) with k 1 = 0 , k 2 = 19 , k 3 = 2 , k 4 = 0.6 and τ = 10 .
Figure 5. (a) Synchronization errors between systems (3) and (5); (b) the time series of x i , y i , i = 1 ,   2 ,   3 ,   4 , in systems (2) and (3) with k 1 = 0 , k 2 = 19 , k 3 = 2 , k 4 = 0.6 and τ = 10 .
Applsci 13 11949 g005
Figure 6. (a) Synchronization errors between systems (28) and (29). (b) The time series of x i and y i , i = 1 ,   2 ,   3 ,   4 in systems (2) and (28) with y i = H i ( τ ) ; i = 1 ,   2 ,   3 ,   4 ; k 1 = 0 ; k 2 = 19 ; k 3 = 2 ; k 4 = 0.6 ; and τ = 0.02 .
Figure 6. (a) Synchronization errors between systems (28) and (29). (b) The time series of x i and y i , i = 1 ,   2 ,   3 ,   4 in systems (2) and (28) with y i = H i ( τ ) ; i = 1 ,   2 ,   3 ,   4 ; k 1 = 0 ; k 2 = 19 ; k 3 = 2 ; k 4 = 0.6 ; and τ = 0.02 .
Applsci 13 11949 g006
Figure 7. (a) Synchronization errors between systems (28) and (29). (b) The time series of x i and y i , i = 1 ,   2 ,   3 ,   4 in systems (2) and (28) with y i = H i ( τ ) ; i = 1 ,   2 ,   3 ,   4 ; k 1 = 0 ; k 2 = 19 ; k 3 = 2 ; k 4 = 0.6 ; and τ = 0.05 .
Figure 7. (a) Synchronization errors between systems (28) and (29). (b) The time series of x i and y i , i = 1 ,   2 ,   3 ,   4 in systems (2) and (28) with y i = H i ( τ ) ; i = 1 ,   2 ,   3 ,   4 ; k 1 = 0 ; k 2 = 19 ; k 3 = 2 ; k 4 = 0.6 ; and τ = 0.05 .
Applsci 13 11949 g007
Figure 8. (a) Synchronization errors between systems (28) and (29). (b) The time series of x i and y i , i = 1 ,   2 ,   3 ,   4 in systems (2) and (28) with y i = H i ( τ ) ; i = 1 ,   2 ,   3 ,   4 ; k 1 = 0 ; k 2 = 19 ; k 3 = 2 ; k 4 = 0.6 ; and τ = 0.1 .
Figure 8. (a) Synchronization errors between systems (28) and (29). (b) The time series of x i and y i , i = 1 ,   2 ,   3 ,   4 in systems (2) and (28) with y i = H i ( τ ) ; i = 1 ,   2 ,   3 ,   4 ; k 1 = 0 ; k 2 = 19 ; k 3 = 2 ; k 4 = 0.6 ; and τ = 0.1 .
Applsci 13 11949 g008
Figure 9. (a) Synchronization errors between systems (28) and (29). (b) The time series of x i and y i , i = 1 ,   2 ,   3 ,   4 in systems (2) and (28) with y i = H i ( τ ) ; i = 1 ,   2 ,   3 ,   4 ; k 1 = 0 ; k 2 = 19 ; k 3 = 2 ; k 4 = 0.6 ; and τ = 0.15 .
Figure 9. (a) Synchronization errors between systems (28) and (29). (b) The time series of x i and y i , i = 1 ,   2 ,   3 ,   4 in systems (2) and (28) with y i = H i ( τ ) ; i = 1 ,   2 ,   3 ,   4 ; k 1 = 0 ; k 2 = 19 ; k 3 = 2 ; k 4 = 0.6 ; and τ = 0.15 .
Applsci 13 11949 g009
Figure 10. (a) Synchronization errors between systems (28) and (29). (b) The time series of x i and y i , i = 1 ,   2 ,   3 ,   4 in systems (2) and (28) with y i = H i ( τ ) ; i = 1 ,   2 ,   3 ,   4 ; k 1 = 0 ; k 2 = 19 ; k 3 = 2 ; k 4 = 0.6 ; and τ = 0.02 .
Figure 10. (a) Synchronization errors between systems (28) and (29). (b) The time series of x i and y i , i = 1 ,   2 ,   3 ,   4 in systems (2) and (28) with y i = H i ( τ ) ; i = 1 ,   2 ,   3 ,   4 ; k 1 = 0 ; k 2 = 19 ; k 3 = 2 ; k 4 = 0.6 ; and τ = 0.02 .
Applsci 13 11949 g010
Figure 11. (a) Synchronization errors between systems (28) and (29). (b) The time series of x i and y i , i = 1 ,   2 ,   3 ,   4 in systems (2) and (28) with y i = H i ( τ ) ; i = 1 ,   2 ,   3 ,   4 ; k 1 = 0 ; k 2 = 19 ; k 3 = 2 ; k 4 = 0.6 ; and τ = 0.05 .
Figure 11. (a) Synchronization errors between systems (28) and (29). (b) The time series of x i and y i , i = 1 ,   2 ,   3 ,   4 in systems (2) and (28) with y i = H i ( τ ) ; i = 1 ,   2 ,   3 ,   4 ; k 1 = 0 ; k 2 = 19 ; k 3 = 2 ; k 4 = 0.6 ; and τ = 0.05 .
Applsci 13 11949 g011
Figure 12. (a) Synchronization errors between systems (28) and (29). (b) The time series of x i and y i , i = 1 ,   2 ,   3 ,   4 in systems (2) and (28) with y i = H i ( τ ) ; i = 1 ,   2 ,   3 ,   4 ; k 1 = 0 ; k 2 = 19 ; k 3 = 2 ; k 4 = 0.6 ; and τ = 0.1 .
Figure 12. (a) Synchronization errors between systems (28) and (29). (b) The time series of x i and y i , i = 1 ,   2 ,   3 ,   4 in systems (2) and (28) with y i = H i ( τ ) ; i = 1 ,   2 ,   3 ,   4 ; k 1 = 0 ; k 2 = 19 ; k 3 = 2 ; k 4 = 0.6 ; and τ = 0.1 .
Applsci 13 11949 g012
Figure 13. (a) Synchronization errors between systems (28) and (29). (b) The time series of x i and y i , i = 1 ,   2 ,   3 ,   4 in systems (2) and (28) with y i = H i ( τ ) ; i = 1 ,   2 ,   3 ,   4 ; k 1 = 0 ; k 2 = 19 ; k 3 = 2 ; k 4 = 0.6 ; and τ = 0.15 .
Figure 13. (a) Synchronization errors between systems (28) and (29). (b) The time series of x i and y i , i = 1 ,   2 ,   3 ,   4 in systems (2) and (28) with y i = H i ( τ ) ; i = 1 ,   2 ,   3 ,   4 ; k 1 = 0 ; k 2 = 19 ; k 3 = 2 ; k 4 = 0.6 ; and τ = 0.15 .
Applsci 13 11949 g013
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

Ouyang, L.-J.; Xie, B.-Q.; Ding, B. Analytical Studies on Approximate Lag and Anticipating Synchronization in Two Unidirectionally Coupled Hyperchaotic Chen Systems without Time Delay. Appl. Sci. 2023, 13, 11949. https://doi.org/10.3390/app132111949

AMA Style

Ouyang L-J, Xie B-Q, Ding B. Analytical Studies on Approximate Lag and Anticipating Synchronization in Two Unidirectionally Coupled Hyperchaotic Chen Systems without Time Delay. Applied Sciences. 2023; 13(21):11949. https://doi.org/10.3390/app132111949

Chicago/Turabian Style

Ouyang, Li-Jun, Bing-Qing Xie, and Bin Ding. 2023. "Analytical Studies on Approximate Lag and Anticipating Synchronization in Two Unidirectionally Coupled Hyperchaotic Chen Systems without Time Delay" Applied Sciences 13, no. 21: 11949. https://doi.org/10.3390/app132111949

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