Loading [MathJax]/jax/output/SVG/jax.js
Research article Special Issues

An improved signal detection algorithm for a mining-purposed MIMO-OFDM IoT-based system

  • Received: 12 January 2023 Revised: 28 April 2023 Accepted: 05 May 2023 Published: 16 May 2023
  • The coal mine internet of things (IoT) communication system is used for real-time monitoring of mining production to ensure the safety and reliability of personnel and equipment in the mine. To eliminate multipath fading in the process of wireless communication in mines, multiple-output multiplexing (MIMO) and orthogonal frequency division multiplexing (OFDM) technologies are introduced. In this paper, a wireless communication system architecture of IoT in mining based on MIMO-OFDM is constructed. Aiming to solve the problems of intersymbol interference and frequency selective fading at the receiver, an improved minimum mean square error ordered successive interferences cancellation (MMSE-OSIC) signal detection algorithm is proposed. First, the signal-to-interference plus noise ratio of the received signal is calculated and the calculation results are sorted. The lowest signal-to-noise ratio is selected as the weakest signal layer. Then, the MMSE-OSIC algorithm is used to extract all of the signals, except the weakest layer. Finally, a maximum likelihood (ML) algorithm is used to traverse the whole signal domain; the signal symbol with the smallest distance from the weakest signal layer is found as the original signal of the weakest signal layer, and it is combined with the signal detected by MMSE-OSIC; then, the final signal detection result is obtained. The simulation results show that, compared with three benchmark algorithms, the proposed MMSE-OSIC algorithm has better signal detection performance under the conditions of different modulation methods and different channel numbers.

    Citation: Jikun Guo, Qing Zhao, Lixuan Guo, Shize Guo, Gen Liang. An improved signal detection algorithm for a mining-purposed MIMO-OFDM IoT-based system[J]. Electronic Research Archive, 2023, 31(7): 3943-3962. doi: 10.3934/era.2023200

    Related Papers:

    [1] Tian Xu, Ailong Wu . Stabilization of nonlinear hybrid stochastic time-delay neural networks with Lévy noise using discrete-time feedback control. AIMS Mathematics, 2024, 9(10): 27080-27101. doi: 10.3934/math.20241317
    [2] Yijia Zhang, Tao Xie, Yunlong Ma . Robustness analysis of exponential stability of Cohen-Grossberg neural network with neutral terms. AIMS Mathematics, 2025, 10(3): 4938-4954. doi: 10.3934/math.2025226
    [3] Chengbo Yi, Rui Guo, Jiayi Cai, Xiaohu Yan . Pinning synchronization of dynamical neural networks with hybrid delays via event-triggered impulsive control. AIMS Mathematics, 2023, 8(10): 25060-25078. doi: 10.3934/math.20231279
    [4] Zhifeng Lu, Fei Wang, Yujuan Tian, Yaping Li . Lag synchronization of complex-valued interval neural networks via distributed delayed impulsive control. AIMS Mathematics, 2023, 8(3): 5502-5521. doi: 10.3934/math.2023277
    [5] Miao Zhang, Bole Li, Weiqiang Gong, Shuo Ma, Qiang Li . Matrix measure-based exponential stability and synchronization of Markovian jumping QVNNs with time-varying delays and delayed impulses. AIMS Mathematics, 2024, 9(12): 33930-33955. doi: 10.3934/math.20241618
    [6] Jingyang Ran, Tiecheng Zhang . Fixed-time synchronization control of fuzzy inertial neural networks with mismatched parameters and structures. AIMS Mathematics, 2024, 9(11): 31721-31739. doi: 10.3934/math.20241525
    [7] Hongguang Fan, Jihong Zhu, Hui Wen . Comparison principle and synchronization analysis of fractional-order complex networks with parameter uncertainties and multiple time delays. AIMS Mathematics, 2022, 7(7): 12981-12999. doi: 10.3934/math.2022719
    [8] Pratap Anbalagan, Evren Hincal, Raja Ramachandran, Dumitru Baleanu, Jinde Cao, Chuangxia Huang, Michal Niezabitowski . Delay-coupled fractional order complex Cohen-Grossberg neural networks under parameter uncertainty: Synchronization stability criteria. AIMS Mathematics, 2021, 6(3): 2844-2873. doi: 10.3934/math.2021172
    [9] Li Wan, Qinghua Zhou, Hongbo Fu, Qunjiao Zhang . Exponential stability of Hopfield neural networks of neutral type with multiple time-varying delays. AIMS Mathematics, 2021, 6(8): 8030-8043. doi: 10.3934/math.2021466
    [10] Yanshou Dong, Junfang Zhao, Xu Miao, Ming Kang . Piecewise pseudo almost periodic solutions of interval general BAM neural networks with mixed time-varying delays and impulsive perturbations. AIMS Mathematics, 2023, 8(9): 21828-21855. doi: 10.3934/math.20231113
  • The coal mine internet of things (IoT) communication system is used for real-time monitoring of mining production to ensure the safety and reliability of personnel and equipment in the mine. To eliminate multipath fading in the process of wireless communication in mines, multiple-output multiplexing (MIMO) and orthogonal frequency division multiplexing (OFDM) technologies are introduced. In this paper, a wireless communication system architecture of IoT in mining based on MIMO-OFDM is constructed. Aiming to solve the problems of intersymbol interference and frequency selective fading at the receiver, an improved minimum mean square error ordered successive interferences cancellation (MMSE-OSIC) signal detection algorithm is proposed. First, the signal-to-interference plus noise ratio of the received signal is calculated and the calculation results are sorted. The lowest signal-to-noise ratio is selected as the weakest signal layer. Then, the MMSE-OSIC algorithm is used to extract all of the signals, except the weakest layer. Finally, a maximum likelihood (ML) algorithm is used to traverse the whole signal domain; the signal symbol with the smallest distance from the weakest signal layer is found as the original signal of the weakest signal layer, and it is combined with the signal detected by MMSE-OSIC; then, the final signal detection result is obtained. The simulation results show that, compared with three benchmark algorithms, the proposed MMSE-OSIC algorithm has better signal detection performance under the conditions of different modulation methods and different channel numbers.



    Neural networks (NNs) are computational models that represent the information processing aspect of the human brain's neural network. NNs have been the focus of extensive studies across various domains in recent decades, including but not limited to automatic control [1], transmission of biological information [2], medical image analysis [3], system identification [4], and associate memory [5]. Synchronization is an essential tool for secure communication and biocomputing. It is the process of maintaining consistency in a system's dynamic signals as time passes. Synchronization, a common collective behavior, has emerged as a significant concern in the field of NNs. Researchers have developed various synchronization approaches, including pinning synchronization [6], finite time synchronization [7], and exponential synchronization [8]. In contrast to solitary NNs, coupled NNs (CNNs) exhibit more intricate and imperceptible behaviors. In recent years, researchers have made considerable progress in studying synchronization of CNNs [9,10,11,12].

    Due to the limitations caused by the speed at which signals may travel, specifically the speed at which neuron amplifiers in NNs can switch and transmit, the system trajectory is contingent not only on the previous state but also on the current one. The delay category, also known as neutral-type delay, has the potential to induce instability or other undesirable dynamic behaviors [13,14,15]. Furthermore, the time delays observed in CNNs may be subject to random occurrences due to the temporal signals and synaptic voltage fluctuations transmitted by the transmitters. This can result in extremely large time delay values, despite the extremely low probability that they will occur. A degree of conservatism results if information regarding the range of time delay variations is the only factor considered, without taking their probability into consideration. Thus, a succession of research findings concerning CNNs with probabilistic time-varying latencies are available [16,17,18]. In addition to time delay effects, real NNs are susceptible to impulsive effects when system states undergo instantaneous disturbances or abrupt state changes at specific instants. These effects can have a similar impact on systems' dynamical behaviors as time-delay effects do. Thus far, considerable interest has been devoted to the synchronization or stability of the coupled neutral NNs (CNNNs) [19,20,21] and impulsive coupled NNs (ICNNs) [22,23].

    Nerve signals are conveyed through chaotic electrical pulses in biological nervous systems, which are susceptible to stochastic disturbances and random noises. Frequently used to model these stochastic factors are Gaussian white noise or Brownian motion, considered reasonable approximations. As of now, a multitude of dynamic behaviors exhibited by coupled stochastic NNs, such as synchronization and stability, have been examined through the modeling of randomness using Brownian motion [14,16,20,24,25]. Nevertheless, rare instances are not uncommon among genuine biological neurons. Neuronal impulses discharge and chemical processes in neuronal synaptic receivers generate jump-type noise [26]. Therefore, the Lévy process, which expands Brownian motion to include jump-diffusion, is a more suitable model for these circumstances compared to Brownian motion [27,28,29,30]. Notwithstanding the augmented mathematical intricacy, the findings of this study suggest that examining synchronization in impulsive coupled neutral stochastic NNs (ICNSNNs) propelled by Lévy noise is more significant.

    The majority of the previously published findings on the examination of NNs synchronization necessitate the activation function to adhere to Lipschitz continuity. Nevertheless, in actual situations, the Lipschitz conditions frequently impose excessively stringent requirements, with certain conditions proving exceedingly challenging to fulfill [31]. There has been considerable scholarly activity aimed at easing restrictions on activation functions, including but not limited to one-sided Lipschitz conditions and local Lipschitz conditions [32,33,34]. Accordingly, it is critical, in light of these findings, to derive lower-limit synchronization conditions for ICNSNNs with Lévy noise.

    To attain synchronization among driver-response systems, it is customary to devise control protocols that specifically target the desired control outcome. CNNs are capable of implementing a wide range of control schemes, including adaptive control [13,20], impulsive control [30,35], and event-triggered control [27,28]. It is widely acknowledged that adaptive controllers possess numerous advantages and find utility across diverse domains. Adaptive control is appealing and intriguing due to its robustness and ability to adjust autonomously in response to various updating laws, suitable for systems characterized by strong nonlinearity and discontinuity on the righthand side.

    Based on the preceding discussion, we consider the problem of exponential synchronization in ICNSNNs with Lévy noise, specifically in the presence of non-Lipschitz conditions. The subsequent text provides a concise overview of the main advancements in contrast to the existing body of research.

    1) Compared to earlier neutral stochastic NN models, the model in this study incorporates impulse effects and probabilistic delays into the coupled neutral stochastic NNs, making it more versatile and beneficial in engineering practice.

    2) The requirements necessary for synchronization analysis, which do not need Lipschitz conditions, have been created, therefore relaxing the limitations imposed by Lipschitz conditions.

    3) Due to the lack of satisfaction of the chain rule by the Itô-type stochastic integral, the Dini differential method [16,22,23,35] presents challenges in solving the proof difficulties arising from the combination of impulsive component and neutral delay. Our technique is resistant to the aforementioned limitations and can efficiently tackle these challenges.

    4) Under the stochastic perturbations, impulses, and various delays, by resorting to an adaptive controller, some sufficient conditions have been established to make ICNSNNs with Lévy noise achieve exponential synchronization.

    Notations: Please refer to the following Table 1 for specific symbols.

    Table 1.  Detailed notations.
    (Ω,F,{Ft}t0,P) complete probability space
    {Ft}t0 filtration satisfying the usual conditions
    AT the transpose of a vector or matrix
    Euclidean norm or the matrix trace norm
    χ(θ) left limit of function χ(θ) at θ
    χ(θ+) right limit of function χ(θ) at θ
    diag() diagonal matrix
    ρ() the spectral radius of matrix
    N+ the family of positive integers
    C([G,0];Rn) the family of continuous function χ from [G,0] to Rn
    L2F0([G,0];Rn) the family of all bounded, F0-measurable,
    C(([G,0];Rn)-valued random variables

     | Show Table
    DownLoad: CSV

    We consider the neutral NNs with probabilistic delays of the form

    d[˜χ(t)A˜χ(tG(t))]=[B˜χ(t)+C˜H(˜χ(t))D˜H(˜χ(tP(t)))+˜E]dt, (2.1)

    where the variable ˜x(t)Rn reflects the state of neutral NNs that are connected to n neurons, and ˜H(˜x(t))Rn is the activation function of the neurons. G(t) is time-varying delay and satisfies conditions ˜GG(t)0 and 1>ˉG˙G(t). A is the neutral parameter matrix. B=diag(b1,b2,,bn)>0. ˜ERn. The connection weight matrix is denoted as C, whereas the delay connection weight matrix is denoted as D. The delay P(t) in system (2.1) is bounded and meets condition 0P(t)˜P2. Practically, there is a constant ˜P1 that satisfies 0˜P1˜P2. Moreover, P(t) assumes values within the intervals [0,˜P1] and (˜P1,˜P2] with a specific probability, as determined by its probability distribution, i.e., P{P(t)[0,˜P1]}=K0 and P{P(t)(˜P1,˜P2]}=1K0, 0K01.

    Then

    P(t)={P1(t),P(t)[0,˜P1],P2(t),P(t)(˜P1,˜P2],

    where Pk(t) satisfies 1>¯Pk˙Pk(t),k=1,2. The stochastic variable K(t) follows a Bernoulli distribution, denoted by P{K(t)=1}=P{P(t)[0,˜P1]} and P{K(t)=0}=P{P(t)(˜P1,˜P2]}. Then

    E{K(t)}=1×K0=K0.

    By utilizing the new functions P1(t) and P2(t), together with the stochastic variables K(t), system (2.1) may be reformulated as

    d[˜χ(t)A˜χ(tG(t))]=[B˜χ(t)+C˜H(˜χ(t))+K(t)D˜H(˜χ(tP1(t)))+(1K(t))D˜H(˜χ(tP2(t)))+˜E]dt. (2.2)

    The system (2.2) is considered the drive system, with the state variable represented as ˜χ(t). The response system, on the other hand, is described by the following ICNSNN, with the state variable denoted as ˜yk(t). ek(t)=˜yk(t)˜χ(t) specifies the following error vector:

    d[˜yk(t)A˜yk(tG(t))]=[B˜yk(t)+C˜H(˜yk(t))+K(t)D˜H(˜yk(tP1(t)))+(1K(t))D˜H(˜yk(tP2(t)))+˜ϱNj=1okjΥ˜yj(t)+˜E+Ψk]dt+μ(ek(t),ek(tG(t)),ek(tP1(t)),ek(tP2(t)))dω(t)+Vq(ek(t),ek(tG(t)),ek(tP1(t)),ek(tP2(t)),ν)˜N(dt,dν),tσl,lN+,Δ˜yk(σl)=˜yk(σl)˜y(σl)=˜Jl(ek(σl),ek(σlG(σl)))+Aek(σlG(σl))Aek(σlG(σl)),t=σl. (2.3)

    In system (2.3), the control input vector, denoted as Ψk=(φk1,φk2,,φkn)TRn, k=1,...,N, represents the control inputs for a system. ˜ϱ>0 is coupling strength. The configuration matrix O={okj}N×N denotes the topological structure of systems. A connection from node k to j is defined as okj>0, otherwise okj=0. Additionally, okk=Nj=1,jkokj. The positive definite diagonal matrix Υ represents the internal connection strength between two interconnected NNs. ek(σl)=ek(σ+l)=limtσ+lek(t) and ek(σl)=limtσlek(t). ˜Jl(,)Rn. The impulsive time instants, denoted as σl, follow the conditions 0=σ0<σ1<σ2<<σl<, and limkσl=. μ:Rn×Rn×Rn×RnRn×n and q:Rn×Rn×Rn×Rn×VRn indicate Lévy noise intensity functions. A vector Brownian motion is denoted by ω(t), which is defined on the probability space (Ω,F,{Ft}t0,P), where {Ft}t0 meets the standard conditions. N(dt,dν) is a Poisson counting measure utilizing a characteristic measure π on a measurable subset V of R, whereas N(t,ν) represents a Poisson process. ˜N(dt,dν)=N(dt,dν)π(dν)dt. The research operates under the assumption that stochastic processes ω and N are independent.

    According to systems (2.2) and (2.3) and the quality of matrix O,

    ˜ϱNj=1okjΥ˜yj(t)=˜ϱNj=1okjΥ(ej(t)+˜χ(t))=˜ϱNj=1okjΥej(t),

    the error dynamics system can be obtained such that

    d[ek(t)Aek(tG(t))]=[Bek(t)+CH(ek(t))+K(t)DH(ek(tP1(t)))+(1K(t))DH(ek(tP2(t)))+˜ϱNj=1okjΥej(t)+Ψk]dt+μ(ek(t),ek(tG(t)),ek(tP1(t)),ek(tP2(t)))dω(t)+Vq(ek(t),ek(tG(t)),ek(tP1(t)),ek(tP2(t)),ν)˜N(dt,dν),tσl,lN+,Δek(σl)=ek(σl)ek(σl)=˜Jl(ek(σl),ek(σlG(σl)))+Aek(σlG(σl))Aek(σlG(σl)),t=σl, (2.4)

    in which H(ek(t))=˜H(˜yk(t))˜H(˜χ(t)), H(ek(tP1(t)))=˜H(˜yk(tP1(t)))˜H(˜χ(tP1(t))), and H(ek(tP2(t)))=˜H(˜yk(tP2(t)))˜H(˜χ(tP2(t))), where ˜G0=max(˜G,˜P2). To establish synchronization, we assume control is defined as

    Ψk=(φk(t)I)(ek(t)Aek(tG(t))), (2.5)

    where represents a nonnegative real number. The adaptive feedback gain is denoted as φk(t)=diag(φk1(t),φk2(t),...,φkn(t))(k=1,...,N).

    To determine the synchronization requirements for systems (2.2) and (2.3), we provide the following assumptions.

    A1 There is a constant ϱ>0 that fulfills

    ˜H(θ1)˜H(θ2)2ϱϖ(θ1θ22),

    for θ1,θ2Rn, ˜H(0)=0, where ϖ():R+R+ is a concave increasing continuous function with ϖ(0)=0 and 10duϖ(u)=. Additionally, it is supposed that there exist a positive constant ϖ0 and a nonnegative function κ(t) with finite upper bound, such that

    ϖ(x)ϖ0x+κ(t),

    for x0. Here, κ(t) meets t0exp(ϑs)κ(s)ds< for ϑ>0.

    A2 There exist constants Λ1>0, Λ2>0, Λ3>0, Γ1>0, Γ2>0, and Γ3>0 such that

    trace(μ(θ1,θ2,θ3,θ4)Tμ(θ1,θ2,θ3,θ4))Λ1θ12+Λ2θ22+Λ3θ3+Λ4θ4,2

    and

    Vq(θ1,θ2,θ3,θ4,ν)2π(dν)Γ1θ12+Γ2θ22+Γ3θ32+Γ4θ42,

    hold for θ1,θ2,θ3,θ4Rn. In addition, μ(0,0,0)=0 and q(0,0,0,0)=0.

    A3 There exists a constant ς(0,1), which ensures that ρ(A) fulfills ρ(A)ς.

    A4 The function ˜Jl(,) is assumed to meet the specified conditions.

    ˜Jl(ek(σl),ek(σlG(σl)))T˜Jl(ek(σl),ek(σlG(σl)))Ξlek(σl)Aek(σlG(σl))2,

    where Ξl>0.

    Remark 2.1. If ϖ(x)=x, then the Lipschitz criteria are satisfied, indicating that the assumption A1 is less stringent than the prerequisite of the Lipschitz continuity. Certain activation functions do not meet the criteria for Lipschitz continuity, yet they do exhibit non-Lipschitz continuity in practical applications. For example, if we are examining a function ˜H(x)=xsinx that fails to meet the criteria of Lipschitz continuity, we may construct the concave nondecreasing function

    ϖ(θ)={θlog(1+θ1),θ[0,ϵ),ϵlog(1+θ1)+ϖ(ϵ)(θϵ),θ[ϵ,),

    for small enough ϵ(0,1)[36], so that ˜H(x) encounters the assumption A1.

    According to the literature [36,37,38], for any initial value {ek(ϵ):˜G0ϵ0}=ϕ0kL2F0([˜G0,0];Rn), the assumptions A1-A4 are believed to demonstrate that the solution symbolized by ek(t,ϕ0k) on t0 to the system (2.4) is both existent and unique. Evidently, the system (2.4) allows for ek(t,0)=0. The expressions ek(t,ϕ0k), ek(tG(t)), ek(tP1(t)), and ek(tP2(t)) will be referred to as ek(t), ekG(t), ekP1(t), and ekP2(t), respectively, for simplicity.

    Lemma 2.1. [30,39] Consider the function δ(t), which is piecewise continuous and nonnegative. It fulfills the condition

    δ(t)˜λ1+tt0˜λ2δ(u)du+t0<ti<t˜λ3δ(ti),

    where ti are the points of discontinuity of the first type for δ(t). Additionally, we have ˜λ10, ˜λ20, ˜λ30. Then, for ti<tti+1,

    δ(t)˜λ1(1+˜λ3)i(t0,t)exp(˜λ2(tt0)).

    Here, the notation i(t0,t) signifies the number of points ti that lie inside the interval [t0,t).

    Definition 2.1. [20] The drive system (2.2) and the response system (2.3) are considered to be exponentially synchronized in mean square (ESMS) if the error system (2.4) is exponentially stable in mean square, meaning that for all ϕ0kL2F0([˜G0,0];Rn),

    lim supt1tlog(ENk=1ek(t)2)<0.

    This section will provide the general requirements for the ESMS in systems (2.2) and (2.3) based on the assumptions A1A4 mentioned above.

    Theorem 3.1. Assume that conditions A1A4 are satisfied. If

    ˜1>0,ϑ˜3m1ln(1+˜2)>0), (3.1)

    where

    ˜1=(1˜)1{(1+)E[Ni=1(ek(0)AekG(0))T(ek(0)AekG(0))]+(1+)(1ˉG)1[ϑς(1+ς)+2ς2+ς(1+ς)+2ς(1ς)+˜ϱNomax|Υ|ς(1+ς)+Λ2+Γ2]0G(0)exp(ϑ(s+˜G))sup0stENk=1ek(s)2ds+(1+)(1¯P1)1[K0˜d2maxϱϖ0+Λ3+Γ3]0P1(0)exp(ϑ(s+~P1))sup0stENk=1ek(s)2ds+(1+)(1¯P2)1[(1K0)˜d2maxϱϖ0+Λ4+Γ4]0P2(0)exp(ϑ(s+~P2))sup0stENk=1ek(s)2ds+(1+)ϱ(1+c2max+˜d2max)Nt0exp(ϑs)κ(s)ds+˜sup˜Gs0ENk=1ek(s)2},˜2=˜Ξ(1+)(1˜)1(ς+(1+ς)1),˜3=(1˜)1(1+){ϑ(1+ς)2bmin+c2max+ϱϖ0+b2max+c2maxϱϖ0+(1+ς)2(1ς)+˜ϱNomax|Υ|(2+ς)+Λ1+Γ1+11ˉGexp(ϑ˜G)[ϑς(1+ς)+2ς2+ς(1+ς)+2ς(1ς)+˜ϱNomax|Υ|ς(1+ς)+Λ2+Γ2]+11¯P1exp(ϑ~P1)[K0˜d2maxϱϖ0+Λ3+Γ3]+11¯P2exp(ϑ~P2)[(1K0)˜d2maxϱϖ0+Λ4+Γ4]},bmin=min1jnbj,bmax=max1jnbj,cmax=ρ(C),˜dmax=ρ(D),omax=max1k,jN|okj|,

    then when the adaptive controller (2.5) with update rule

    ˙φkj(t)=1υkjexp(ϑt)(ekj(t)ni=1akieki(tG(t)))2,

    is applied, where υkj>0,k=1,...,N,j=1,2,,n, the systems (2.3) and (2.2) are ESMS.

    Proof. Define

    V(t,ek(t)AekG(t))=exp(ϑt)Nk=1(ek(t)AekG(t))T(ek(t)AekG(t))+Nk=1nj=1υkjφ2kj.

    By adopting the general Itˆo's formula [40] for the interval t(σl,σl+1) and doing integration on both sides from σl to t, we derive

    V=V(σl,ek(σl)AekG(σl))+tσlLVds+tσl2Nk=1exp(ϑs)(ek(s)AekG(s))T×μ(ek(s),ekG(s),ekP1(s),ekP2(s))dω(s)+tσlZexp(ϑs)[Nk=1(ek(s)AekG(s))+q(ek(s),ekG(s),ekP1(s),ekP2(s),ν))T×(ek(s)AekG(s)+q(ek(s),ekG(s),ekP1(s),ekP2(s),ν))Nk=1(ek(s)AekG(s))T(ek(s)AekG(s))]˜N(ds,dν), (3.2)

    where

    LV=2Nk=1nj=1υkjφkj˙φkj+ϑexp(ϑt)Nk=1(ek(t)AekG(t))T(ek(t)AekG(t))+2exp(ϑt)Nk=1(ek(t)AekG(t))T[Bek(t)+CH(ek(t))+K(t)DH(ekP1(t))+(1K(t))DH(ekP2(t))+ϱNj=1okjΥej(t)+Ψk]+exp(ϑt)Nk=1trace(μ(ek(t),ekG(t),ekP1(t),ekP2(t))T×μ(ek(t),ekG(t),ekP1(t),ekP2(t)))+Vexp(ϑt)Nk=1[(ek(t)AekG(t)+q(ek(t),ekG(t),ekP1(t),ekP2(t),ν))T×(ek(t)AekG(t)+q(ek(t),ekG(t),ekP1(t),ekP2(t),ν))(ek(t)AekG(t))T(ek(t)AekG(t))2(ek(t)AekG(t))Tq(ek(t),ekG(t),ekP1(t),ekP2(t),ν)]π(dν).

    Through employing Young's inequality, one may infer that

    tσlϑexp(ϑs)Nk=1(ek(s)AekG(s))T(ek(s)AekG(s))dsϑ(1+ς)tσlexp(ϑs)Nk=1ek(s)Tek(s)ds+ϑς(1+ς)tσlexp(ϑs)Nk=1eTkG(s)ekG(s)ds. (3.3)

    Based on the given assumptions A1, we may conclude that

    2tσlexp(ϑs)Nk=1(ek(s)AekG(s))T[Bek(s)+CH(ek(s))]dstσlexp(ϑs)Nk=1[2ek(s)TBek(s)+ek(s)TCTCek(s)+H(ek(s))TH(ek(s))+eTkG(s)ATAekG(s)+ek(s)TBTBek(s)+eTkG(s)ATAekG(s)+H(ek(s))TCTCH(ek(s))]dstσlexp(ϑs)Nk=1[2bmin+c2max+ϱϖ0+b2max+c2maxϱϖ0]ek(s)Tek(s)ds+tσlexp(ϑs)Nk=12ς2eTkG(s)ekG(s)+tσlexp(ϑs)Nk=1(1+c2max)ϱκ(s)ds, (3.4)

    and

    2tσlexp(ϑs)Nk=1(ek(s)AekG(s))T[K(s)DH(ekP1(s))+(1K(s))DH(ekP2(s))]dstσlexp(ϑs)[K(s)(ek(s)AekG(s))T(ek(s)AekG(s))+K(s)H(ekP1(s))TDTDH(ekP1(s))+(1K(s))(ek(s)AekG(s))T(ek(s)AekG(s))+(1K(s))H(ekP2(s))TDTDH(ekP2(s))]dstσlexp(ϑs)Nk=1(1+ς)ek(s)Tek(s)ds+tσlexp(ϑs)ς(1+ς)Nk=1eTkG(s)ekG(s)ds+tσlexp(ϑs)Nk=1K(s)˜d2maxϱϖ0eTkP1(s)ekP1(s)ds+tσlexp(ϑs)Nk=1(1K(s))˜d2maxϱϖ0eTkP2(s)ekP2(s)ds+tσlexp(ϑs)Nk=1˜d2maxϱκ(s)ds. (3.5)

    Comparable to (3.3), it is possible to get

    2tσlexp(ϑs)Nk=1(ek(s)AekG(s))T[(ek(s)Aek(sG(s)))]dstσlexp(ϑs)Nk=1(2(1ς)eTk(s)ek(s))ds+tσlexp(ϑs)Nk=12ς(1ς)eTkG(s)ekG(s)ds. (3.6)

    Besides, we have

    2tσlexp(ϑs)Nk=1(ek(s)AekG(s))T[˜ϱNj=1okjΥej(t)]dstσlexp(ϑs)Nk=1˜ϱNomax|Υ|[eTk(s)ek(s)+(ek(s)AekG(s))T(ek(s)AekG(s))]dstσlexp(ϑs)Nk=1˜ϱNomax|Υ|(2+ς)ek(s)Tek(s)ds+tσlexp(ϑs)Nk=1˜ϱNomax|Υ|ς(1+ς)eTkG(s)ekG(s)ds. (3.7)

    Following the assumption A2, there exist

    tσlexp(ϑs)Nk=1trace(μ(ek(s),ekG(s),ekP1(s),ekP2(s))Tμ(ek(s),ekG(s),ekP1(s),ekP2(s)))tσlexp(ϑs)Nk=1[Λ1eTk(s)ek(s)+Λ2eTkG(s)ekG(s)+Λ3eTkP1(s)ekP1(s)+Λ4eTkP2(s)ekP2(s)]ds, (3.8)

    and

    tσlVexp(ϑt)Nk=1[(ek(t)AekG(t)+q(ek(t),ekG(t),ekP1(t),ekP2(t),ν))T(ek(t)AekG(t)+q(ek(t),ekG(t),ekP1(t),ekP2(t),ν))(ek(t)AekG(t))T(ek(t)AekG(t))2(ek(t)AekG(t))Tq(ek(t),ekG(t),ekP1(t),ekP2(t),ν)]π(dν)dstσlVexp(ϑs)Nk=1[Γ1eTk(s)ek(s)+Γ2eTkG(s)ekG(s)+Γ3eTkP1(s)ekP1(s)+Γ4eTkP2(s)ekP2(s)]ds. (3.9)

    When t=σl, it produces

    EV(σl,ek(σl)ekG(σl))=E[exp(ϑσl)Nk=1|ek(σl)+˜Jl(ek(σl),ekG(σl))+AekG(σl)AekG(σl)AekG(σl)|2+Nk=1nj=1υkjφ2kj](1+Ξl)E[exp(ϑσl)Nk=1(ek(σl)AekG(σl))T(ek(σl)AekG(σl))+Nk=1nj=1υkjφ2kj]=˜ΞEV(σl,ek(σl)AekG(σl)),

    where ˜Ξ=maxlN+{1+Ξl}. By replacing (3.3)–(3.9) into (3.2) and subsequently calculating the mathematical expectation for both sides of (3.2), it yields

    EV=EV(σl,ek(σl)ekG(σl))+tσlLVds.

    Therefore, for any values of t inside the interval [0,σl+1), it follows that

    EV=E[Nk=1(ek(0)AekG(0))T(ek(0)AekG(0))]+0<σl<tEV(σl,ek(σl)AekG(σl)+t0LVdsE[Nk=1(ek(0)AekG(0))T(ek(0)AekG(0))]+˜Ξ0<σl<tEV(σl,ek(σl)AekG(σl))+[ϑ(1+ς)2bmin+c2max+ϱϖ0+b2max+c2maxϱϖ0+(1+ς)2(1ς)+˜ϱNomax|Υ|(2+ς)+Λ1+Γ1]t0exp(ϑs)Nk=1ek(s)2ds+[ϑς(1+ς)+2ς2+ς(1+ς)+2ς(1ς)+˜ϱNomax|Υ|ς(1+ς)+Λ2+Γ2]Et0exp(ϑs)Nk=1ekG(s)2ds+[K0˜d2maxϱϖ0+Λ3+Γ3]Et0exp(ϑs)Nk=1ekP1(s)2ds+[(1K0)˜d2maxϱϖ0+Λ4+Γ4]Et0exp(ϑs)Nk=1ekP2(s)2ds+ϱ(1+c2max+˜d2max)t0exp(ϑs)Nk=1κ(s)ds.

    Since

    t0exp(ϑs)Nk=1ekG(s)2ds11ˉG0G(0)exp(ϑ(s+˜G))Nk=1ek(s)2ds+11ˉGexp(ϑ˜G)t0exp(ϑs)Nk=1ek(s)2ds,
    t0exp(ϑs)Nk=1ekP1(s)2ds11¯P10P1(0)exp(ϑ(s+~P1))Nk=1ek(s)2ds+11¯P1exp(ϑ~P1)t0exp(ϑs)Nk=1ek(s)2ds,

    and

    t0exp(ϑs)Nk=1ekP2(s)2ds11¯P20P2(0)exp(ϑ(s+~P2))Nk=1ek(s)2ds+11¯P2exp(ϑ~P2)t0exp(ϑs)Nk=1ek(s)2ds,

    it can be deduced that

    EVE[Nk=1(ek(0)AekG(0))T(ek(0)AekG(0))]+11ˉG[ϑς(1+ς)+2ς2+ς(1+ς)+2ς(1ς)+˜ϱNomax|Υ|ς(1+ς)+Λ2+Γ2]0G(0)exp(ϑ(s+˜G))Nk=1Eek(s)2ds+11¯P1[K0˜d2maxϱϖ0+Λ3+Γ3]0P1(0)exp(ϑ(s+~P1))Nk=1Eek(s)2ds+11¯P2[(1K0)˜d2maxϱϖ0+Λ4+Γ4]0P2(0)exp(ϑ(s+~P2))Nk=1Eek(s)2ds+ϱ(1+c2max+˜d2max)Nt0exp(ϑs)κ(s)ds+˜Ξ0<σl<tEV(σl,ek(σl)AekG(σl))+{ϑ(1+ς)2bmin+c2max+ϱϖ0+b2max+c2maxϱϖ0+(1+ς)2(1ς)+˜ϱNomax|Υ|(2+ς)+Λ1+Γ1+11ˉGexp(ϑ˜G)[ϑς(1+ς)+2ς2+ς(1+ς)+2ς(1ς)+˜ϱNomax|Υ|ς(1+ς)+Λ2+Γ2]+11¯P1exp(ϑ~P1)[K0˜d2maxϱϖ0+Λ3+Γ3]+11¯P2exp(ϑ~P2)[(1K0)˜d2maxϱϖ0+Λ4+Γ4]}t0exp(ϑs)Nk=1Eek(s)2ds.

    In addition, employing the inequality in reference [36], it can be yielded that

    (γ1+γ2)2(1+ε)[γ21+ε1γ22],γ1,γ2,ε0,

    and we have

    sup0stexp(ϑs)ENk=1ek(s)2(1+)1ς2(1+)1exp(ϑ˜G)sup0stexp(ϑs)ENk=1ek(s)AekG(s)2+ς2(1+)1exp(ϑ˜G)1ς2(1+)1exp(ϑ˜G)sup˜Gs0ENk=1ek(s)2,

    where >0 is sufficiently large for ˜=ς2(1+)1exp(ϑ˜G)<1. Then,

    sup0stexp(ϑs)ENk=1ek(s)2(1˜)1{(1+)E[Nk=1(ek(0)AekG(0))T(ek(0)AekG(0))]+(1+)(1ˉG)1[ϑς(1+ς)+2ς2+ς(1+ς)+2ς(1ς)+˜ϱNomax|Υ|ς(1+ς)+Λ2+Γ2]0G(0)exp(ϑ(s+˜G))sup0stENk=1ek(s)2ds+(1+)(1¯P1)1[K0˜d2maxϱϖ0+Λ3+Γ3]0P1(0)exp(ϑ(s+~P1))sup0stENk=1ek(s)2ds+(1+)(1¯P2)1[(1K0)˜d2maxϱϖ0+Λ4+Γ4]0P2(0)exp(ϑ(s+~P2))sup0stENk=1ek(s)2ds+(1+)ϱ(1+c2max+˜d2max)Nt0exp(ϑs)κ(s)ds+˜sup˜Gs0ENk=1ek(s)2}+˜Ξ(1+)(1˜)1(ς+(1+ς)1)0<σl<tsup0stexp(ϑσl)ENk=1ek(σl)2+(1˜)1(1+){ϑ(1+ς)2bmin+c2max+ϱϖ0+b2max+c2maxϱϖ0+(1+ς)2(1ς)+˜ϱNomax|Υ|(2+ς)+Λ1+Γ1+11ˉGexp(ϑ˜G)[ϑς(1+ς)+2ς2+ς(1+ς)+2ς(1ς)+˜ϱNomax|Υ|ς(1+ς)+Λ2+Γ2]+11¯P1exp(ϑ~P1)[K0˜d2maxϱϖ0+Λ3+Γ3]+11¯P2exp(ϑ~P2)[(1K0)˜d2maxϱϖ0+Λ4+Γ4]}t0sup0stexp(ϑs)ENk=1ek(s)2ds=˜1+˜20<σl<tsup0stexp(ϑσl)ENk=1ek(σl)2+˜3t0sup0stexp(ϑs)ENk=1ek(s)2ds.

    Thus, Lemma 2.1 subsequently results in

    sup0stexp(ϑs)ENk=1ek(s)2˜1(1+˜2)kexp(˜3t).

    Based on the inequality minflN(σl+1σl), we ultimately get

    sup0stENk=1ek(s)2˜1exp((ϑ˜3m1ln(1+˜2))t).

    With respect to criterion (3.1), it may be concluded that systems (2.2) and (2.3) are ESMS.

    Remark 3.1. Based on our comprehension, certain current CNNN and neutral NN models [13,14,15,19,20] do not take into account the impact of impulses. This research explores a wider model by incorporating impulsive effects. The Dini differential technique[16,22,23,35] is not applicable to our primary problem since it involves a combination of neutral delay and impulsive factors, and Itô-type stochastic integrals do not adhere to the chain rule. The proof strategy outlined in Theorem 3.1 offers a method for resolving the difficulty.

    Remark 3.2. Activation functions are required to provide Lipschitz continuity in several studies on the synchronization or stability of CNNs, CNNNs, and neutral NNs, as indicated by the references [13,20,22,27,35]. Theorem 3.1 provides sufficient criteria for achieving synchronization in the drive-response system without the need for the Lipschitz situation, therefore relaxing the limitations imposed by Lipschitz conditions. As a result, this study extends the current findings (see [13,20,22,27,35]).

    When Lévy jump q(ek(t),ek(tG(t)),ek(tP1(t)),ek(tP2(t)),ν)=0, the coupled error system (2.4) reduced to the following form:

    d[ek(t)Aek(tG(t))]=[Bek(t)+CH(ek(t))+K(t)DH(ek(tP1(t)))+(1K(t))DH(ek(tP2(t)))+ϱNj=1okjΥej(t)+Ψk]dt+μ(ek(t),ek(tG(t)),ek(tP1(t)),ek(tP2(t)))dω(t)tσl,lN+,Δek(σl)=ek(σl)ek(σl)=˜Jl(ek(σl),ek(σlG(σl)))+Aek(σlG(σl))Aek(σlG(σl)),t=σl. (3.10)

    Under these circumstances, we ascertain the subsequent outcomes.

    Corollary 3.1. If conditions A1A4 are fulfilled, for

    ˜1>0,ϑ˜3m1ln(1+˜2)>0,

    where

    ˜1=(1˜)1{(1+)E[Nk=1(ek(0)AekG(0))T(ek(0)AekG(0))]+(1+)(1ˉG)1[ϑς(1+ς)+2ς2+ς(1+ς)+2ς(1ς)+˜ϱNomax|Υ|ς(1+ς)+Λ2]0G(0)exp(ϑ(s+˜G))sup0stENk=1ek(s)2ds+(1+)(1¯P1)1[K0˜d2maxϱϖ0+Λ3]0P1(0)exp(ϑ(s+~P1))sup0stENk=1ek(s)2ds+(1+)(1¯P2)1[(1K0)˜d2maxϱϖ0+Λ4]0P2(0)exp(ϑ(s+~P2))sup0stENk=1ek(s)2ds+(1+)ϱ(1+c2max+˜d2max)Nt0exp(ϑs)κ(s)ds+˜sup˜Gs0ENk=1ek(s)2},˜2=˜Ξ(1+)(1˜)1(ς+(1+ς)1),˜3=(1˜)1(1+){ϑ(1+ς)2bmin+c2max+ϱϖ0+b2max+c2maxϱϖ0+(1+ς)2(1ς)+˜ϱNomax|Υ|(2+ς)+Λ1+11ˉGexp(ϑ˜G)[ϑς(1+ς)+2ς2+ς(1+ς)+2ς(1ς)+˜ϱNomax|Υ|ς(1+ς)+Λ2]+11¯P1exp(ϑ~P1)[K0˜d2maxϱϖ0+Λ3]+11¯P2exp(ϑ~P2)[(1K0)˜d2maxϱϖ0+Λ4]},

    then when the adaptive controller (2.5) with update rule

    ˙φkj(t)=1υkjexp(ϑt)(ekj(t)ni=1akieki(tG(t)))2,

    is applied, where υkj>0,k=1,...,N,j=1,2,,n, the systems (2.3) and (2.2) are ESMS.

    Proof. Define

    V(t,ek(t)AekG(t))=exp(ϑt)Nk=1(ek(t)AekG(t))T(ek(t)AekG(t))+Nk=1nj=1υkjφ2kj.

    Employing Theorem 3.1 readily proves the result of Corollary 3.2, hence the proof is omitted in this context.

    This section presents numerical simulations to demonstrate the efficacy of our suggested strategy.

    Example 4.1. Consider the following two-dimensional neutral NNs with probabilistic delays, where

    ˜H(˜χ(t))=tanh(˜χ(t)),G(t)=0.4+0.1cos(2t),
    P1(t)=0.35+0.1cos(2t),P2(t)=0.39+0.1cos(2t),
    A=[0.10.150.150.1],B=[0.75000.85],C=[2.10.32.83.3],D=[3.50.250.81.7],

    ˜χ(t)=(˜χ1(t),˜χ2(t))T, P{K(t)=0}=0.2, E=[0.1,0.1]T. The initial values are ˜χ(t)=[2.3,2.6]T. The parameters of the corresponding response system could be expressed as follows.

    ˜Jl(ek(σl),ek(σlG(σl)))=Q(ek(σl)Aek(σlG(σl))),l=1,...,25.
    μ(ek(t),ekG(t),ekP1(t),ekP2(t))=diag{0.2ek1(t)+0.15ek1G(t)+0.2ek1P1(t)+0.1ek1P2(t),0.1ek2(t)+0.15ek2G(t)+0.2ek2P1(t)+0.1ek2P2(t)},
    q(ek(t),ekG(t),ekP1(t),ekP2(t),ν)=[1.3(ek1(t)+ek1(tG(t)))ν,1.5(ek2(t)+ek2(tP1(t))ν]T,
    Υ=[1001],O=[0.350.20.150.120.1200.110.0.190.3],Q=[0.40.150.350.4],

    ˜yk(t)=(˜yk1(t),˜yk2(t))T. ˜y1(t)=[1.2,1.4]T, ˜y2(t)=[1.5,1.8]T, ˜y3(t)=[2.2,2.4]T. φkj(t)=0,k=1,2,3,j=1,2. ϱ=0.5. The approaches provided in references [13,14,15,19,20] are not applicable to this particular instance. Verifying that the parameters in Example 4.1 fulfill the constraints of Theorem 3.1 is straightforward. Consequently, Theorem 3.1 may be utilized to establish that the response system (2.3) should be considered ESMS in theoretical analysis, together with the driving system (2.2). The simulated findings depicted in Figures 14 unequivocally validate our conclusion. We can find that the error systems in Figure 3 (a)(b) converge to zero as time progresses. Figure 4 depicts the evolutionary trajectory of the adaptive feedback gain φkj(t)(k=1,2,3,j=1,2).

    Figure 1.  The trajectory of system (2.2).
    Figure 2.  The time evolutions of ˜χj(t) and ˜ykj(t).
    Figure 3.  The time evolutions of errors ekj(t).
    Figure 4.  The trajectory of controller gain φkj(t).

    Example 4.2. Consider the following two-dimensional neutral NNs with probabilistic delays, where

    ˜H(˜χ(t))=˜χ(t)sin(˜χ(t)),G(t)=0.4+0.1cos(t),
    P1(t)=0.35+0.1cos(t),P2(t)=0.38+0.1cos(t),
    A=[0.090.150.250.01],B=[0.85000.8],C=[2.60.51.52.3],D=[3.10.50.52.5],

    ˜χ(t)=(˜χ1(t),˜χ2(t))T, P{K(t)=0}=0.2, E=[0.1,0.1]T. The initial values are ˜χ(t)=[3.2,3.4]T. The parameters of the corresponding response system can be given as

    ˜Jl(ek(σl),ek(σlG(σl)))=Q(ek(σl)Aek(σlG(σl))),l=1,...,25.
    μ(ek(t),ekG(t),ekP1(t),ekP2(t))=diag{0.2ek1(t)+0.15ek1G(t)+0.2ek1P1(t)+0.1ek1P2(t),0.1ek2(t)+0.15ek2G(t)+0.2ek2P1(t)+0.1ek2P2(t)},
    q(ek(t),ekG(t),ekP1(t),ekP2(t),ν)=[1.3(ek1(t)+ek1(tG(t)))ν,1.5(ek2(t)+ek2(tP1(t))ν]T,
    Υ=[1001],O=[0.40.20.20.10.250.150.250.150.4],Q=[0.20.10.150.2],

    k=1,2,3. ˜yk(t)=(˜yk1(t),˜yk2(t))T. ˜y1(t)=[2.2,2.4]T, ˜y2(t)=[1.3,1.1]T, ˜y3(t)=[2.6,2.8]T. φkj(t)=0,k=1,2,3,j=1,2. ϱ=0.5. By Remark 2.1, the activation function ˜H() in this instance does not meet the Lipschitz continuity. When ϵ=0.001, ϖ0=13, and κ(t)=exp(2ϑt) are used, then the parameters in this example fulfill the circumstances of Theorem 3.1, implying that the systems (2.2) and (2.3) should be ESMS in the theoretical analysis. Figures 58 display the results of the simulation, which amply supports our conclusion. Figure 6 shows the trajectories of the system (2.2) and the system (2.3) among them, and it is evident that as time goes on, their trajectories become consistent. The error's trajectory converges to zero, as illustrated in Figure 7. Figure 8 illustrates the evolutionary trajectory of the feedback gain φkj(t)(k=1,2,3,j=1,2).

    Figure 5.  The trajectory of system (2.2).
    Figure 6.  The time evolutions of ˜χj(t) and ˜ykj(t).
    Figure 7.  The time evolutions of errors ekj(t).
    Figure 8.  The trajectory of controller gain φkj(t).

    Through adaptive controller, we address the problem of exponential synchronization in ICNSNNs with Lévy noise and probabilistic time delays in cases where the conditions are non-Lipschitz. We additionally discover sufficient criteria for achieving ESMS. In this research, we enhance the practicality of the examined model by incorporating impulse and probabilistic time-varying delays in coupled neutral stochastic NNs, as compared to previous findings[13,14,15,19,20]. The activation function's Lipschitz continuity is not necessary for our investigation, suggesting that our criteria acquired are less limiting than existing ones and can be used in a broader range of situations. Furthermore, the findings of this study propose an approach to the challenge of analyzing synchronization, which arises from the presence of both a neutral delay term and an impulse term. Finally, we present two numerical illustrations that confirm the theoretical discoveries.

    In the non-Lipschitz case, developing the discriminant criteria for the exponential synchronization of ICNSNNs with Lévy noise is still a challenging issue. In addition, more discussion is required on the relaxation of the time delay condition. Lately, there has been a significant focus on the dynamic characteristics of systems that utilize event-triggered control and sliding-mode control. This is evident in the relevant literature [41,42,43,44,45]. Such issues deserve extra investigation and analysis.

    S. M.: Conceptualization; S. M. and JM. L.: Writing-original draft; S. M. and Q. L.: Writing-review & editing; JM. L. and RN. L.: Visualization. All authors have read and agreed to the published version of the manuscript.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    The work was supported in part by the Fundamental Research Funds for the Central Universities, North Minzu University under Grant No.2020KYQD17, and in part by the National Natural Science Foundation of China under Grant No. 12202005, and in part by the High-Level Talent Research Foundation of Anhui Agricultural University under Grant No. RC382106, and in part by the Philosophy and Social Science Foundation of Universities of Anhui Province under Grant No. 2023AH050970, and in part by the Nature Science Foundation of Jiangsu Province under Grant No. BK20220233, and in part by the Ningxia Outstanding Talent Support Program.

    The authors declare no conflict of interest.



    [1] Y. Liu, Application of 5G in mine communication (in Chinese), in Proceedings of the 29th National Coal Mine Automation and Informatization Academic Conference and the 10th China Coal Mine Informatization and Automation High Level Forum-Coal Mine Automation and Informatization, China, (2020), 4. https://doi.org/10.26914/c.cnkihy.2020.070056
    [2] L. Cimini, Analysis and simulation of a digital mobile channel using orthogonal frequency division multiplexing, IEEE Trans. Commun., 33 (1985), 665–675. https://doi.org/10.1109/TCOM.1985.1096357 doi: 10.1109/TCOM.1985.1096357
    [3] D. Li, J. Yu, M. Wang, S. Zhang, An improved SLM scheme with low implementation complexity to reduce PAPR performance of OFDM systems, in 2013 6th International Congress on Image and Signal Processing (CISP), IEEE, Hangzhou, China, (2013), 1499–1503. https://doi.org/10.1109/CISP.2013.6743912
    [4] S. Yoon, Comparisons of two detectors for a trade-off between complexity and performance in MIMO-OFDM systems, in IEEE 7th International Conference on Computer and Automation Engineering (ICCAE), IEEE, Chongqing, China, (2011), 528–535.
    [5] S. F. Zhao, Research on low-complexity signal detection Algorithms for uplink massive MIMO systems (in Chinese), Chongqing Univ. Posts Telecommun., (2018). https://doi.org/10.27675/d.cnki.gcydx.2018.000691
    [6] L. Mao, L Zhu, L. F. Cheng, Overview of signal detection algorithms in MIMO communication systems (in Chinese), Commun. Inf. Technol., 261 (2023), 13–15, 24.
    [7] J. P. Sun, H. P. Chen, Smart mine with 5G and WiFi6 (in Chinese), J. Mine Autom., 45 (2019), 1–4. https://doi.org/10.13272/j.issn.1671-251x.17517 doi: 10.13272/j.issn.1671-251x.17517
    [8] Y. L. Wang, P. Zhang, J. Zhang, Application research of MIMO-OFDM technology in underground coal mine (in Chinese), Comput. Technol. dev., 8 (2014), 191–193,198.
    [9] S. H. Yao, X. L. Wu, Research on MIMO-OFDM for improving wireless communication performance in mine (in Chinese), J. Hefei Univ. Technol. (Nat. Sci.), 32 (2009), 557–559+590.
    [10] S. H. Yao, X. L. Wu, Modeling and performance simulation for mine MIMO wireless channels (in Chinese), J. Syst. Simul., 22 (2010), 2432–2434. https://doi.org/10.16182/j.cnki.joss.2010.10.022 doi: 10.16182/j.cnki.joss.2010.10.022
    [11] X. G. Zhang, L. L. Li, H. D. Zheng, Z. J. Wang, Modeling and channel capacity analysis of underground MIMO system in coal mine (in Chinese), J. Xi'an Unive. Sci. Technol., 31 (2011), 366–370. https://doi.org/10.13800/j.cnki.xakjdxxb.2011.03.025 doi: 10.13800/j.cnki.xakjdxxb.2011.03.025
    [12] G. Y. Liu, X. M. Meng, S. H. Yao, Research on spatial correlation of MIMO channel model in coal mine (in Chinese), Saf. Coal Mines, 43 (2012), 106–107,110. https://doi.org/10.13347/j.cnki.mkaq.2012.09.028 doi: 10.13347/j.cnki.mkaq.2012.09.028
    [13] S. Zhang, C. S. Chen, B. Hu, Q. Q. Zhang, L. X. Wu, Study on MIMO information channel volume in mine roadway (in Chinese), Coal Sci. Technol., 41 (2013), 94–97,128. https://doi.org/10.13199/j.cst.2013.01.97.zhangsh.027 doi: 10.13199/j.cst.2013.01.97.zhangsh.027
    [14] Y. L. Wang, G. Z. Qu, A fast recursive interference cancellation algorithm with low complexity (in Chinese), Comput. Meas. Control, 22 (2014), 4028–4031. https://doi.org/10.16526/j.cnki.11-4762/tp.2014.12.050 doi: 10.16526/j.cnki.11-4762/tp.2014.12.050
    [15] W. Xu, Z. Zhao, Research on sparse channel estimation algorithm based on MIMO-OFDM system, in 2020 International Conference on Communications, Information System and Computer Engineering (CISCE), IEEE, Kuala Lumpur, Malaysia, (2020), 403–406.
    [16] D. Liyanaarachchi, C. B. Barneto, T. Riihonen, M. Heino, M. Valkama, Range-Angle processing for target detection in joint MIMO-OFDM communications and sensing, in 2021 IEEE 22nd International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), IEEE, Lucca, Italy, (2021), 486–490. https://doi.org/10.1109/SPAWC51858.2021.9593229
    [17] S. J. Choi, S. J. Shim, Y. H. You, J. Cha, H. K. Song, Novel MIMO detection with improved complexity for near-ML detection in MIMO-OFDM systems, IEEE Access, 7 (2019), 60389–60398. https://doi.org/10.1109/ACCESS.2019.2914707 doi: 10.1109/ACCESS.2019.2914707
    [18] S. Mondal, M. R. Laskar, A. K. Dutta, ML criterion-based signal detection of a MIMO-OFDM system using quantum and semi-quantum assisted modified DHA/BBHT search algorithm, IEEE Trans. Veh. Technol., 70 (2021), 1688–1698. https://doi.org/10.1109/TVT.2021.3055537 doi: 10.1109/TVT.2021.3055537
    [19] P. Priya, D. Sen, Particle filter based nonlinear data detection for frequency selective mm-wave MIMO-OFDM systems, in 2020 IEEE 92nd Vehicular Technology Conference (VTC2020-Fall), IEEE, Victoria, Canada, (2020), 1–6. https://doi.org/10.1109/VTC2020-Fall49728.2020.9348523
    [20] Y. Liang, L. Li, Y. Yi, L. Liu, Real-time machine learning for symbol detection in MIMO-OFDM systems, in IEEE INFOCOM 2022-IEEE Conference on Computer Communications, IEEE, London, UK, (2022), 2068–2077. https://doi.org/10.1109/INFOCOM48880.2022.9796854
    [21] R. Wang, W. W. Zhu, J. Q. Zhang, Q. Chen, R. H. Xie, An improved ZF-OSIC signal detection algorithm in MIMO system (in Chinese), Inf. Technol., 4 (2017), 165–168,173. https://doi.org/10.13274/j.cnki.hdzj.2017.04.042 doi: 10.13274/j.cnki.hdzj.2017.04.042
    [22] B. Wang, Q. Zhu, An improved algorithm for V-BLAST detection in MIMO-OFDM system (in Chinese), J. Signal Process., 25 (2009), 1409–1413.
    [23] A. Elgabli, A. Elghariani, V. Aggarwal, M. R. Bell, A low-complexity detection algorithm for uplink massive MIMO systems based on alternating minimization, IEEE Wireless Commun. Lett., 8 (2019), 917–920. https://doi.org/10.1109/LWC.2019.2899852 doi: 10.1109/LWC.2019.2899852
    [24] M. M. Wu, Y. H. Fu, Large-scale MIMO signal detection based on learnable weight attenuation (in Chinese), J. Nanjing Univ. Posts Telecommun. (Nat. Sci.), 42 (2022), 45–52. https://doi.org/10.14132/j.cnki.1673-5439.2022.01.007 doi: 10.14132/j.cnki.1673-5439.2022.01.007
    [25] G. Q. Li, P. Yang, J. Z. Lin, Y. J. Xu, Y. Pang, Y. H. Xu, Deep learning-based joint optimization for MIMO systems (in Chinese), J. Chongqing Univ. Posts Telecommun. (Nat. Sci.), 31 (2019), 293–298.
    [26] X. Jin, H. N. Kim, Parallel deep learning detection network in the MIMO channel, IEEE Commun. Lett., 24 (2020), 126–130. https://doi.org/10.1109/LCOMM.2019.2950201 doi: 10.1109/LCOMM.2019.2950201
    [27] S. Liao, C. Deng, L. Liu, B. Yuan, Structured neural network with low complexity for MIMO detection, in 2019 IEEE International Workshop on Signal Processing Systems (SiPS), IEEE, Nanjing, China, (2019), 290–295. https://doi.org/10.1109/SiPS47522.2019.9020365
    [28] H. X. Zhang, H. R. Han, W. B. Lv, Low-complexity generalized space shift keying signal detection algorithm based on compressed sensing (in Chinese), J. Comput. Appl., (2023), 1–8.
    [29] F. Han, J. W. Ji, C. P. Liu, H. Wu, A low complexity MIMO-OTFS signal detection algorithm (in Chinese), Comput. Meas. Control, 31 (2023), 190–195+203. https://doi.org/10.16526/j.cnki.11-4762/tp.2023.02.030 doi: 10.16526/j.cnki.11-4762/tp.2023.02.030
    [30] T. Dai, Z. Q. Li, Z. M. Wang, S. Xing, Massive MIMO signal detection based on improved Richardson method (in Chinese), J. Electron. Meas. Instrum., 37 (2023), 171–178. https://doi.org/10.13382/j.jemi.B2205399 doi: 10.13382/j.jemi.B2205399
    [31] B. Shen, J. Yang, X. Z. Zeng, T. P. Cui, Massive MIMO signal detection based on interference cancellation assisted sparsely connected neural network (in Chinese), J. Electron. Inf. Technol., 45 (2023), 208–217.
    [32] B. Shen, J. Yang, Y. Y. Tu, MIMO signal detection based on OAMP algorithm assisted sparsely connected neural networks (in Chinese), J. Signal Process., (2023), 1–9.
    [33] X. Q. Wu, Y. J. Hu, F. Jiang, Detection algorithm based on block sparse adaptive matching pursuit in generalized spatial modulation MIMO system (in Chinese), Radio Eng., 52 (2022), 1695–1701.
    [34] W. Abid, M. Hajjaj, A. Mejri, R. Bouallegue, Weighted Kalman based detection for uplink MIMO systems, IEEE, in 2020 International Conference on Software, Telecommunications and Computer Networks (SoftCOM), Split, Croatia, (2020), 1–6. https://doi.org/10.23919/SoftCOM50211.2020.9238325
    [35] J. Jalden, B. Ottersten, On the complexity of sphere decoding in digital communications, IEEE Trans. Signal Process., 53 (2005), 1474–1484. https://doi.org/10.1109/TSP.2005.843746 doi: 10.1109/TSP.2005.843746
    [36] M. Cheffena, Industrial indoor multipath propagation-A physical-statistical approach, in 2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communication (PIMRC), IEEE, Washington, USA, (2014), 68–72, https://doi.org/10.1109/PIMRC.2014.7136134
    [37] H. J. Lee, D. Kim, A hybrid zero-forcing and sphere-decoding method for MIMO systems, in 2006 International Conference on Wireless Communications, Networking and Mobile Computing, IEEE, Wuhan, China, (2006), 1–4. https://doi.org/10.1109/WiCOM.2006.9
    [38] Z. Y. Gu, Y. L. Gao, W. L. Liu, M. L. Jin, Decision probability ordered successive interference cancellation for massive MIMO, in 2016 2nd IEEE International Conference on Computer and Communications (ICCC), IEEE, Chengdu, China, (2016), 2601–2605. https://doi.org/10.1109/CompComm.2016.7925168
    [39] Y. Zhu, Z. M. Yu, Research and performance analysis of MMSE detection algorithm for MIMO-OFDM system (in Chinese), Electron. Qual., 421 (2022), 5–10.
    [40] Y. L. Xia, S. He, Research and simulation of OSIC detection algorithm in MIMO-OFDM (in Chinese), Commun. Technol., 50 (2017), 2643–2647.
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1863) PDF downloads(100) Cited by(0)

Figures and Tables

Figures(8)  /  Tables(5)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog