# Signal Detection in Satellite-Ground IoT Link Based on Blind Neural Network

Authors: Qing-yang Guan; Wu Shuang
Journal: Wireless Communications and Mobile Computing
 (2021)

---

## Abstract

At present, there are many problems in satellite-ground IoT link signal detection. Due to the complex characteristics of the satellite-ground IoT link, including Doppler and multipath effect, especially in scenarios related to military fields, it is difficult to use traditional method and traditional cooperative communication methods for link signal detection. Therefore, this paper proposes an efficient detection of satellite-ground IoT link based on the blind neural network (BNN). The BNN includes two network structures, the data feature network and the error update network. Through multiple iterations of the error update network, the weight of BNN for blind detection is optimized and the optimal elimination solution is obtained. Through establishing a satellite-to-ground link model simulation of the low-orbit satellite, the proposed BNN algorithm can obtain better bit error rate characteristics.


---

## Body

## 1. Introduction

In recent years, researchers have proposed a wide range of applications for signal detection, including delay detection [1], power spectrum detection [2], and periodic spectrum detection [3]. For signal detection, most of the current detection algorithms should obtain related prior detection-information, which should be obtained by setting the signal pilot information. Many signal processing algorithms require prior information, such as the encoding of the transmitted and received signal information, channel estimation information, and setting pilot information of sending and receiving signals, and other prior information.For many satellite-to-ground link scenarios, especially military application-related scenarios, it is difficult to use the pilot signal agreed by the transceiver to obtain the prior information of detection. Therefore, many scenarios need to use blind detection.Urkowitz has first proposed the concept of blind algorithm in literature [4], especially in different fields, including wireless communication signal processing and voice signal processing. Based on this basis, related literatures have proposed energy-based blind signal detection algorithms for blind information processing [5], blind signal detection algorithms based on least squares algorithm detection [6], and blind signal detection based on least square [7]. Literature [7, 8] proposed a blind detection algorithm for general signal transmission systems. Since the detection algorithm in the literature is based on ideal conditions, the hypothetical conditions are not suitable for many communication conditions. Literature [9] proposed the blind detection algorithm for speech signals and gave a theoretical closed-loop derivation. However, it is not applicable in real scenarios. Literature [10, 11] proposed a high-complexity blind signal detection algorithm, but due to the high complexity, it is not suitable for processor-limited scenarios.For blind signal processing, researchers [12–14] combined sparse coding for signal detection. In recent years, related scholars have conducted in-depth research on blind signal detection in communication systems. Literature [15–18] gives blind signal detection for MIMO channel systems. In particular, the literature [15] gives the blind signal detection of massive MIMO systems under general conditions. Literature [16] gives a signal detection scheme by analyzing the sparsity characteristics of MIMO channels. Literature [17] is used to blindly detect the signal by establishing the channel error matrix and the spatial characteristics of the subprojection. For MIMO systems, the literature [19–22] proposed blind signal detection with high-order features, which effectively improved the blind signal detection performance of MIMO systems. Literature [23] proposed a blind algorithm based on CMA, which uses constant modulus features to detect MIMO systems.Due to the development of neural networks, speed of signal processing has been increased by neurons. Neural networks with specific functions are formed through linking neurons. For example, the functional neural network proposed in the literature [24–27] uses the reverse parameter tuning model of BP network. Through the inverse parameter adjustment training model, deep network is established. On the basis of these BP networks, the literature [28–31] uses a forward network and a reverse network to form a two-way training model. Each layer of neural network includes an input layer and a training layer, through the establishment of a specific network layer.Regarding the satellite IoT network, related scholars mainly conduct research on system resource allocation [32–34], without involving the relevant physical layer technology. At present, there are many problems in satellite-ground IoT link signal detection. For the complex characteristics of the satellite-ground link, including Doppler and multipath effect, especially in scenarios related to military fields, it is difficult to use traditional cooperative communication methods for link signal detection. Therefore, the paper proposes an efficient detection for satellite-ground links based on blind deep neural network (BNN).


## 2. System Model

Due to the high-speed movement of the satellite to the ground and the long transmission delay of the satellite-ground IoT link, the link produces a large Doppler shift. At the same time, due to the multipath transmission effect of the satellite-ground IoT link, the signal received by the terminal induces greater interference. The satellite-to-ground link signal transmission process is shown in Figure1.Figure 1
Satellite-ground IoT link signal transmission.xn is defined as the transmitted signal, ξ is defined as the carrier frequency offset, and hn,l is defined as the satellite-to-ground link channel response. Signal received by the ground station is yn, which is as follows:(1)yn=∑l=0L−1xn∗hn,l.ξ is introduced as the carrier interference for Doppler shift. A signal received by ground user is defined as yn, which is expressed as follows:(2)yn=∑l=0L−1xn∗hn,l⋅expj2πnξN,where yn is after demodulation by N-DFT at the receiving ground user. Yk in the frequency domain can be expressed as follows:(3)Yk=XkHkC0+∑l=0l≠kN−1XlHlCl−k,where Hk is the frequency domain expressing for channel. The first part is the noncarrier interference part, and the second part is the interference.(4)Cl−k=sinπl+ξ−kNsinπ/Nl+ξ−k⋅expjπN−1Nl+ξ−k,whereξ=0.By calculating Equation (4), we could obtain C0=1. When ξ=0, the interference coefficient between subchannels is 1. There is no interference between the subchannels transmitted by the satellite-to-ground link. When ξ≠0, the interference between subchannels is superimposed on the transmission signal Xl. And, as the interference increases, superimposed multiplicative interference ∑l=0l≠kN−1HlCl−k occurs. Equation (4) also gives the energy leakage between the carriers. As the carrier frequency deviation increases, the energy interference leakage increases.


## 3. Blind Neural Network Algorithm

### 3.1. Architecture for BNN

Figure2 gives out the architecture of BNN. The proposed BNN includes two parts. The first part is the signal feature acquisition network, and the second part is the error network. The goal is to obtain the optimal network weight through the error network.Figure 2
Model information processing based on BNN.qrk and qik are defined as the real and imaginary parts, respectively, and as the input for the data network part of BNN. Xk is considered as the frequency domain signal, which is expressed as follows:(5)Xk=qrk+jqik.ϒr is defined as the characteristic real part of BNN data network, and ϒi is defined as the characteristic imaginary part of BNN data network, which can be expressed as follows:(6)ϒrk=Eqrk4Eqrk2,ϒik=Eqik4Eqik2.ebnn,r and ebnn,i are defined as the real part and imaginary part, which are also expressed as, respectively, follows:(7)ebnn,rk=Eqrk2−ϒr2,ebnn,ik=Eqik2−ϒi2.Combining the cost function of the error network of the BNN, respectively, we could obtain the following:(8)ebnn,inputk=Eqrk2−ϒr2+Eqik2−ϒi2.Error featureebnn,inputk is used as input information to enter the error update network of BNN, as shown in Figure 3. Figure 3 gives out the architecture of BNN algorithm, which includes two parts. The first part is the signal feature acquisition network, and the second part is the error update network.Figure 3
Signal flowing for BNN.W is the weight of the error network, ebnn,outputk is the output of the BNN blind deep learning error weight network, and ebnn,inputk is the input of the BNN blind deep learning error weight network. ebnn,optk is defined as the optimal state of the error weight network of the optimal BNN blind depth network; it can obtain the best signal detection performance through the weight network. It is because ebnn,optk can obtain the best interference cancellation characteristics through nonlinear fitting of the weight of the activation function. Optimal ebnn,optk can be achieved by obtaining the optimal w defined as the initialized weight network. In this case, iterative elimination performance can be obtained. The input error part is the weight part, which can be expressed as follows:(9)ebnn,inputk=eBNN,rk+eBNN,ik.BNNerrork is the error of ebnn,output and ebnn,input, which can be expressed as follows:(10)BNNerrork=ebnn,outputk−ebnn,inputk,J=minEebnn,output−ebnn,input2.Therefore, the optimization goal of the algorithm is to minimizeJ; according to ebnn,outputk at the first-order Taylor expansion of ebnn,inputk, we can obtain the following:(11)ebnn,output≈ebnn,input+Ηwout−wopt,where(12)Η≈∂ebnn,output∂wout,⋯,∂ebnn,output∂wout.Equation (12) has been introduced, and we could get the following:(13)minEebnn,output−ebnn,opti+12≈minEeoutputi+fwopt−woutputi−eoutputi+1−fwoutputi+1−woutputi2.In order to reduce the objective cost function, a linear search method is used to obtainwout to approximate the optimization wopt. From the search direction λi, we can obtain the weights of the fth iteration to approximate wouti the optimization weights wouti. Therefore, the optimization weights are the weight approximation process, which can be expressed as follows:(14)wouti+1=wouti+λi⋅BNNei.By approaching theλi direction, we can obtain the following:(15)λi=argminλiEebnn,outputi−ebnn,outputi+12=argminλiEwoutputi−woutputi+1∗Ηi∗Ηiwoutputi−woutputi+1.Equation (14) can be obtained by expanding the following formula.SubstitutingΓ=wopt−wouti, we can get the following:(16)Ewopt−wouti+1∗Ηi∗Ηiw−wouti+1≈EI−λiΗiki∗Ηi∗ΗiI−λiΗiki.In order to get theλi direction, we can get the following:(17)λi=Ηi∗Ηi+σ2IiIiH−1−1Ηi∗.Equation (17) can obtain the direction of the weight approximation wouti. For the ith iteration, we can obtain the following:(18)ΓiΓiH=ηI,where η is considered as a constant.Equation (17) can be simplified into the following:(19)λi=Ηi∗Ηi+σ2ηI−1−1Ηi∗.Equation (19) can get the optimal direction.


### 3.2. Processing for BNN

Figure4 shows the blind detection target feature of the system when the weight is optimal. The weight update of the blind neural network converges to the optimal value, and the blind detection objective function is as follows:(20)minxλwbnn1+Y−wbnn,optX22.Figure 4
Blind signal detection afterw weight convergence.The objective function is to obtain accurate signal interference cancellation. Therefore, the error of the optimal weight detection can be obtained. Therefore, the optimal signal detection can be obtained by the following:(21)minxλwbnn1,w+Y−wbnn,optXt22,where(22)w1,w=∑i=1Kwi.The first part of Equation (22) is the nonzero regularization part, and the second part is the error elimination part.More specifically, the objective function feature is constructed by constructing the rank operation of the minimized matrix and the feature transfer matrix.


## 3.1. Architecture for BNN

Figure2 gives out the architecture of BNN. The proposed BNN includes two parts. The first part is the signal feature acquisition network, and the second part is the error network. The goal is to obtain the optimal network weight through the error network.Figure 2
Model information processing based on BNN.qrk and qik are defined as the real and imaginary parts, respectively, and as the input for the data network part of BNN. Xk is considered as the frequency domain signal, which is expressed as follows:(5)Xk=qrk+jqik.ϒr is defined as the characteristic real part of BNN data network, and ϒi is defined as the characteristic imaginary part of BNN data network, which can be expressed as follows:(6)ϒrk=Eqrk4Eqrk2,ϒik=Eqik4Eqik2.ebnn,r and ebnn,i are defined as the real part and imaginary part, which are also expressed as, respectively, follows:(7)ebnn,rk=Eqrk2−ϒr2,ebnn,ik=Eqik2−ϒi2.Combining the cost function of the error network of the BNN, respectively, we could obtain the following:(8)ebnn,inputk=Eqrk2−ϒr2+Eqik2−ϒi2.Error featureebnn,inputk is used as input information to enter the error update network of BNN, as shown in Figure 3. Figure 3 gives out the architecture of BNN algorithm, which includes two parts. The first part is the signal feature acquisition network, and the second part is the error update network.Figure 3
Signal flowing for BNN.W is the weight of the error network, ebnn,outputk is the output of the BNN blind deep learning error weight network, and ebnn,inputk is the input of the BNN blind deep learning error weight network. ebnn,optk is defined as the optimal state of the error weight network of the optimal BNN blind depth network; it can obtain the best signal detection performance through the weight network. It is because ebnn,optk can obtain the best interference cancellation characteristics through nonlinear fitting of the weight of the activation function. Optimal ebnn,optk can be achieved by obtaining the optimal w defined as the initialized weight network. In this case, iterative elimination performance can be obtained. The input error part is the weight part, which can be expressed as follows:(9)ebnn,inputk=eBNN,rk+eBNN,ik.BNNerrork is the error of ebnn,output and ebnn,input, which can be expressed as follows:(10)BNNerrork=ebnn,outputk−ebnn,inputk,J=minEebnn,output−ebnn,input2.Therefore, the optimization goal of the algorithm is to minimizeJ; according to ebnn,outputk at the first-order Taylor expansion of ebnn,inputk, we can obtain the following:(11)ebnn,output≈ebnn,input+Ηwout−wopt,where(12)Η≈∂ebnn,output∂wout,⋯,∂ebnn,output∂wout.Equation (12) has been introduced, and we could get the following:(13)minEebnn,output−ebnn,opti+12≈minEeoutputi+fwopt−woutputi−eoutputi+1−fwoutputi+1−woutputi2.In order to reduce the objective cost function, a linear search method is used to obtainwout to approximate the optimization wopt. From the search direction λi, we can obtain the weights of the fth iteration to approximate wouti the optimization weights wouti. Therefore, the optimization weights are the weight approximation process, which can be expressed as follows:(14)wouti+1=wouti+λi⋅BNNei.By approaching theλi direction, we can obtain the following:(15)λi=argminλiEebnn,outputi−ebnn,outputi+12=argminλiEwoutputi−woutputi+1∗Ηi∗Ηiwoutputi−woutputi+1.Equation (14) can be obtained by expanding the following formula.SubstitutingΓ=wopt−wouti, we can get the following:(16)Ewopt−wouti+1∗Ηi∗Ηiw−wouti+1≈EI−λiΗiki∗Ηi∗ΗiI−λiΗiki.In order to get theλi direction, we can get the following:(17)λi=Ηi∗Ηi+σ2IiIiH−1−1Ηi∗.Equation (17) can obtain the direction of the weight approximation wouti. For the ith iteration, we can obtain the following:(18)ΓiΓiH=ηI,where η is considered as a constant.Equation (17) can be simplified into the following:(19)λi=Ηi∗Ηi+σ2ηI−1−1Ηi∗.Equation (19) can get the optimal direction.


## 3.2. Processing for BNN

Figure4 shows the blind detection target feature of the system when the weight is optimal. The weight update of the blind neural network converges to the optimal value, and the blind detection objective function is as follows:(20)minxλwbnn1+Y−wbnn,optX22.Figure 4
Blind signal detection afterw weight convergence.The objective function is to obtain accurate signal interference cancellation. Therefore, the error of the optimal weight detection can be obtained. Therefore, the optimal signal detection can be obtained by the following:(21)minxλwbnn1,w+Y−wbnn,optXt22,where(22)w1,w=∑i=1Kwi.The first part of Equation (22) is the nonzero regularization part, and the second part is the error elimination part.More specifically, the objective function feature is constructed by constructing the rank operation of the minimized matrix and the feature transfer matrix.


## 4. Discussion

In order to further optimize the solution of the objective function, we consider⋅1 as an alternative matrix and minimize the closed-loop solution of blind deep neural networks established wBNN by iterative methods. Therefore, when the current data x will become more effective, we use an updated iteration method to solve the current objective function. The improved iteration method is as follows:(23)minxλw1,w+αtX−X^22+Y−wbnn,optX22.The established objective iteration function can be expressed as follows:(24)LX,z,tt=αtX−X^22+Y−wbnn,optX22+twbnn,opt−w^bnn,opt22.The iterative method of weightedx, w, and u can be expressed as follows:(25)Xtk+1=argminxαtX−X^t22+yt−wtX22+βw−wtk+ptk22,wbnn,optk+1=argminww−w^bnn,opt22+βwbnn,optk+1−wbnn,optk+pk22,ptk+1=ptk+1+Xtk+1−wtk+1.The ability of BNN could be obtained with the constellation simulation. DefiningSNR=15dB, the frequency offsets are defined within the range [-ξmax, ξmax]; ξmax is the maximum frequency offsets. Figure 5 gives the signal constellation within ξmax=0.1. Figure 6 gives the signal constellation with the LS algorithm. Figure 7 gives the signal constellation with the CMA algorithm. Figure 8 gives the signal constellation with the BNN algorithm. As seen from figures, the CMA scheme could not detect completely for variable frequency offset. The BNN can effectively eliminate interference.Figure 5
QPSK signal constellation withζmax=0.1.Figure 6
QPSK signal constellation with LS algorithm.Figure 7
QPSK signal constellation with CMA algorithm.Figure 8
QPSK signal constellation with BNN algorithm.It is because the BNN needs to adjust to different channel model characteristics through parameter fitting, so as to complete the acquisition of feature weights. The essence is to seek the optimal weights. The LS algorithm and the CMA algorithm only adopt one single-layer signal transformation, which mainly adopts hard decision method and introduces relatively large errors. This is due to the hard decision characteristics of the single-layer transform, and there is no need to obtain extreme values in the signal plane space. Because the BNN algorithm can obtain the best in the signal space and weight matrix, thereby it improved the performance of the algorithm.


## 5. Experimental and Analysis

In order to research the BNN, the simulation model of a LEO with a height of 1500 km is established. And the time for a single low-orbit satellite to pass the top is 10 minutes. We use the 3-path model with direct main path components. The main path is accord to the Rician distribution. The maximum extended delay is 250 ns. The maximum working elevation angle is 35°. Define the uplink transmission bit rate be 40 Mbit/s.Setting IoT link that the cyclic prefix length is greater than the maximum delay, it can be known from the delay extension that the guard interval should be 1μs, and the symbol period can be 1 μs×5+1μs=6μs. Therefore, each symbol needs to transmit 40Mbit/s/1/6μs=240bits. At this time, the relative carrier frequency deviation factor can be calculated as 0.4. With QPSK modulation, each subcarrier can transmit 2 bits, and 240/2=120 subcarriers are required. 8 zero-padded subcarriers can facilitate the implementation of 128-point FFT/IFFT.In order to facilitate the analysis, defining the number of users in the uplink access system is 4. The subcarrier mapping method is IFDMA, and the signal mapping method is QPSK. The simulation uses block pilots for information transmission. Take the cyclic prefix length greater than the maximum extended delay of each path.


### 5.1. BER Analysis

ξmax is defined as the maximum frequency deviation range allowed by the carrier. Figure 9 and Figures 10 and 11 show different bit error rate curves for all users, including the case of no detection, ideal condition, LS algorithm, the CMA criterion-based equalization algorithm proposed in [23], and the proposed BNN frequency offset interference elimination algorithm. Figure 9 shows the different bit error rate curves under the current condition ξmax=0.2. Figure 10 shows the different bit error rate curves under current condition ξmax=0.35. Figure 11 shows the bit error rate curve current conditions ξmax=0.4. The conditions of Figure 9 and Figures 10 and 11 all assume that each subchannel is independent. It can be obtained that the bit error rate curve without algorithm is larger. Due to interference, with increasing of the SNR, the BER performance does not have a trend of improvement. The CMA algorithm can eliminate some ICI interference. Compared with the blind algorithm based on CMA, the BNN algorithm improves the frequency offset elimination performance in the frequency domain.Figure 9
BER performance of QPSK signal under different algorithms (with frequency offsetξmax=0.2).Figure 10
BER performance of QPSK signal under different algorithms (with frequency offsetξmax=0.35).Figure 11
BER performance of QPSK signal under different algorithms (with frequency offsetξmax=0.4).It can be seen from the simulation figures that for the iterative BNN algorithm, this is because the weightw can converge to a position close to the optimal value, which can obtain better bit error rate performance for user signals and greater interference cancellation performance. The BER curve of the four users of uplink access is different within frequency offset ranges. As the frequency offset range increases, the BER performance of the user signal increases. When the weight is close to the optimum, the system signal BER is optimized.It is because the BNN needs to be adapted for different channel model characteristics through parameter fitting, so as to complete the acquisition of feature weights. The essence is to seek the optimal gradient direction to obtain the optimal weights. Under the condition of low signal-to-noise ratio, especially within 3 dB, the LS algorithm and the CMA algorithm have better characteristics. This is due to the hard decision characteristic of the single-layer transform, and there is no need to obtain the optimal value. Because the parameters of the BNN are difficult to adjust, it is difficult to obtain the optimal weight under the low signal-to-noise ratio. Interference under low signal-to-noise ratio conditions makes it difficult to obtain better extreme values in the signal space. Under the condition of high signal-to-noise ratio, the BNN algorithm can obtain the best in the signal space and obtain the best weight matrix, thereby improving the performance.


### 5.2. Convergence Analysis

We establish different satellite-to-ground link channel models and conduct statistical analysis of the BNN algorithm to prove the effectiveness and reliability in different satellite-to-ground link scenarios.It is characterized by the convergence analysis of the algorithm on different satellite-to-ground links, so as to obtain the high-quality performance.Convergence is embodied in the BNN parameter adjustment time under the complex environment of different satellite-ground links, especially simulation modeling under three different link scenarios, urban environment given in Table1, suburban environment given in Table 2, and rural environment given in Table 3. This also shows the fitting time of the blind neural network to environmental parameters in different environments.Table 1
Channel model parameter in urban environment.
TapDistribution functionParameterParameter distributionNumerical value/dBTime delay/ns1LOS: RicianRice factorK5.30nLOS: RayleighPower2σl2-12.12RayleighPower2σl2-17.0603RayleighPower2σl2-18.31004RayleighPower2σl2-19.1130Table 2
Channel model parameter in suburban environment.
TapDistribution functionParameterParameter distributionNumerical value/dBTime delay/ns1LOS: RicianRice factorK9.70nLOS: RayleighPower2σl2-7.32RayleighPower2σl2-23.61003RayleighPower2σl2-28.1180Table 3
Channel model parameter in rural environment.
TapDistribution functionParameterParameter distributionNumerical value/dBTime delay/ns1LOS: RicianRice factorK6.30nLOS: RayleighPower2σl2-9.52RayleighPower2σl2-24.1100The specific scenarios are as follows:The BNN needs to be adaptive for different channel model characteristics through parameter fitting given in Figure12. So as to complete the acquisition of feature weights, the essence is to seek the optimal gradient direction to obtain the optimal weights. Due to the complexity of the environment, the tuning parameter of the algorithm is increased, especially in search for the weight of the optimal gradient direction. It can be obtained from Figure 12; the channel model of the complex environment increases the optimal weight, and the gradient iteration is improvement.Figure 12
Analysis for convergence of different iteration numbers based on BNN.


### 5.3. Algorithm Complexity and Efficiency

In core module based on BNN algorithm, which is the iterative convergence of the optimal gradient, the core iteration module has the complexity ofO2^n. The current convergence is for curve analysis and simulation of computer CPU configuration with Intel i7 4 cores. The processor has a clocked frequency of 3.8 GHz and 64 G memory, and the convergence running time of the core algorithm is 50 ms. The algorithm also has real-time performance.


## 5.1. BER Analysis

ξmax is defined as the maximum frequency deviation range allowed by the carrier. Figure 9 and Figures 10 and 11 show different bit error rate curves for all users, including the case of no detection, ideal condition, LS algorithm, the CMA criterion-based equalization algorithm proposed in [23], and the proposed BNN frequency offset interference elimination algorithm. Figure 9 shows the different bit error rate curves under the current condition ξmax=0.2. Figure 10 shows the different bit error rate curves under current condition ξmax=0.35. Figure 11 shows the bit error rate curve current conditions ξmax=0.4. The conditions of Figure 9 and Figures 10 and 11 all assume that each subchannel is independent. It can be obtained that the bit error rate curve without algorithm is larger. Due to interference, with increasing of the SNR, the BER performance does not have a trend of improvement. The CMA algorithm can eliminate some ICI interference. Compared with the blind algorithm based on CMA, the BNN algorithm improves the frequency offset elimination performance in the frequency domain.Figure 9
BER performance of QPSK signal under different algorithms (with frequency offsetξmax=0.2).Figure 10
BER performance of QPSK signal under different algorithms (with frequency offsetξmax=0.35).Figure 11
BER performance of QPSK signal under different algorithms (with frequency offsetξmax=0.4).It can be seen from the simulation figures that for the iterative BNN algorithm, this is because the weightw can converge to a position close to the optimal value, which can obtain better bit error rate performance for user signals and greater interference cancellation performance. The BER curve of the four users of uplink access is different within frequency offset ranges. As the frequency offset range increases, the BER performance of the user signal increases. When the weight is close to the optimum, the system signal BER is optimized.It is because the BNN needs to be adapted for different channel model characteristics through parameter fitting, so as to complete the acquisition of feature weights. The essence is to seek the optimal gradient direction to obtain the optimal weights. Under the condition of low signal-to-noise ratio, especially within 3 dB, the LS algorithm and the CMA algorithm have better characteristics. This is due to the hard decision characteristic of the single-layer transform, and there is no need to obtain the optimal value. Because the parameters of the BNN are difficult to adjust, it is difficult to obtain the optimal weight under the low signal-to-noise ratio. Interference under low signal-to-noise ratio conditions makes it difficult to obtain better extreme values in the signal space. Under the condition of high signal-to-noise ratio, the BNN algorithm can obtain the best in the signal space and obtain the best weight matrix, thereby improving the performance.


## 5.2. Convergence Analysis

We establish different satellite-to-ground link channel models and conduct statistical analysis of the BNN algorithm to prove the effectiveness and reliability in different satellite-to-ground link scenarios.It is characterized by the convergence analysis of the algorithm on different satellite-to-ground links, so as to obtain the high-quality performance.Convergence is embodied in the BNN parameter adjustment time under the complex environment of different satellite-ground links, especially simulation modeling under three different link scenarios, urban environment given in Table1, suburban environment given in Table 2, and rural environment given in Table 3. This also shows the fitting time of the blind neural network to environmental parameters in different environments.Table 1
Channel model parameter in urban environment.
TapDistribution functionParameterParameter distributionNumerical value/dBTime delay/ns1LOS: RicianRice factorK5.30nLOS: RayleighPower2σl2-12.12RayleighPower2σl2-17.0603RayleighPower2σl2-18.31004RayleighPower2σl2-19.1130Table 2
Channel model parameter in suburban environment.
TapDistribution functionParameterParameter distributionNumerical value/dBTime delay/ns1LOS: RicianRice factorK9.70nLOS: RayleighPower2σl2-7.32RayleighPower2σl2-23.61003RayleighPower2σl2-28.1180Table 3
Channel model parameter in rural environment.
TapDistribution functionParameterParameter distributionNumerical value/dBTime delay/ns1LOS: RicianRice factorK6.30nLOS: RayleighPower2σl2-9.52RayleighPower2σl2-24.1100The specific scenarios are as follows:The BNN needs to be adaptive for different channel model characteristics through parameter fitting given in Figure12. So as to complete the acquisition of feature weights, the essence is to seek the optimal gradient direction to obtain the optimal weights. Due to the complexity of the environment, the tuning parameter of the algorithm is increased, especially in search for the weight of the optimal gradient direction. It can be obtained from Figure 12; the channel model of the complex environment increases the optimal weight, and the gradient iteration is improvement.Figure 12
Analysis for convergence of different iteration numbers based on BNN.


## 5.3. Algorithm Complexity and Efficiency

In core module based on BNN algorithm, which is the iterative convergence of the optimal gradient, the core iteration module has the complexity ofO2^n. The current convergence is for curve analysis and simulation of computer CPU configuration with Intel i7 4 cores. The processor has a clocked frequency of 3.8 GHz and 64 G memory, and the convergence running time of the core algorithm is 50 ms. The algorithm also has real-time performance.


## 6. Conclusion

This paper proposes an efficient detection of satellite-to-ground links based on blind deep neural networks (BNN). The BNN includes two network structures, the data feature network and the error update network. Through obtaining the optimal weight, the weight of BNN for blind detection is optimized and the optimal elimination solution is obtained with iterations error updating network. In order to obtain simulation performance, we establish the satellite-ground IoT link model; we could obtain better bit error rate characteristics.



---

*Source: 5547989-2021-05-07.xml*