Next Article in Journal
Research on Pattern Dynamics Behavior of a Fractional Vegetation-Water Model in Arid Flat Environment
Previous Article in Journal
Non-Polynomial Collocation Spectral Scheme for Systems of Nonlinear Caputo–Hadamard Differential Equations
Previous Article in Special Issue
Event-Triggered Adaptive Neural Network Control for State-Constrained Pure-Feedback Fractional-Order Nonlinear Systems with Input Delay and Saturation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Quasi-Projective Synchronization of Discrete-Time Fractional-Order Complex-Valued BAM Fuzzy Neural Networks via Quantized Control

by
Yingying Xu
1,2,
Hongli Li
1,*,
Jikai Yang
1 and
Long Zhang
1
1
College of Mathematics and System Sciences, Xinjiang University, Urumqi 830017, China
2
Institute of Technology, Lanzhou Modern Vocational College, Lanzhou 730300, China
*
Author to whom correspondence should be addressed.
Fractal Fract. 2024, 8(5), 263; https://doi.org/10.3390/fractalfract8050263
Submission received: 7 March 2024 / Revised: 21 April 2024 / Accepted: 23 April 2024 / Published: 27 April 2024

Abstract

:
In this paper, we ponder a kind of discrete-time fractional-order complex-valued fuzzy BAM neural network. Firstly, in order to guarantee the quasi-projective synchronization of the considered networks, an original quantitative control strategy is designed. Next, by virtue of the relevant definitions and properties of the Mittag-Leffler function, we propose a novel discrete-time fractional-order Halanay inequality, which is more efficient for disposing of the discrete-time fractional-order models with time delays. Then, based on the new lemma, fractional-order h-difference theory, and comparison principle, we obtain some easy-to-verify synchronization criteria in terms of algebraic inequalities. Finally, numerical simulations are provided to check the accuracy of the proposed theoretical results.

1. Introduction

Artificial neural networks are mathematical models used to distribute parallel information processing by imitating behavioral characteristics of biological neural networks. Due to their associative memory functions, powerful fault tolerance, and optimized computing functions, neural networks (NNs) have been widely applied in many fields involving image recognition, signal processing, fault diagnosis, as well as biological mathematics [1,2,3,4]. In real-life applications, many adverse factors may influence the dynamic behaviors of NNs. For example, time delays [5], due to the limited switching speed of the amplifier, often lead to oscillation and instability phenomena in NNs. Another example is the existence of uncertain factors, such as parameter uncertainty and random disturbance, which make the dynamic behaviors of NNs more complicated and increase the research difficulty of NNs. To better study these NNs with the above elements, in 1996, Pecora and Carroll first proposed fuzzy NNs [6], which led to further research on NNs.
Based on the special memory advantage and heritability of fractional calculus, fractional differential equations have become useful tools to accurately describe varieties of practical complex problems. As we all know, the origin of fractional calculus is a problem statement, which was posed in 1695 by a correspondence between the German mathematician Leibniz and the French mathematician L’Hopital. The Riemann derivative [7] and Caputo derivative [8] are two common types of fractional-order derivatives. The Caputo derivative is sought-after by a lot of scholars because it has the same initial condition as the integer-order one. Moreover, it can also efficaciously reflect the physical facts of models. Through the unremitting efforts of researchers, some relevant results of fractional calculus were successively put forward [9,10], providing strong support for in-depth discussions of fractional-order systems. Later, scholars utilized inequality techniques, differential inclusion theory, the M-matrix, and other methods to explore the dynamical behaviors of fractional-order NNs. Some excellent results were obtained, such as dissipativity and contractivity [11], existence and uniqueness [12], stabilization [13], and synchronization [14].
The dynamical behaviors of chaotic systems that achieve consistent behaviors over time are referred to as synchronization. Since similar clustering behaviors exist in nature, this has sparked curiosity among researchers about synchronization problems. With a deepening understanding of synchronization, various synchronization types have been raised triumphantly, such as quasi-synchronization [15], finite-time synchronization [16], Mittag-Leffler synchronization [17], and so on. In the above discussion, quasi-synchronization is diffusely praised because of its relatively broad conditions. A quasi-projective synchronization is a special form of quasi-synchronization owing to the existence of its projection factor, which can accelerate the communication speed. Therefore, quasi-projective synchronization is sought after by academics and numerous excellent conclusions have been published in different journals [18,19]. Meanwhile, scholars have found that the synchronization of chaotic systems cannot be achieved without any affection from external forces. This discovery led to the development of various control strategies to meet different synchronization requirements, such as pinning control [20], linear control [21], intermittent control [22], etc. Concurrently, some undesirable phenomena, such as the waste of resources and the associated increase in costs, have emerged in the process of signal transmission due to the limited capacity and bandwidth of the communication channel. In response, some effective quantized controllers have been proposed in [23,24].
The associative memory function of NNs is divided into auto-associative memory and hetero-associative memory; Hopfield NNs represent auto-associative memory. A BAM NN (BAMNN) is a continuous improvement of the Hopfield NN, which was first proposed by Kosko in 1987 [25]. One advantage of BAMNN is its ability to associate complete patterns stored in memory with incomplete patterns. This improvement has attracted many academics to research BAMNNs in full swing, significantly accelerating their development [26,27]. Note that the above discussions are based on the continuous-time framework. With the development of science and technology, we discovered that it is not precise enough to use continuous-time models to solve real problems, because the analysis and processing of some problems need to be completed after discretization [28,29,30]. Therefore, it is time to incorporate discrete-time correlation theory into NNs. Over time, many excellent discrete-time conclusions have been drawn [31,32,33]. In [33], the authors discussed synchronization issues for a class of discrete-time fractional-order complex-valued NNs.
Based on the above discussion, it is evident that there is still relatively limited research on complete synchronization in discrete-time fractional-order BAMNNs, let alone quasi-projective synchronization; this motivated us to conduct research. To make our model more general and valuable, we consider the quasi-projective synchronization of a class of discrete-time fractional-order complex-valued fuzzy BAMNNs (DFCFBAMNNs). The main highlights of this paper are as follows: (1) Compared with models in [26,27,28,30,31,32], our model is more general as it integrates fuzzy logic, fractional difference operators, and plurality into BAMNNs. (2) In order to better deal with the time-delay term of the considered networks, a new lemma is brought forward that can avoid the use of inequality scaling or the design of a special controller. (3) To chase the target of synchronization, a novel quantized controller is designed. (4) Simple and easy-to-verify synchronization criteria are given.
The rest of this paper is arranged as follows. In Section 2, the model description and some preparatory knowledge are given. Effective criteria for quasi-projective synchronization in DFCFBAMNNs are presented in Section 3. In Section 4, numerical simulations are provided to illustrate the availability of theoretical results. A succinct discussion is presented in Section 5.
Notations:   0 C h α denotes the Caputo h-discrete fractional difference with order α ( 0 < α < 1 ) , then R + , R , C , and C n denote the set of positive real numbers, real numbers, complex numbers, and n-dimensional complex vectors. z i ( t ) = z i R ( t ) + z i I ( t ) i , i = 1 , z i ( t ) ¯ denotes the conjugate of z i ( t ) , | z i ( t ) | = z i ( t ) z i ( t ) ¯ 1 2 stands for the module of z i ( t ) , z ( t ) = z 1 ( t ) , z 2 ( t ) , , z n ( t ) T C n , z ( t ) 2 = i = 1 N z i ( t ) z i ( t ) ¯ 1 2 denotes the two-norm of z ( t ) , [ d ] denotes the great integer less than d, ( h N ) b = { x | x = b , b + h , b + 2 h , } , ( h N ) b c = { x | x = b , b + h , b + 2 h , , c , } , where c b = k h .

2. Preparatory Knowledge and Model Description

In this part, we recall common definitions, lemmas, assumptions, and other conditions that will be used later, and a new lemma is proved to establish the quasi-projective synchronization criteria of DFCFBAMNNs.
Definition 1
([29]). The backing difference ς ( t ) on ( h N ) 0 is defined as
h ς ( t ) = ς ( t ) ς ( t h ) h .
Definition 2
([29]). The α-th order h-rising function is defined by the following:
γ h α ¯ = h α Γ ( γ h + α ) Γ ( γ h ) ,
where h > 0 , 0 h α ¯ = 0 .
Definition 3
([29]). The α-th order fractional h-monomial H ^ α ( t , 0 ) is written as follows:
H ^ α ( t , 0 ) = t h α ¯ Γ ( α + 1 ) = h α Γ ( t h + α ) Γ ( t h ) Γ ( α + 1 ) .
Definition 4
([5]). Let ς ( t ) : ( h N ) 0 R and α > 0 . The α-th order h-sum with a basing point of 0 is given by
  0 C h α ς ( t ) = 0 t H ^ α 1 ( t , ξ ( s ) ) ς ( s ) h s , t ( h N ) h ,
by convention   0 C h α ς ( 0 ) = 0 and ξ ( s ) = s h .
Definition 5
([5]). The Caputo nabla fractional difference of ς ( t ) ( h N ) 0 and n 1 < α < n of α ( α R + ) is expressed as
  0 C h α ς ( t ) =   0 h ( n α ) h n ς ( t ) , t ( h N ) n h ,
when 0 < α < 1 , and we have the following:
  0 C h α ς ( t ) =   0 h ( 1 α ) h ς ( t ) , t ( h N ) h .
Definition 6
([29]). The discrete Mittag-Leffler function is stated as follows:
E α , b h ( c , t ) = k = 0 c k t h k α + b ¯ Γ ( α k + b + 1 ) .
For b = 0 , we have the following:
E α , 0 h ( c , t ) = E α , 0 h ( c , t ) = k = 0 c k t h k α ¯ Γ ( α k + 1 ) ,
in which 0 < α < 1 , b R and | c | < h α .
Lemma 1
([30]). For the arbitrary two complex numbers, υ, ν, and arbitrary real number ι > 0 , we obtain the following:
υ ¯ ν + υ ν ¯ ι υ υ ¯ + 1 ι ν ν ¯ .
Lemma 2
([34]). Let 0 < σ < h α , the E α , 0 h ( σ , t ) is monotonically non-increasing and 0 < E α , 0 h ( σ , t ) 1 for t ( h N ) 0 .
Lemma 3
([5]). For | σ | < h α , 0 < α < 1 , we have the following:
  0 C h α E α , 0 h ( σ , t ) = σ E α , 0 h ( σ , t ) , t ( h N ) h .
Lemma 4.
Let x ( t ) : ( h N ) 0 R + be a function meeting
  0 C h α x ( t ) b x ( t ) + i = 1 n c x ( t τ i ( t ) ) , t ( h N ) h ,
where 0 < b , c < h α , n c < b and 0 τ i ( t ) τ , then we obtain the following:
x ( t ) k E α , 0 h ( σ ´ , t ) , k > 0 , 0 < σ ´ < h α .
Proof. 
We consider a continuously differentiable function of σ , as follows:
H ( σ ) = σ + i = 1 n c E α , 0 h ( σ , t τ i ( t ) ) E α , 0 h ( σ , t ) b ,
and according to Lemma 2 and Definition 6, we have the following:
H ( 0 ) = i = 1 n c E α , 0 h ( 0 , t τ i ( t ) ) E α , 0 h ( 0 , t ) b = n c b < 0 ,
and
H ( b ) = b + i = 1 n c E α , 0 h ( b , t τ i ( t ) ) E α , 0 h ( b , t ) b = i = 1 n c E α , 0 h ( b , t τ i ( t ) ) E α , 0 h ( b , t ) > 0 .
According to the zero-point existence theorem of continuous functions, there is a σ ´ ( 0 , b ) , and H ( σ ´ ) = σ ´ + c i = 1 n E α , 0 h ( σ ´ , t τ i ( t ) ) E α , 0 h ( σ ´ , t ) b = 0 , i.e.,
σ ´ E α , 0 h ( σ ´ , t ) = c i = 1 n E α , 0 h ( σ ´ , t τ i ( t ) ) ) b E α , 0 h ( σ ´ , t ) .
Let us consider the comparison system of (1) as follows:
  0 C h α μ ( t ) = b μ ( t ) + i = 1 n c μ ( t τ i ( t ) ) , t ( h N ) h ,
it has the same initial value as (1). Using Lemma 3 and (2), we obtain the following equation:
  0 C h a E α , 0 h ( σ ´ , t ) = σ ´ E α , 0 h ( σ ´ , t ) = b E α , 0 h ( σ ´ , t ) + i = 1 n c E α , 0 h ( σ ´ , t τ i ( t ) ) ,
it is not hard to see that E α , 0 h ( σ ´ , t ) is the solution of (3), in view of the fractional comparison principle, we obtain
x ( t ) k E α , 0 h ( σ ´ , t ) , t ( h N ) h .
Corollary 1.
Let x ( t ) : ( h N ) 0 R + be a function satisfying
  0 C h α x ( t ) a b x ( t ) + i = 1 n c x ( t τ i ( t ) ) , t ( h N ) h ,
where 0 < a , 0 < b , c < h α , n c < b and 0 τ i ( t ) τ , then we obtain the following:
x ( t ) k E α , 0 h ( σ ´ , t ) + a b c , k > 0 , 0 < σ ´ < h α .
Proof. 
The upper formula hints that
  0 C h α x ( t ) a b c b x ( t ) a b c + i = 1 n c x ( t τ i ( t ) ) a b c ,
then according to Lemma 4, we obtain the following: x ( t ) a b c k E α , 0 h ( σ ´ , t ) , i.e.,
x ( t ) k E α , 0 h ( σ ´ , t ) + a b c , t ( h N ) h .
Remark 1.
In [14], the authors successfully extended the Halanay inequality to the continuous-time fractional-order case, which is a huge improvement for solving continuous-time fractional-order NNs with time delays. On this basis, this paper further popularizes the Halanay inequality to discrete-time fractional-order situations, which is of great significance to research on discrete-time fractional-order NNs with time delays.
Consider a general DFCFBAMNN as follows:
  0 C h α x i ( t ) = a i x i ( t ) + l = 1 M b i l f l ( y l ( t ) ) + l = 1 M c i l f l ( y l ( t τ ( t ) ) ) + l = 1 M d i l f l ( y l ( t τ ( t ) ) ) + I i , t ( h N ) h ,   0 C h α y l ( t ) = δ l y l ( t ) + i = 1 N β l i g i ( x i ( t ) ) + i = 1 N γ l i g i ( x i ( t τ ( t ) ) ) + i = 1 N θ l i g i ( x i ( t τ ( t ) ) ) + I l , t ( h N ) h ,
with the following initial condition:
x i ( p ) = Φ i ( p ) , p ( h N ) τ 0 , i N , y l ( p ) = Ψ l ( p ) , p ( h N ) τ 0 , l M ,
here, a i , δ l R + denote the neuron’s self-inhibition rates, x ( t ) = ( x 1 ( t ) , x 2 ( t ) x n ( t ) ) T denotes the i-th state variable vector in the X-layer; similarly, y ( t ) = ( y 1 ( t ) , y 2 ( t ) y m ( t ) ) T represents the l-th state variable vector in the Y-layer; b i l and β l i stand for the synaptic connection strengths without delay;anddenote fuzzy OR and fuzzy AND operations; c i l and γ l i denote elements of the fuzzy feedback MIN template; similarly, d i l and θ l i denote fuzzy feedback MAX templates; I i , I l R denote external inputs of the X-layer and Y-layer; f l ( · ) , g i ( · ) : C C denote the activation functions, τ ( t ) denotes the time delay and contents 0 τ ( t ) τ .
Definition 7
([35]). For the arbitrary appropriate cone R n , the partial relation acquired by ℑ in R n is stipulated as follows:
( 1 ) ϵ ε ϵ ε ,
( 2 ) ϵ ε ϵ ε int ,
where the interior of ℑ is represented by int ℑ.
Remark 2.
For arbitrary ϵ, ε C , ϵ = ϵ 1 + ϵ 2 i , ε = ε 1 + ε 2 i , ϵ ε = ϵ 1 ε 1 + ( ϵ 2 ε 2 ) i . The magnitude on different relationships of ϵ and ε can be determined according to the following rules: (1) If ϵ 1 > ( < ) ε 1 , ϵ 2 ε 2 , then ϵ ( ) ε ; (2) if ϵ 1 > ( < ) ε 1 , ϵ 2 = ε 2 or ϵ 1 = ε 1 , ϵ 2 > ( < ) ε 2 , then ϵ ( ) ε ; (3) if ϵ 1 = ε 1 , and ϵ 2 = ε 2 , then ϵ = ε .
Remark 3.
In DFCFBAMNN (6), fuzzy AND operator and fuzzy OR operator can be understood as follows:
l = 1 M c i l f l ( y l ( t ) ) = min 1 l M c i l f l ( y l ( t ) ) ,
l = 1 M d i l f l ( y l ( t ) ) = max 1 l M d i l f l ( y l ( t ) ) .
Assumption 1.
For arbitrary μ , ν C , there exist real numbers ι l , ȷ i > 0 , such that
| f l ( μ ) f l ( v ) | ι l | μ v | ,
| g i ( μ ) g i ( v ) | ȷ i | μ v | .
Assumption 2.
For arbitrary f l ( · ) , g i ( · ) : C C and I i ( · ) , I l ( · ) , there exist real numbers f l , g i , l f i , l g l R satisfying
| f l ( · ) | < f l , | g i ( · ) | < g i ,
| I i ( · ) | < l f i , | I l ( · ) | < l g l .
Remark 4.
Assumption 1 is the Lipschitz condition, which is a prerequisite for the existence and uniqueness of solutions to fractional-order neural networks. Assumption 2 is given for the needs of the theoretical results. In the future, we will explore quasi-projective synchronization criteria with low conservatism, weakening or removing Assumption 2.
The controlled DFCFBAMNN is given as follows:
  0 C h α x ˘ i ( t ) = a i x ˘ i ( t ) + l = 1 M b i l f l ( y ˘ l ( t ) ) + l = 1 M c i l f l ( y ˘ l ( t τ ( t ) ) ) + l = 1 M d i l f l ( y ˘ l ( t τ ( t ) ) ) + I i + u i ( t ) , t ( h N ) h ,   0 C h α y ˘ l ( t ) = δ l y ˘ l ( t ) + i = 1 N β l i g i ( x ˘ i ( t ) ) + i = 1 N γ l i g i ( x ˘ i ( t τ ( t ) ) ) + i = 1 N θ l i g i ( x ˘ i ( t τ ( t ) ) ) + I l + u l ( t ) , t ( h N ) h ,
with the initial condition:
x ˘ i ( p ) = Φ ˘ i ( p ) , p ( h N ) τ 0 , i N , y ˘ l ( p ) = Ψ ˘ l ( p ) , p ( h N ) τ 0 , l M .
Definition 8
([19]). DFCFBAMNNs (6) and (7) can achieve quasi-projective synchronization, if there exist r and a small error bound η > 0 satisfying
lim t | | x ˘ ( t ) r x ( t ) | | 2 + | | y ˘ ( t ) r y ( t ) | | 2 η ,
r C is projective coefficient. When r = 1 , DFCFBAMNNs (6) and (7) can achieve quasi-synchronization, we can define the error signals of (6) and (7) as follows:
ψ i ( t ) = x ˘ i ( t ) r x i ( t ) , φ l ( t ) = y ˘ l ( t ) r y l ( t ) .
By counting the Caputo difference of (8), we have the following:
  0 C h α ψ i ( t ) = a i ψ i ( t ) + ( 1 r ) I i ( t ) + u i 1 ( t ) + l = 1 M b i l f l ( y ˇ l ( t ) ) f l ( r y l ( t ) ) + l = 1 M b i l f l ( r y l ( t ) ) r f l ( y l ( t ) ) + l = 1 M c i l f l ( y ˇ l ( t τ ( t ) ) ) f l ( r y l ( t τ ( t ) ) ) + l = 1 M c i l f l ( r y l ( t τ ( t ) ) ) r f l ( y l ( t τ ( t ) ) ) + l = 1 M d i l f l ( y ˇ l ( t τ ( t ) ) ) f l ( r y l ( t τ ( t ) ) ) + l = 1 M d i l f l ( r y l ( t τ ( t ) ) ) r f l ( y l ( t τ ( t ) ) ) , t ( h N ) h ,   0 C h α φ l ( t ) = δ l φ l ( t ) + ( 1 r ) I l ( t ) + u l 2 ( t ) + i = 1 N β l i g i ( x ˇ i ( t ) ) g i ( r x i ( t ) ) + i = 1 N β l i g i ( r x i ( t ) ) + r g i ( x i ( t ) ) + i = 1 N γ l i g i ( x ˇ i ( t τ ( t ) ) ) g i ( r x i ( t τ ( t ) ) ) + i = 1 N γ l i g i ( r x i ( t τ ( t ) ) ) + r g i ( x i ( t τ ( t ) ) ) + i = 1 N θ l i g i ( x ˇ i ( t τ ( t ) ) ) g i ( r x i ( t τ ( t ) ) ) + i = 1 N θ l i g i ( r x i ( t τ ( t ) ) ) + r g i ( x i t τ ( t ) ) ) , t ( h N ) h ,
with initial value
ψ i ( p ) = Φ i ( p ) r Φ ˘ i ( p ) , p ( h N ) τ 0 , i N , φ l ( p ) = Ψ l ( p ) r Ψ ˘ l ( p ) , p ( h N ) τ 0 , l M .
We designed a quantized state feedback controller, as follows:
u i 1 ( t ) = p i ψ i R ( t ) + i ψ i I ( t ) , u l 2 ( t ) = q l φ i R ( t ) + i φ i I ( t ) ,
where p i , q l are positive control gains, ( · ) : R F , F = { ± s i : s i = ζ i s 0 , i = 0 , ± 1 , ± 2 } { 0 } with s 0 > 0 , the quantizer ( · ) can be described as follows:
( ϵ ) = s i , i f 1 1 + Π s i < ϵ < 1 1 Π s i , 0 , i f ϵ = 0 , ( ϵ ) , i f ϵ < 0 ,
in which 0 < ζ < 1 stands for the density of the quantizer, and Π = 1 ζ 1 + ζ denotes the parameter of the quantizer, s i represents the level of the quantizer. There exists a Filippov solution ξ ^ [ Π , Π ) such that ( ϵ ) = ( 1 + ξ ^ ) ϵ . To put it simply, we have the following abbreviation: ϕ ( t ) = ψ 1 ( t ) , ψ 2 ( t ) , ψ n ( t ) , φ 1 ( t ) , φ 2 ( t ) , φ m ( t ) T .

3. Main Results

In this part, we receive some standards for DFCFBAMNNs (6) and (7) to achieve quasi-projective synchronization based on the discrete-time fractional-order Halanay inequality.
For the sake of convenience, we introduce notations as follows:
λ = M 1 + 2 + 3 + 5 + 6 + 7 l f i 2 ,
λ ˘ = M ˘ 1 + ˘ 2 + ˘ 3 + ˘ 5 + ˘ 6 + ˘ 7 l g l 2 .
Theorem 1.
Under Assumptions 1 and 2, DFCFBAMNNs (6) and (7) realize quasi-projective synchronization if
0 < Υ , Θ < h a ,
Θ Υ < 0 ,
in which Υ = min Ω 1 , Ω 2 , Θ = max Ω 1 ˜ , Ω 2 ˜ , Ω 1 = 2 a i + 2 p i ( 1 Π ) l = 1 M 4 | b i l | 2 λ 1 ˘ 1 l = 1 M | β l i | 2 ȷ i 2 , Ω 2 = 2 δ l + 2 q l ( 1 Π ) i = 1 N ˘ 4 | β l i | 2 λ ˘ 1 1 i = 1 N | b i l | 2 ι l 2 , Ω 1 ˜ = l = 1 M ȷ i 2 × ( 1 ˘ 2 | γ l i | 2 + 1 ˘ 3 | θ l i | 2 ) , Ω 2 ˜ = i = 1 N ι l 2 ( 1 2 | c i l | 2 + 1 3 | d i l | 2 ) .
Proof. 
The constructed Lyapunov function
V ( t ) = i = 1 N ψ i ( t ) ψ i ( t ) ¯ + l = 1 M φ l ( t ) φ l ( t ) ¯ .
Calculating the Caputo difference of V ( t ) derives the following:
  0 C h α V ( t ) =   0 C h α i = 1 N ψ i ( t ) ψ i ( t ) ¯ + l = 1 M φ l ( t ) φ l ( t ) ¯ i = 1 N ψ i ( t ) ¯   0 C h α ψ i ( t ) + ψ i ( t )   0 C h α ψ i ( t ) ¯ + l = 1 M φ l ( t ) ¯   0 C h α φ l ( t ) + φ l ( t )   0 C h α φ l ( t ) ¯ .
It follows from (9) that
i = 1 N ψ i ( t ) ¯   0 C h α ψ i ( t ) + ψ i ( t ) 0 C h α ψ i ( t ) ¯ = i = 1 N ψ i ( t ) ¯ { a i ψ i ( t ) + u i 1 ( t ) + l = 1 M b i l f l ( y ˇ l ( t ) ) f l ( r y l ( t ) ) + l = 1 M c i l f l ( y ˇ l ( t τ ( t ) ) ) f l ( r y l ( t τ ( t ) ) ) + l = 1 M d i l f l ( y ˇ l ( t τ ( t ) ) ) f l ( r y l ( t τ ( t ) ) ) + l = 1 M b i l f l ( r y l ( t ) ) r f l ( y l ( t ) ) + ( 1 r ) I i ( t ) + l = 1 M c i l f l ( r y l ( t τ ( t ) ) ) r f l ( y l ( t τ ( t ) ) ) + l = 1 M d i l f l ( r y l ( t τ ( t ) ) ) r f l ( y l ( t τ ( t ) ) ) } + i = 1 N ψ i ( t ) { a i ψ i ( t ) ¯ + u i 1 ( t ) ¯ + l = 1 M b i l ¯ f l ( y ˇ l ( t ) ) ¯ f l ( r y l ( t ) ) ¯ + l = 1 M c i l ¯ f l ( y ˇ l ( t τ ( t ) ) ) ¯ f l ( r y l ( t τ ( t ) ) ) ¯ + l = 1 M d i l ¯ f l ( y ˇ l ( t τ ( t ) ) ) ¯ f l ( r y l ( t τ ( t ) ) ) ¯ + l = 1 M b i l ¯ f l ( r y l ( t ) ) ¯ + r ¯ f l ( y l ( t ) ) ¯ + ( 1 r ¯ ) I i ( t ) + l = 1 M c i l ¯ f l ( r y l ( t τ ( t ) ) ) ¯ r ¯ f l ( y l ( t τ ( t ) ) ) ¯ + l = 1 M d i l ¯ f l ( r y l ( t τ ( t ) ) ) ¯ r ¯ f l ( y l ( t τ ( t ) ) ) ¯ } .
According to Lemma 1 and Assumption 1, we have the following:
i = 1 N l = 1 M ψ i ( t ) ¯ b i l f l ( y ˇ l ( t ) ) f l ( r y l ( t ) ) + i = 1 N l = 1 M ψ i ( t ) b i l ¯ f l ( y ˇ l ( t ) ) ¯ f l ( r y l ( t ) ) ¯ M i = 1 N 1 ψ i ( t ) ψ i ( t ) ¯ + 1 1 i = 1 N l = 1 M b i l b i l ¯ f l ( y ˇ l ( t ) ) f l ( r y l ( t ) ) × f l ( y ˇ l ( t ) ) ¯ f l ( r y l ( t ) ) ¯ M i = 1 N 1 ψ i ( t ) ψ i ( t ) ¯ + 1 1 i = 1 N l = 1 M | b i l | 2 ι l 2 φ l ( t ) φ l ( t ) ¯ ,
and
i = 1 N ψ i ( t ) ¯ l = 1 M c i l f l ( y ˇ l ( t τ ( t ) ) ) f l ( r y l ( t τ ( t ) ) ) + i = 1 N ψ i ( t ) l = 1 M c i l ¯ f l ( y ˇ l ( t τ ( t ) ) ) ¯ f l ( r y l ( t τ ( t ) ) ) ¯ + i = 1 N ψ i ( t ) ¯ l = 1 M d i l f l ( y ˇ l ( t τ ( t ) ) ) f l ( r y l ( t τ ( t ) ) ) + i = 1 N ψ i ( t ) ¯ l = 1 M d i l ¯ f l ( y ˇ l ( t τ ( t ) ) ) ¯ f l ( r y l ( t τ ( t ) ) ) ¯ i = 1 N 2 ψ i ( t ) ψ i ( t ) ¯ + i = 1 N 3 ψ i ( t ) ψ i ( t ) ¯ + 1 2 i = 1 N l = 1 M c i l c i l ¯ f l ( y ˇ l ( t τ ( t ) ) ) f l ( r y l ( t τ ( t ) ) ) × f l ( y ˇ l ( t τ ( t ) ) ) ¯ f l ( r y l ( t τ ( t ) ) ) ¯ + 1 3 i = 1 N l = 1 M d i l d i l ¯ f l ( y ˇ l ( t τ ( t ) ) ) f l ( r y l ( t τ ( t ) ) ) × f l ( y ˇ l ( t τ ( t ) ) ) ¯ f l ( r y l ( t τ ( t ) ) ) ¯ ( 2 + 3 ) i = 1 N ψ i ( t ) ψ i ( t ) ¯ + i = 1 N l = 1 M ι l 2 ( 1 2 | c i l | 2 + 1 3 | d i l | 2 ) φ l ( t τ ( t ) ) ¯ φ l ( t τ ( t ) ) .
According to Assumption 2 and Lemma 1, we obtain the following:
i = 1 N l = 1 M ψ i ( t ) ¯ b i l f l ( r y l ( t ) ) r f l ( y l ( t ) ) + i = 1 N l = 1 M ψ i ( t ) b i l ¯ f l ( r y l ( t ) ) ¯ r ¯ f l ( y l ( t ) ¯ ) i = 1 N l = 1 M 4 b i l ¯ b i l ψ i ( t ) ¯ ψ i ( t ) + N 4 l = 1 M f l ( r y l ( t ) ) r f l ( y l ( t ) ) f l ( r y l ( t ) ) ¯ r ¯ f l ( y l ( t ) ) ¯ i = 1 N l = 1 M 4 b i l ¯ b i l ψ i ( t ) ¯ ψ i ( t ) + N 4 l = 1 M ( f l ( r y l ( t ) ) f l ( r y l ( t ) ) ¯ + f l ( r y l ( t ) ) r ¯ f l ( y l ( t ) ) ¯ + r f l ( y l ( t ) ) f l ( r y l ( t ) ) ¯ + r r ¯ f l ( y l ( t ) ) f l ( y l ( t ) ) ¯ ) i = 1 N l = 1 M 4 | b i l | 2 ψ i ( t ) ¯ ψ i ( t ) + 2 N 4 l = 1 M f l ( r y l ( t ) ) f l ( r y l ( t ) ) ¯ + r r ¯ f l ( y l ( t ) ) f l ( y l ( t ) ¯ i = 1 N l = 1 M 4 | b i l | 2 ψ i ( t ) ¯ ψ i ( t ) + 2 N 4 l = 1 M ( 1 | r | 2 ) f l 2 .
In the light of Lemma 1, we obtain the following:
i = 1 N ψ i ( t ) ¯ l = 1 M c i l f l ( r y l ( t τ ( t ) ) ) r f l ( y l ( t τ ( t ) ) ) + i = 1 N ψ i ( t ) l = 1 M c i l ¯ f l ( r y l ( t τ ( t ) ) ) ¯ r ¯ f l ( y l ( t τ ( t ) ) ¯ ) + i = 1 N ψ i ( t ) ¯ l = 1 M d i l f l ( r y l ( t τ ( t ) ) ) r f l ( y l ( t τ ( t ) ) ) + i = 1 N ψ i ( t ) l = 1 M d i l ¯ f l ( r y l ( t τ ( t ) ) ) ¯ r ¯ f l ( y l ( t τ ( t ) ) ¯ ) i = 1 N 5 ψ i ( t ) ψ i ( t ) ¯ + i = 1 N 6 ψ i ( t ) ψ i ( t ) ¯ + 1 5 i = 1 N l = 1 M c i l c i l ¯ f l ( r y l ( t τ ( t ) ) ) r f l ( y l ( t τ ( t ) ) ) × f l ( r y l ( t τ ( t ) ) ) ¯ r ¯ f l ( y l ( t τ ( t ) ) ¯ ) + 1 6 i = 1 N l = 1 M d i l d i l ¯ f l ( r y l ( t τ ( t ) ) ) r f l ( y l ( t τ ( t ) ) ) × f l ( r y l ( t τ ( t ) ) ) ¯ r ¯ f l ( y l ( t τ ( t ) ) ¯ ) ( 5 + 6 ) i = 1 N ψ i ( t ) ψ i ( t ) ¯ + i = 1 N l = 1 M ( 2 5 | c i l | 2 + 2 6 | d i l | 2 ) ( 1 | r | 2 ) f l 2 .
Due to the boundedness of the external input function and Lemma 1, we obtain the following:
i = 1 N ψ i ( t ) ¯ ( 1 r ) I i + i = 1 N ψ i ( t ) ( 1 r ¯ ) I i i = 1 N 7 ψ i ( t ) ¯ ψ i ( t ) I i 2 + N 7 ( 1 r ) ( 1 r ¯ ) i = 1 N 7 ψ i ( t ) ¯ ψ i ( t ) l f i 2 + N 7 ( 1 r ) ( 1 r ¯ ) .
According to (10), we obtain the following:
i = 1 N ψ i ( t ) ¯ u i 1 ( t ) ) + ψ i ( t ) u i 1 ( t ) ) ¯ = i = 1 N p i { ψ i R ( t ) i ψ i I ( t ) ψ i R ( t ) + i ψ i I ( t ) + ψ i R ( t ) + i ψ i I ( t ) ψ i R ( t ) i ψ i I ( t ) } = 2 i = 1 N p i ψ i R ( t ) ψ i R ( t ) + ψ i I ( t ) ψ i I ( t ) = 2 i = 1 N p i ( 1 Π ) ψ i R ( t ) 2 + ( 1 Π ) ψ i I ( t ) 2 = 2 i = 1 N p i ( 1 Π ) ψ i ( t ) ψ i ( t ) ¯ .
By integrating the above inequalities, we obtain the following:
i = 1 N ψ i ( t ) ¯   0 C h α ψ i ( t ) + ψ i ( t ) 0 C h α ψ i ( t ) ¯ i = 1 N ( M 1 + 2 + 3 + l = 1 M 4 | b i l | 2 + 5 + 6 + 7 l f i 2 2 a i 2 p i ( 1 Π ) ) ψ i ( t ) ψ i ( t ) ¯ + 1 1 i = 1 N l = 1 M | b i l | 2 ι l 2 φ l ( t ) φ l ( t ) ¯ + i = 1 N l = 1 M ι l 2 ( 1 2 | c i l | 2 + 1 3 | d i l | 2 ) φ l ( t τ ( t ) ) φ l ( t τ ( t ) ) ¯ + l = 1 M ( 2 N 4 + i = 1 N 2 5 | c i l | 2 + i = 1 N 2 6 | d i l | 2 ) ( 1 | r | 2 ) f l 2 + N 7 ( 1 r ) ( 1 r ¯ ) = i = 1 N l = 1 M 4 | b i l | 2 + λ 2 a i 2 p i ( 1 Π ) ψ i ( t ) ψ i ( t ) ¯ + 1 1 i = 1 N l = 1 M | b i l | 2 ι l 2 φ l ( t ) φ l ( t ) ¯ + i = 1 N l = 1 M ι l 2 ( 1 2 | c i l | 2 + 1 3 | d i l | 2 ) φ l ( t τ ( t ) ) φ l ( t τ ( t ) ) ¯ + l = 1 M ( 2 N 4 + i = 1 N 2 5 | c i l | 2 + i = 1 N 2 6 | d i l | 2 ) ( 1 | r | 2 ) f l 2 + N 7 ( 1 r ) ( 1 r ¯ ) .
By methods like (15)–(21), we obtain the following:
l = 1 M φ l ( t ) ¯   0 C h α φ l ( t ) + φ l ( t ) 0 C h α φ l ( t ) ¯ l = 1 M ( N ˘ 1 + ˘ 2 + ˘ 3 + i = 1 N ˘ 4 | β l i | 2 + ˘ 5 + ˘ 6 + ˘ 7 l g l 2 2 δ l 2 q l ( 1 Π ) ) φ l ( t ) φ l ( t ) ¯ + 1 ˘ 1 i = 1 N l = 1 M | β l i | 2 ȷ i 2 ψ i ( t ) ψ i ( t ) ¯ + l = 1 M i = 1 N ȷ i 2 ( 1 ˘ 2 | γ l i | 2 + 1 ˘ 3 | θ l i | 2 ) ψ i ( t τ ( t ) ) ψ i ( t τ ( t ) ) ¯ + i = 1 N ( 2 M ˘ 4 + l = 1 M 2 ˘ 5 | γ l i | 2 + l = 1 M 2 ˘ 6 | θ l i | 2 ) ( 1 | r | 2 ) g i 2 + M ˘ 7 ( 1 r ) ( 1 r ¯ ) = l = 1 M i = 1 N ˘ 4 | β l i | 2 + λ ˘ 2 δ l 2 q l ( 1 Π ) φ l ( t ) φ l ( t ) ¯ + 1 ˘ 1 i = 1 N l = 1 M | β l i | 2 ȷ i 2 ψ i ( t ) ψ i ( t ) ¯ + l = 1 M i = 1 N ȷ i 2 ( 1 ˘ 2 | γ l i | 2 + 1 ˘ 3 | θ l i | 2 ) ψ i ( t τ ( t ) ) ψ i ( t τ ( t ) ) ¯ + i = 1 N ( 2 M ˘ 4 + l = 1 M 2 ˘ 5 | γ l i | 2 + l = 1 M 2 ˘ 6 | θ l i | 2 ) ( 1 | r | 2 ) g i 2 + M ˘ 7 ( 1 r ) ( 1 r ¯ ) .
By combining inequalities (22) and (23), we obtain the following:
  0 C h α V ( t ) = i = 1 N ψ i ( t ) ψ i ( t ) ¯ + l = 1 M φ l ( t ) φ l ( t ) ¯ i = 1 N 2 a i + 2 p i ( 1 Π ) l = 1 M 4 | b i l | 2 λ 1 1 ˘ l = 1 M | β l i | 2 ȷ i 2 ψ i ( t ) ψ i ( t ) ¯ l = 1 M 2 δ l + 2 q l ( 1 Π ) i = 1 N 4 ˘ | β l i | 2 λ ˘ 1 1 i = 1 N | b i l | 2 ι l 2 φ l ( t ) φ l ( t ) ¯ + l = 1 M i = 1 N ȷ i 2 ( 1 2 ˘ | γ l i | 2 + 1 3 ˘ | θ l i | 2 ) ψ i ( t τ ( t ) ) ψ i ( t τ ( t ) ) ¯ + i = 1 N l = 1 M ι l 2 ( 1 2 | c i l | 2 + 1 3 | d i l | 2 ) φ l ( t τ ( t ) ) φ l ( t τ ( t ) ) ¯ + l = 1 M ( 2 N 4 + i = 1 N 2 5 | c i l | 2 + i = 1 N 2 6 | d i l | 2 ) ( 1 | r | 2 ) f l 2 + i = 1 N ( 2 M 4 ˘ + l = 1 M 2 5 ˘ | γ l i | 2 + l = 1 M 2 6 ˘ | θ l i | 2 ) ( 1 | r | 2 ) g i 2 + N 7 ( 1 r ) ( 1 r ¯ ) + M 7 ˘ ( 1 r ) ( 1 r ¯ ) = Υ V ( t ) + Θ V ( t τ ( t ) ) + ι ,
where Υ = min Ω 1 , Ω 2 and Θ = max Ω 1 ˜ , Ω 2 ˜ , ι = l = 1 M ( 2 N 4 + i = 1 N 2 5 | c i l | 2 + i = 1 N 2 6 | d i l | 2 ) × ( 1 | r | 2 ) f l 2 + i = 1 N ( 2 M ˘ 4 + l = 1 M 2 ˘ 5 | γ l i | 2 + l = 1 M 2 ˘ 6 | θ l i | 2 ) ( 1 | r | 2 ) g i 2 + N 7 ( 1 r ) ( 1 r ¯ ) + M ˘ 7 ( 1 r ) ( 1 r ¯ ) .
According to Corollary 1, we have the following:
V ( t ) k ^ E α , 0 h ( σ ^ , t ) + ι Υ Θ , t ( h N ) 0 ,
where k ^ > 0 , 0 < σ ^ < h α are constants and
lim t ( | | ψ ( t ) | | 2 + | | φ ( t ) | | 2 ) 2 ι Υ Θ 1 2 .
Hence, DFCFBAMNNs (6) and (7) can reach quasi-projective synchronization.
If fuzzy logic is not considered in this paper, then DFCFBAMNNs (6) and (7) degenerate to the following:
  0 C h α x i ( t ) = a i x i ( t ) + l = 1 M b i l f l ( y l ( t ) ) + l = 1 M ρ i l f l ( y l ( t τ ( t ) ) ) + I i , t ( h N ) h ,   0 C h α y l ( t ) = δ l y l ( t ) + i = 1 N β l i g i ( x i ( t ) ) + i = 1 N ϱ l i g i ( x i ( t τ ( t ) ) ) + I l , t ( h N ) h ,
and
  0 C h α x ˘ i ( t ) = a i x ˘ i ( t ) + l = 1 M b i l f l ( y ˘ l ( t ) ) + l = 1 M ρ i l f l ( y ˘ l ( t τ ( t ) ) ) + I i + u i 1 ( t ) , t ( h N ) h ,   0 C h α y ˘ l ( t ) = δ l y ˘ l ( t ) + i = 1 N β l i g i ( x ˘ i ( t ) ) + i = 1 N ϱ l i g i ( x ˘ i ( t τ ( t ) ) ) + I l + u l 2 ( t ) , t ( h N ) h .
Similar to the proof method of Theorem 1, we obtain Corollary 2. □
Corollary 2.
Under Assumptions 1 and 2, DFCFBAMNNs (25) and (26) achieve quasi-projective synchronization if
0 < Υ ˜ , Θ ˜ < h α ,
Θ ˜ Υ ˜ < 0 ,
where Υ ˜ = min Ω 3 , Ω 4 , Θ ˜ = max Ω 3 ˜ , Ω 4 ˜ , Ω 3 = 2 a i + 2 p i ( 1 Π ) M ˘ 8 ȷ i 2 l = 1 M ( 8 | b i l | 2 + 9 | ρ i l | 2 ) , Ω 4 = 2 δ l + 2 q l ( 1 Π ) N 8 ι l 2 i = 1 N ( ˘ 8 | β l i | 2 + ˘ 9 | ϱ l i | 2 ) , Ω 3 ˜ = M ˘ 9 ȷ i 2 , Ω 4 ˜ = N 9 ι l 2 .
Remark 5.
Compared with the linear controllers in [19,26,30], the controller in this paper quantifies the signal before it is transmitted, which not only reduces the cost but also decreases the waste of resources in practical applications. At the same time, compared with the hybrid controller composed of the open loop control and adaptive feedback control proposed in [32], the quantitative control in this paper is easy to operate, so the controller in this paper is more practical.
Remark 6.
In fact, due to the associative memory characteristics of BAMNNs, they hold high research value. However, there are still relatively few articles related to synchronization research of BAMNNs within the discrete-time fractional-order framework. Compared to continuous-time models [20,26,27], this paper studies the synchronization problem of BAMNNs under the discrete-time fractional-order framework. Therefore, the models in this paper are more applicable and flexible.
Remark 7.
Compared with the real decomposition approach used in [4,15,17], the direct plurality approach is adopted herein, which not only reduces the computational complexity but also makes our results more compact and natural.

4. Numerical Simulations

In this section, numerical simulation results are provided to demonstrate the applicability of Theorem 1. We consider a 4-dimensional DFCFBAMNN, and the drive system is given as follows:
  0 C h 0.9 x i ( t ) = a i x i ( t ) + l = 1 2 b i l f l ( y l ( t ) ) + l = 1 2 c i l f l ( y l ( t τ ( t ) ) ) + l = 1 2 d i l f l ( y l ( t τ ( t ) ) ) + I i , t ( h N ) h ,   0 C h 0.9 y l ( t ) = δ l y l ( t ) + i = 1 2 β l i g i ( x i ( t ) ) + i = 1 2 γ l i g i ( x i ( t τ ( t ) ) ) + i = 1 2 θ l i g i ( x i ( t τ ( t ) ) ) + I l , t ( h N ) h ,
where activation functions f 1 ( p ) = f 2 ( p ) = g 1 ( p ) = g 2 ( p ) = 1 2 tanh ( p ) , τ ( t ) = 0.25 + [ 25 sin ( 10 t ) ] h , h = 0.01 , α = 0.9 , I i = I l = 0 for i , l = 1 , 2 , k = k ˘ = 1 4 for k = 1 , 2 , , 9 , and other parameters are chosen as follows:
A = ( a i l ) 2 × 2 = 0.15 0 0 0.13 , δ = ( δ l i ) 2 × 2 = 0.25 0 0 0.16 ,
B = ( b i l ) 2 × 2 = 0.1652 0.1001 i 0.2048 0.1010 i 0.1780 0.1448 i 0.1924 0.0114 i ,
β = ( β l i ) 2 × 2 = 0.0918 + 0.0000 i 0.2792 0.0000 i 0.2293 + 0.0000 i 0.0908 + 0.0000 i ,
C = ( c i l ) 2 × 2 = 0.0950 0.0010 i 0.000 0.0000 i 0.2778 0.0151 i 0.0000 + 0.0090 i ,
γ = ( γ l i ) 2 × 2 = 0.3310 + 0.0000 i 0.0020 + 0.0000 i 0.1569 + 0.0000 i 0.000 + 0.1288 i ,
D = ( d i l ) 2 × 2 = 0.1952 0.1101 i 0.0080 + 0.0000 i 0.1528 0.0905 i 0.0000 + 0.0000 i ,
θ = ( θ l i ) 2 × 2 = 0.1627 + 0.0000 i 0.0980 + 0.0000 i 0.2116 + 0.0000 i 0.0000 + 0.0098 i , the initial values of (29) are Φ ( p ) = [ 0.7448 + 0.8282 i , 0.0659 0.2778 i ] T , Ψ ( p ) = [ 0.001 0.0010 i , 0.0010 i ] T for p ( 0.01 N ) 0.5 0 . Figure 1 shows the time evolutions of the real and imaginary parts of the X-layer and Y-layer neurons of DFCFBAMNN (29), respectively. Figure 2 shows phase trajectories of the X-layer and Y-layer neurons x 1 ( t ) , x 2 ( t ) , and y 1 ( t ) , y 2 ( t ) of DFCFBAMNN (29).
The corresponding response system is given as follows:
  0 C h 0.9 x ˘ i ( t ) = a i x ˘ i ( t ) + l = 1 2 b i l f l ( y ˘ l ( t ) ) + l = 1 2 c i l f l ( y ˘ l ( t τ ( t ) ) ) + l = 1 2 d i l f l ( y ˘ l ( t τ ( t ) ) ) + I i + u i ( t ) , t ( h N ) h ,   0 C h 0.9 y ˘ l ( t ) = δ l y ˘ l ( t ) + i = 1 2 β l i g i ( x ˘ i ( t ) ) + i = 1 2 γ l i g i ( x ˘ i ( t τ ( t ) ) ) + i = 1 2 θ l i g i ( x ˘ i ( t τ ( t ) ) ) + I l + u l ( t ) , t ( h N ) h ,
the parameters are the same as (29) and the initial values of (30) are Φ ˘ ( p ) = [ 0.2428 + 0.8221 i , 0.5675 0.7618 i ] T , Ψ ˘ ( p ) = [ 0.0010 , 0.020 i ] T for p ( 0.01 N ) 0.5 0 . Figure 3 reveals the time track of errors of DFCFBAMNNs (29) and (30) without the controller.
We set projective coefficients r 1 = r 2 = 0.06 0.01 i and devise a comfortable quantized controller as follows:
u i 1 ( t ) = p i ψ i R ( t ) + i ψ i I ( t ) , u l 2 ( t ) = q l φ i R ( t ) + i φ i I ( t ) .
We choose p 1 = p 2 = q 1 = q 2 = 0.6 , ζ i = 0 . 9 i , s 0 = 1.3 . By a simple calculation, we can attain the following: ι 1 = ι 2 = ȷ 1 = ȷ 2 = 0.5 , and f 1 = f 2 = g 1 = g 2 = 1.6 , l f 1 = l f 2 = l g 1 = l g 2 = 0 , Ω 1 = 2 a i + 2 p i ( 1 Π ) l = 1 M 4 | b i l | 2 λ 1 1 ˘ l = 1 M | β l i | 2 ȷ i 2 0.0535 + 0.1882 = 0.2417 , Ω 2 = 2 δ l + 2 q l ( 1 Π ) i = 1 N 4 ˘ | β l i | 2 λ ˘ 1 1 i = 1 N | b i l | 2 ι l 2 0.5452 + 0.0523 = 0.5975 , Ω 1 ˜ = l = 1 M ȷ i 2 ( 1 2 ˘ | γ l i | 2 + 1 3 ˘ | θ l i | 2 ) 0.1456 + 0.0860 = 0.2316 , Ω 2 ˜ = i = 1 N ι l 2 ( 1 2 | c i l | 2 + 1 3 | d i l | 2 ) 0.0593 + 0.109 = 0.1683 . Π = 1 ζ 1 + ζ = 1 0.9 1 + 0.9 = 1 19 , and h α 63 . In combination with (11) and (12), the Υ = min Ω 1 , Ω 2 = 0.2417 , Θ = max Ω 1 ˜ , Ω 2 ˜ = 0.2316 . By a simple count, we obtain Θ Υ = 0.0101 < 0 , which fulfills Theorem 1. Therefore, we can conclude that DFCFBAMNNs (29) and (30) attain quasi-projective synchronization, as portrayed in Figure 4. We can see from Figure 4 that the curves fluctuate in a certain range. Figure 5 shows a variation diagram of the quantization controller.

5. Conclusions

In this paper, we consider quasi-projective synchronization for a class of DFCFBAMNNs with time delays. In order to better deal with time delays, we propose a new lemma that expands the Halanay inequality to a discrete-time fractional-order case. Compared with the linear controller in [19,26,30], this paper devises a more practical quantitative controller. Based on the proposed lemma and related properties of complex-valued functions, some original criteria are obtained to fulfill quasi-projective synchronization. Finally, numerical simulations are given to verify the validity of the theoretical results.

Author Contributions

Conceptualization, Y.X. and H.L.; methodology, Y.X. and H.L.; writing—original draft preparation, Y.X.; writing—review and editing, H.L. and L.Z.; numerical simulation, J.Y.; Funding acquisition H.L. and L.Z. 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. 12262035, 12261087), the Open Project of the Key Laboratory of Applied Mathematics of Xinjiang Uygur Autonomous Region, China (grant no. 2021D04014), the Natural Science Foundation of Xinjiang Province, People’s Republic of China (2022D01E41).

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Wu, Y.; Lu, Y.; He, S.; Lu, R. Synchronization control for unreliable network systems in intelligent robots. IEEE/ASME Trans. Mech. 2019, 24, 2641–2651. [Google Scholar] [CrossRef]
  2. Oong, H.; Isa, N. Adaptive evolutionary artificial neural networks for pattern classification. IEEE Trans. Neural Netw. 2011, 22, 1823–1836. [Google Scholar] [CrossRef]
  3. Li, B.; Chow, M.; Tipsuwan, Y.; Hung, J. Neural-network-based motor rolling bearing fault diagnosis. IEEE Trans. Ind. Electron. 2000, 47, 1060–1069. [Google Scholar] [CrossRef]
  4. Ali, M.; Narayanan, G.; Shekher, V.; Alsaedi, A.; Ahmad, B. Global Mittag-Leffler stability analysis of impulsive fractional-order complex-valued BAM neural networks with time varying delays. Commun. Nonlinear Sci. Numer. Simulat. 2020, 83, 105088. [Google Scholar]
  5. Wang, M.; Jia, B.; Du, F.; Liu, X. Asymptotic stability of fractional difference equations with bounded time delays. Fract. Calc. Appl. Anal. 2020, 23, 571–590. [Google Scholar] [CrossRef]
  6. Yang, T.; Yang, L. The global stability of fuzzy cellular networks. IEEE Trans. Circuits Syst. I 1996, 43, 880–883. [Google Scholar] [CrossRef]
  7. Ortigueira, M.; Arnaldo, G. On the relation between the fractional Brownian motion and the fractional derivatives. Phys. Lett. A 2008, 372, 958–968. [Google Scholar] [CrossRef]
  8. Ioannis, D.; Dumitru, B. Caputo and related fractional derivatives in singular systems. Appl. Math. Comput. 2018, 337, 591–606. [Google Scholar]
  9. Mainardi, F.; Gorenflo, R. Fractional calculus and special functions. In Lecture Notes on Mathematical Physics; University of Bologna: Bologna, Italy, 2013. [Google Scholar]
  10. Atıcı, F.; Eloe, P. Gronwall’s inequality on discrete fractional calculus, Comput. Math. Appl. 2012, 64, 3193–3200. [Google Scholar]
  11. Qiu, H.; Cao, J.; Liu, H. Passivity of fractional-order coupled neural networks with interval uncertainties. Math. Comput. Simul. 2023, 205, 845–860. [Google Scholar] [CrossRef]
  12. Ahmadova, A.; Mahmudov, I. Existence and uniqueness results for a class of fractional stochastic neutral differential equations. Chaos Solitons Fract. 2020, 139, 110253. [Google Scholar] [CrossRef]
  13. Zhang, T.; Zhou, J.; Liao, Y. Exponentially stable periodic oscillation and Mittag-Leffler stabilization for fractional-order impulsive control neural networks with piecewise Caputo derivatives. IEEE Trans. Cybern. 2022, 52, 9670–9683. [Google Scholar] [CrossRef] [PubMed]
  14. Zheng, B.; Wang, Z. Mittag-Leffler synchronization of fractional-order coupled neural networks with mixed delays. Appl. Math. Comput. 2022, 430, 127303. [Google Scholar] [CrossRef]
  15. Zhang, S.; Yang, Y.; Li, L.; Wu, D. Quasi-synchronization of fractional-orde complex-valued memristive recurrent neural networks with switching jumps mismatch. Neural Process. Lett. 2021, 53, 865–891. [Google Scholar] [CrossRef]
  16. Li, H.; Hu, C.; Zhang, L.; Jiang, H.; Cao, J. Complete and finite-time synchronization of fractional-order fuzzy neural networks via nonlinear feedback control. Fuzzy Sets Syst. 2022, 443, 50–69. [Google Scholar] [CrossRef]
  17. Chen, J.; Chen, B.; Zeng, Z. Global asymptotic stability and adaptive ultimate Mittag-Leffler synchronization for a fractional-order complex-valued memristive neural networks with delays. IEEE Trans. Syst. Man Cybern. Syst. 2019, 49, 2519–2535. [Google Scholar] [CrossRef]
  18. Wang, F.; Zheng, Z. Quasi-projective synchronization of fractional order chaotic systems under input saturation. Phys. A 2019, 534, 122132. [Google Scholar] [CrossRef]
  19. Li, H.; Hu, C.; Cao, J.; Jiang, H.; Alsaedi, A. Quasi-projective and complete synchronization of fractional-order complex-valued neural networks with time delays. Neural Netw. 2019, 118, 102–109. [Google Scholar] [CrossRef]
  20. Pratap, A.; Raja, R.; Cao, J.; Rihan, F.; Seadawy, A. Quasi-pinning synchronization and stabilization of fractional order BAM neural networks with delays and discontinuous neuron activations. Chaos Solitons Fract. 2020, 131, 109491. [Google Scholar] [CrossRef]
  21. Ali, S.; Hymavathi, M. Synchronization of fractional order neutral type fuzzy cellular neural networks with discrete and distributed delays via state feedback control. Neural Process. Lett. 2021, 53, 929–957. [Google Scholar] [CrossRef]
  22. Wu, Z.; Chen, G.; Fu, X. Synchronization of a network coupled with complex-variable chaotic systems. Chaos 2012, 22, 102–109. [Google Scholar] [CrossRef] [PubMed]
  23. Feng, Y.; Xiong, X.; Tang, R.; Yang, X. Exponential synchronization of inertial neural networks with mixed delays via quantized pinning control. Neurocomputing 2018, 310, 165–171. [Google Scholar] [CrossRef]
  24. Jain, J.; Zhang, W.; Liu, X.; Shukla, M. Quantized controller for a class of uncertain nonlinear systems with dead-zone nonlinearity. ISA Trans. 2020, 107, 181–193. [Google Scholar] [CrossRef] [PubMed]
  25. Kosko, B. Adaptive bidirectional associative memories. Appl. Opt. 1987, 26, 4947–4960. [Google Scholar] [CrossRef] [PubMed]
  26. Xiao, J.; Zhong, S.; Li, Y.; Xu, F. Finite-time Mittag-Leffler synchronization of fractional-order memristive BAM neural networks with time delays. Neurocomputing 2016, 219, 431–439. [Google Scholar] [CrossRef]
  27. Yang, J.; Li, H.; Zhang, L.; Hu, C.; Jiang, H. Synchronization analysis and parameters identification of uncertain delayed fractional-order BAM neural networks. Neural Comput. Appl. 2023, 35, 1041–1052. [Google Scholar] [CrossRef]
  28. Wu, G.; Abdeljawad, T.; Liu, J.; Baleanu, D.; Wu, K. Mittag-Leffler stability analysis of fractional discrete-time neural networks via fixed point technique. Nonlinear Anal. Model. Control 2019, 24, 919–936. [Google Scholar] [CrossRef]
  29. Jia, B.; Du, F.; Erbe, L.; Peterson, A. Asymptotic behavior of nabla half order h-difference equations. J. Appl. Anal. Comput. 2018, 8, 1707–1726. [Google Scholar]
  30. You, X.; Song, Q.; Zhao, Z. Global Mittag-Leffler stability and synchronization of discrete-time fractional-order complex-valued neural networks with time delay. Neural Netw. 2020, 122, 382–394. [Google Scholar] [CrossRef]
  31. Li, H.; Cao, J.; Hu, C.; Jiang, H.; Alsaadi, F. Synchronization analysis of discrete-time fractional-order quaternion-valued uncertain neural networks. IEEE Trans. Neural Netw. Learn. Syst. 2023; early access. [Google Scholar] [CrossRef]
  32. Liu, X.; Yu, Y. Synchronization analysis for discrete fractional-order complex-valued neural networks with time delays. Neural Comput. Appl. 2021, 33, 10503–10514. [Google Scholar] [CrossRef]
  33. Xu, Y.; Li, H.; Zhang, L.; Hu, C.; Jiang, H. Quasi-projective and Mittag-Leffler synchronization of discrete-time fractional-order complex-valued fuzzy neural networks. Neural Process. Lett. 2023, 55, 6657–6677. [Google Scholar] [CrossRef]
  34. Zhao, M.; Li, H.; Zhang, L.; Hu, C.; Jiang, H. Quasi-projective synchronization of discrete-time fractional-order quaternion-valued neural networks. J. Frankl. Inst. 2023, 360, 3263–3279. [Google Scholar] [CrossRef]
  35. Khan, A.; Tammer, C.; Zalinescu, C. Set-Valued Optimization: An Introduction with Applications; Springer: Berlin, Germany, 2015. [Google Scholar]
Figure 1. Trajectories of the X-layer and Y-layer neurons of DFCFBAMNN (29).
Figure 1. Trajectories of the X-layer and Y-layer neurons of DFCFBAMNN (29).
Fractalfract 08 00263 g001
Figure 2. Phase portraits of the X-layer and Y-layer neurons of DFCFBAMNN (29).
Figure 2. Phase portraits of the X-layer and Y-layer neurons of DFCFBAMNN (29).
Fractalfract 08 00263 g002
Figure 3. State trajectories of error modules | ψ 1 ( t ) | , | ψ 2 ( t ) | , φ 1 ( t ) | and | φ 2 ( t ) | without the controller.
Figure 3. State trajectories of error modules | ψ 1 ( t ) | , | ψ 2 ( t ) | , φ 1 ( t ) | and | φ 2 ( t ) | without the controller.
Fractalfract 08 00263 g003
Figure 4. State trajectories of error modules of | ψ 1 ( t ) | , | ψ 2 ( t ) | , φ 1 ( t ) | and | φ 2 ( t ) | under the controller (31).
Figure 4. State trajectories of error modules of | ψ 1 ( t ) | , | ψ 2 ( t ) | , φ 1 ( t ) | and | φ 2 ( t ) | under the controller (31).
Fractalfract 08 00263 g004
Figure 5. State evolutions of the quantization controller (31).
Figure 5. State evolutions of the quantization controller (31).
Fractalfract 08 00263 g005
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

Xu, Y.; Li, H.; Yang, J.; Zhang, L. Quasi-Projective Synchronization of Discrete-Time Fractional-Order Complex-Valued BAM Fuzzy Neural Networks via Quantized Control. Fractal Fract. 2024, 8, 263. https://doi.org/10.3390/fractalfract8050263

AMA Style

Xu Y, Li H, Yang J, Zhang L. Quasi-Projective Synchronization of Discrete-Time Fractional-Order Complex-Valued BAM Fuzzy Neural Networks via Quantized Control. Fractal and Fractional. 2024; 8(5):263. https://doi.org/10.3390/fractalfract8050263

Chicago/Turabian Style

Xu, Yingying, Hongli Li, Jikai Yang, and Long Zhang. 2024. "Quasi-Projective Synchronization of Discrete-Time Fractional-Order Complex-Valued BAM Fuzzy Neural Networks via Quantized Control" Fractal and Fractional 8, no. 5: 263. https://doi.org/10.3390/fractalfract8050263

Article Metrics

Back to TopTop