# Research on Grid Scroll Chaotic Extended Sequence Algorithm and Its Circuit Implementation for F-OFDM System

Authors: Yingjie Ma; Ya Li; Geng Zhao; Ping Zeng; Yatao Yang
Journal: Complexity
 (2019)

---

## Abstract

High peak-to-average power ratio (PAPR), a main problem of 5G Filtered-Orthogonal Frequency Division Multiplexing (F-OFDM) system, seriously affects the system’s transmission efficiency. Aiming at the shortcomings of the traditional selective mapping (SLM) algorithm, the grid scroll chaotic extended sequence (GSCES) algorithm is proposed to solve the high PAPR problem. The proposed grid multiscroll chaotic maps are used as random phase sequence vectors instead of the traditional pseudo random sequence, which provide a large number of random sequences with good correlation characteristics, random characteristics, and high security. The proposed random phase sequence vectors can meet the needs of 5G mass connections. The original input signals are divided into real part and imaginary part, which are, respectively, dot produced with the proposed grid multiscroll chaotic maps. The numerical simulation results show that the proposed GSCES algorithm effectively increases the number of candidate sequences, reduces the PAPR values, and improves the transmission efficiency and security. Moreover, the hardware experimental results produce at 2 × 2 × 2-grid multiscroll chaotic attractor, which further proves the physical realization of the proposed system. The proposed schemes have a broad application prospect in 5G multicarrier modulation technology.


---

## Body

## 1. Introduction

In 2015, Filtered-OFDM (F-OFDM) technology was first put forward publicly at the World Mobile Communication Congress. It is an adaptive airport waveform modulation technology whose subcarrier bandwidth can be adjusted according to specific application scenarios. F-OFDM technology has many advantages, such as no need for strict synchronization, reduced out-of-band energy leakage, the different waveform modulation, multiple access technology and frame structure based on the mobile communication application scene and business requirements, the dynamic soft interface parameter configuration according to the 5G business needs, and packet traffic transmission suitable for Internet of things [1–5]. In the F-OFDM system, when subcarriers of sub-band are superimposed after IFFT operation, multiple subcarriers will reach the peak value at the same time, resulting in higher peak-to-average power ratio (PAPR) of synthetic signal, which seriously affects the system performance and limits its application in 5G.The characteristics of selective mapping (SLM) scrambling technology are simple structure and obvious effect, but there are a large side band information and high computational complexity. Many researchers have improved the traditional SLM algorithm. The cyclic-SLM scheme is proposed to omit the side information (SI) and apply only one IFFT. In the time domain, the original signal and its periodic shift signal are added and the minimum PAPR is selected as the candidate signal [6]. The time-frequency domain encryption technique is proposed based on the multichaos and SLM PAPR suppression algorithm. The Lozi and Logistic maps are used to interfere the carrier in the time-frequency domain. In a 100 kilometer single-mode fiber, 8.9 Gb/s encrypted OFDM signal is transmitted safely [7]. A method is proposed to decrease the PAPR of the 16-QAM OFDM system, which combines the chaotic map and SLM algorithm so that the phase rotation factors are controlled by chaotic sequence [8]. The improved SLM algorithm based on the Lehmer random phase sequence vector is proposed to embed side band information into the 16-PSK transmit signal [9]. The improved SLM algorithm is proposed to reduce PAPR, combining interlaced IDCT transform with pulse forming technology [10]. The low complexity improved SLM algorithm and μ-law compression scheme are proposed to reduce the PAPR and computational complexity of the OFDMA system [11]. The low-complexity SLM improvement algorithm without SI is proposed to reduce the PAPR of the coherent light OFDM system [12]. The blind differential improved SLM algorithm is proposed to reduce the PAPR of Alamouti DSFBC-OFDM system [13].In this paper, a model of the new system is constructed to produce gird multiscroll chaotic attractors, using different sign functions acted as nonlinear function. Moreover, the design of the hardware circuit produces at 2 × 2 × 2-grid multiscroll hardware experimental results. The produced grid multiscroll chaotic maps are used as random phase sequence vectors instead of the traditional pseudo random sequence. The grid scroll chaotic extended sequence (GSCES) algorithm is proposed to solve the high PAPR problem. The numerical simulation results show that the proposed GSCES algorithm effectively increases the numbers of candidate sequences, reduces the PAPR values, and improves the transmission efficiency and security.


## 2. Methods

### 2.1. F-OFDM System Modes

F-OFDM system dynamically configures suitable waveform parameters such as bandwidth, cycle prefix (CP) length, subcarrier spacing, and FFT points for each sub-band according to service requirements, which improves the flexibility and scalability of 5G communication system. The downlink of the F-OFDM system is shown in Figure1.Figure 1
The downlink of F-OFDM system.As shown in Figure1, the frequency bands of the system are divided into M sub-bands, which are subcarrier mapping, IFFT transformation, and plus CP operation, respectively, and each sub-band is filtered through the sub-band filter for coupling transmission. The biggest difference between the F-OFDM system and traditional OFDM system is the sub-band filter added at the transmitter and receiver. For each sub-band, at the transmitter, the input signal of the sub-band filter is the traditional OFDM signal. The function of the sub-band filter is to complete the baseband shaping of each sub-band, and its output signal is the F-OFDM signal. At the receiving end, the function of sub-band filter is to filter each sub-band signal and complete sub-band decoupling.The data symbol of theith sub-band of the F-OFDM system is given by(1)xin=gin∗fin,i=1,2,…,M,where gin is the ith sub-band symbol before filtering, fi(n) is the impulse response of the ith sub-band filter at the beginning, and M is the number of sub-band.The transmit signal of the F-OFDM system is as follows:(2)xn=∑i=0M−1xin.The channel output signal is given by(3)rn=xn∗hn+zn=∑i=0M−1xin∗hn+zn=∑i=0M−1gin∗fin∗hn+zn.


### 2.2. Construction of Grid Multiscroll Chaotic System

In this paper, the new grid multiscroll chaotic system is constructed with the combination of sign functions, which act as nonlinear functions. So, the dimensionless equation of the state is constructed by the following equation:(4)dxdt=y−a⋅sgny,dydt=z−b⋅sgnz,dzdt=−cx−cy−dz+e⋅sgnx+y.When control parametersa = 1.4, b = 1.4, c = 1.5, d = 0.8, and e = 3.9, the grid multiscroll chaotic system is in a state of chaos.


### 2.3. Grid Scroll Chaotic Extended Sequence Algorithm

The traditional SLM algorithm is a kind of PAPR suppression algorithm without signal distortion. However, the receiver needs to know the selected random phase sequence to demodulate, so it also needs to transmit the corresponding random phase sequence information in addition to the data information. It is restricted in practical application. In this paper, the pseudo random sequences are generated by the proposed grid multiscroll chaotic maps. The pseudo random sequences are generated by the initial value iterations. It only needs to transmit its initial value, which reduces the complexity of the operation and the side band information transmission. Aiming at the shortcomings of the traditional SLM algorithm, the grid scroll chaotic extended sequence (GSCES) algorithm is proposed in this paper. The original signals are divided into real part and imaginary part, the proposed grid multiscroll chaotic maps are used as random phase sequence vectors, the IFFT transforms are performed, respectively, the PAPR is calculated by linear superposition, and the minimum PAPR is selected for transmission as shown in Figure2.Figure 2
Schematic diagram of the grid scroll chaotic extended sequence algorithm.As shown in Figure2, the 5G F-OFDM data block is x(t), the serial input signal x(t) is symbol mapped, which is divided into 2M subchannels with serial-to-parallel conversion, the signal x(t) is divided into the real part and the imaginary part, and the transmission is carried out on the M subchannel, respectively. The proposed grid multiscroll chaotic maps are used to generate random phase sequence vector P with different N lengths, and then the mth random phase sequence vector is Pm=Pm,0,Pm,1,…,Pm,N−1,0≤m≤M−1. The lth data block xlt is divided into the real part xl_r(t) and the imaginary part xl_i(t), which are, respectively, dot produced with the mth random phase sequence vector Pm, then IFFT transforms are performed, and the candidate transmission sequences sl_rmt and sl_imt are produced:(5)sl_rmt=IFFTxl_rt⊗Pm=IFFTxl_r,0tPm,0,xl_r,1tPm,1,…,xl_r,N−1tPm,N−1,0≤m≤M−1,sl_imt=IFFTxl_it⊗Pm=IFFTxl_i,0tPm,0,xl_i,1tPm,1,…,xl_i,N−1tPm,N−1,0≤m≤M−1,where ⊗ is dot product operation between two vectors, IFFT is discrete Fourier inverse transformation, sl_rmt is the real part of the candidate sequence, and sl_imt is the imaginary part of the candidate sequence.The candidate sequenceslk,qt are obtained by linear combination of the real part sl_rkt and imaginary part sl_iqt:(6)slk,qt=αksl_rkt±jβgsl_iqt=αkIFFTxl_rt⊗Pk±jβgIFFTxl_it⊗Pq.IfαkPk±jβgPg is the unit phase sequence vector, that is αk=βg=1/2, and the positive and negative polarity have the same PAPR, then(7)slk,qt=12IFFTxl_rt⊗Pk±jxl_it⊗Pq=12sl_rkt±jsl_iqt.According to equation (7), the number of expanded candidate transmission sequences selt increases from original M to M2, and it is expressed as(8)selt=sl0t,sl1t,…,slnt,…,slM2−1t,0≤n≤M2−1.In the candidate transmission sequence oflth data block, the minimum PAPR is selected as Dl, namely,(9)Dl=argmin0≤n≤M2−1PAPRslnt,0≤l≤M−1.So, the output sequence is as follows:(10)D=∑l=0M−1Dl.


## 2.1. F-OFDM System Modes

F-OFDM system dynamically configures suitable waveform parameters such as bandwidth, cycle prefix (CP) length, subcarrier spacing, and FFT points for each sub-band according to service requirements, which improves the flexibility and scalability of 5G communication system. The downlink of the F-OFDM system is shown in Figure1.Figure 1
The downlink of F-OFDM system.As shown in Figure1, the frequency bands of the system are divided into M sub-bands, which are subcarrier mapping, IFFT transformation, and plus CP operation, respectively, and each sub-band is filtered through the sub-band filter for coupling transmission. The biggest difference between the F-OFDM system and traditional OFDM system is the sub-band filter added at the transmitter and receiver. For each sub-band, at the transmitter, the input signal of the sub-band filter is the traditional OFDM signal. The function of the sub-band filter is to complete the baseband shaping of each sub-band, and its output signal is the F-OFDM signal. At the receiving end, the function of sub-band filter is to filter each sub-band signal and complete sub-band decoupling.The data symbol of theith sub-band of the F-OFDM system is given by(1)xin=gin∗fin,i=1,2,…,M,where gin is the ith sub-band symbol before filtering, fi(n) is the impulse response of the ith sub-band filter at the beginning, and M is the number of sub-band.The transmit signal of the F-OFDM system is as follows:(2)xn=∑i=0M−1xin.The channel output signal is given by(3)rn=xn∗hn+zn=∑i=0M−1xin∗hn+zn=∑i=0M−1gin∗fin∗hn+zn.


## 2.2. Construction of Grid Multiscroll Chaotic System

In this paper, the new grid multiscroll chaotic system is constructed with the combination of sign functions, which act as nonlinear functions. So, the dimensionless equation of the state is constructed by the following equation:(4)dxdt=y−a⋅sgny,dydt=z−b⋅sgnz,dzdt=−cx−cy−dz+e⋅sgnx+y.When control parametersa = 1.4, b = 1.4, c = 1.5, d = 0.8, and e = 3.9, the grid multiscroll chaotic system is in a state of chaos.


## 2.3. Grid Scroll Chaotic Extended Sequence Algorithm

The traditional SLM algorithm is a kind of PAPR suppression algorithm without signal distortion. However, the receiver needs to know the selected random phase sequence to demodulate, so it also needs to transmit the corresponding random phase sequence information in addition to the data information. It is restricted in practical application. In this paper, the pseudo random sequences are generated by the proposed grid multiscroll chaotic maps. The pseudo random sequences are generated by the initial value iterations. It only needs to transmit its initial value, which reduces the complexity of the operation and the side band information transmission. Aiming at the shortcomings of the traditional SLM algorithm, the grid scroll chaotic extended sequence (GSCES) algorithm is proposed in this paper. The original signals are divided into real part and imaginary part, the proposed grid multiscroll chaotic maps are used as random phase sequence vectors, the IFFT transforms are performed, respectively, the PAPR is calculated by linear superposition, and the minimum PAPR is selected for transmission as shown in Figure2.Figure 2
Schematic diagram of the grid scroll chaotic extended sequence algorithm.As shown in Figure2, the 5G F-OFDM data block is x(t), the serial input signal x(t) is symbol mapped, which is divided into 2M subchannels with serial-to-parallel conversion, the signal x(t) is divided into the real part and the imaginary part, and the transmission is carried out on the M subchannel, respectively. The proposed grid multiscroll chaotic maps are used to generate random phase sequence vector P with different N lengths, and then the mth random phase sequence vector is Pm=Pm,0,Pm,1,…,Pm,N−1,0≤m≤M−1. The lth data block xlt is divided into the real part xl_r(t) and the imaginary part xl_i(t), which are, respectively, dot produced with the mth random phase sequence vector Pm, then IFFT transforms are performed, and the candidate transmission sequences sl_rmt and sl_imt are produced:(5)sl_rmt=IFFTxl_rt⊗Pm=IFFTxl_r,0tPm,0,xl_r,1tPm,1,…,xl_r,N−1tPm,N−1,0≤m≤M−1,sl_imt=IFFTxl_it⊗Pm=IFFTxl_i,0tPm,0,xl_i,1tPm,1,…,xl_i,N−1tPm,N−1,0≤m≤M−1,where ⊗ is dot product operation between two vectors, IFFT is discrete Fourier inverse transformation, sl_rmt is the real part of the candidate sequence, and sl_imt is the imaginary part of the candidate sequence.The candidate sequenceslk,qt are obtained by linear combination of the real part sl_rkt and imaginary part sl_iqt:(6)slk,qt=αksl_rkt±jβgsl_iqt=αkIFFTxl_rt⊗Pk±jβgIFFTxl_it⊗Pq.IfαkPk±jβgPg is the unit phase sequence vector, that is αk=βg=1/2, and the positive and negative polarity have the same PAPR, then(7)slk,qt=12IFFTxl_rt⊗Pk±jxl_it⊗Pq=12sl_rkt±jsl_iqt.According to equation (7), the number of expanded candidate transmission sequences selt increases from original M to M2, and it is expressed as(8)selt=sl0t,sl1t,…,slnt,…,slM2−1t,0≤n≤M2−1.In the candidate transmission sequence oflth data block, the minimum PAPR is selected as Dl, namely,(9)Dl=argmin0≤n≤M2−1PAPRslnt,0≤l≤M−1.So, the output sequence is as follows:(10)D=∑l=0M−1Dl.


## 3. Experiment

According to the modular circuit design method, equation (4) has been carried out by the differential-integral transforms; we have the following equation:(11)x=∫y−a⋅sgnydτ,y=∫z−b⋅sgnzdτ,z=∫−cx−cy−dz+e⋅sgnx+ydτ.According to equation (11), the design of the circuit is shown in Figure 3. The model of the operational amplifier is TL082. The power supply voltage of all active devices is ±15 V. All resistors are precision adjustable resistors or precision adjustable potentiometers.Figure 3
Hardware circuit diagram.


## 4. Results and Discussion

### 4.1. Dynamics of Lyapunov Exponents

For the system corresponding equation (4), the Runge–Kutta integration method is used with the length of time t = (0, 200), initial values (x, y, z) = (0.02, 0.01, 0.03), and the numerical simulation result of the Lyapunov exponents is shown in Figure 4.Figure 4
Lyapunov exponents of the proposed system.The Lyapunov exponents of the proposed system are given asLE1=0.055545,LE2=0.025606,andLE3=−0.881151, also LE1+LE2+LE3=−0.8. Moreover, the fractal dimension is given by(12)LD=j+1LEj+1∑i=1jLEi=2+0.055545+0.0256060.881151=2.0921.The proposed system has positive Lyapunov exponent and the dimension of Lyapunov is fractional, which further confirms that the system is in the state of chaos and the calculated Lyapunov exponent is reasonable. Moreover, this system produces strange attractor dimension LD = 2.0921, in line with the geometric characteristics of the chaotic attractor.


### 4.2. Poincare Map of Grid Multiscroll Chaotic System

For the system corresponding equation (4), the Runge–Kutta integration method is used with the length of time t = (0, 2600) and initial values (x, y, z) = (0.02, 0.01, 0.03). The Poincare map of the grid multiscroll chaotic system is shown in Figure 5.Figure 5
Poincare map of the grid multiscroll chaotic system.A Poincare section is selected in the phase space, which is used to cut off all the motion trajectories for observing section cut point. From Figure5, we can see that the Poincare map of the grid multiscroll chaotic system is a piece of dense point set and has a hierarchical structure, which verifies the system’s chaotic motion state.


### 4.3. Hardware Results

The hardware circuits shown in Figure3 can be obtained, and experimental results are shown in Figure 6.Figure 6
Hardware circuit experimental results.From Figure6, it can be seen that the hardware circuit experiment results of the analog oscilloscope generate 2 × 2 × 2-grid multiscroll chaotic attractors, which verifies the physical feasibility of the proposed system. The phase rails of the proposed grid multiscroll chaotic attractor are separated in more directions and have more complex dynamic characteristics. Therefore, the grid multiscroll chaotic map is used as random phase sequence vectors. Compared with the traditional pseudo random sequences, the proposed grid multiscroll chaotic sequence can provide a large number of random sequences with good correlation characteristics, random characteristics, and high security, which meet the requirement of 5G mass connection.


### 4.4. PAPR Performance Simulation Results

In this paper, the QPSK modulation is adopted, the subcarrier number equals to 128, and the complementary cumulative distribution function (CCDF) is used to describe the PAPR distribution of the proposed system. In paper [6], the selected data utilization (SDU) algorithm is proposed to rotate the phase factor with specific selection conditions, which improves the PAPR performance of the traditional SLM algorithm. The PAPR performance comparison between the proposed GSCES algorithm and the traditional SLM algorithm and the SDU algorithm is shown in Figure 7.Figure 7
The PAPR performance comparison results.In Figure7, the variable original is the PAPR value calculated by 1 × 128 original signal.In the traditional SLM algorithm, the 1 × 128 original signal is input data,L groups input data are copied and are dot product of random phase vectors, IFFT transforms are calculated, and the PAPR values are obtained, and the variable SLM is the minimum PAPR value of the L candidate sequences. The traditional SLM algorithm using random phase vectors requires the transmission of phase information of subchannel, so the side band information is very huge, which not only increases the complexity but also reduces the efficiency of the system.In the proposed GSCES algorithm, the 1 × 128 original signal is the input data,L groups input data are copied, the real part and the imaginary part of input data are separated, L random phase vectors are generated by the proposed grid multiscroll chaotic maps, the real part and the imaginary part are separately dot product with the random phase vectors, IFFT transforms are calculated, and real and imaginary data are linearly added. The proposed GSCES algorithm extends the candidate sequence to L2 groups, and variable LSLM is the minimum PAPR value of L2 candidate sequences.In Figure7, compared with the traditional SLM algorithm and SDU algorithm, the proposed GSCES algorithm effectively reduces the PAPR of the 5G F-OFDM system, increases the candidate sequences, reduces calculation, and transmits data more efficiently.


### 4.5. BER Performance Simulation Results

The F-OFDM signal divides the frequency band of the system into several different sub-bands, which can be configured with different link parameters according to the actual service requirements, such as different subcarrier spacing, IFFT/FFT size, and CP length. In this section, we evaluate the bit error rate (BER) performance of the proposed GSCES algorithm in the F-OFDM system. In the additive white Gaussian noise (AWGN) channel, the system performance test is carried out, and the specific simulation parameter configuration of the F-OFDM system is shown in Table1.Table 1
Simulation setup.
Parameter
Value/description
Subcarrier size
64
IFFT/FFT size
1024
Baseband modulation mode
QPSK
Subcarrier spacing
15 KHz
CP length
16
Symbol duration
66.7μs
Channel model
AWGN
Type of filters
Square root raised cosineThe configuration of link parameters in this paper is shown in Table1. In the F-OFDM system, the BER performance of the proposed GSCES algorithm is shown in Figure 8.Figure 8
The BER performance results.From Figure8, it can be seen that the BER performance of the proposed GSCES algorithm has a certain degree of degradation compared with the original signal, but the degree of degradation is not large. Combining with Figure 7, it can be seen that the proposed GSCES algorithm can effectively improve the PAPR performance of the system, and when the transmission signal meets certain signal-to-noise ratio (SNR) conditions, it will not affect the BER performance of the system.


### 4.6. Computational Complexity Analysis

Assuming that both the SLM algorithm and the proposed GSCES algorithm generateL2 candidate sequences, the number of subcarriers is R, the oversampling rate is Q, and the IFFT transformation of RQ points requires RQ/2log2RQ complex multiplications and RQlog2RQ complex additions. The SLM algorithm needs L2 IFFT transforms to generate L2 phase sequences, i.e., a total of L2RQ/2log2RQ complex multiplications and L2RQlog2RQ complex additions. For the proposed GSCES algorithm, the Lth IFFT transform generates the real and imaginary parts of L candidate sequences.That is to say,LRQ/2log2RQ complex multiplications and LRQlog2RQ complex additions are needed. Then, the linear combination of the real and imaginary parts of L candidate sequences is used to generate L2 candidate sequences, which requires L2RQ complex additions.When the number of the candidate sequence equals toL2, the computational complexity of the proposed GSCES algorithm is compared with that of the SLM algorithm as shown in Table 2.Table 2
Computational complexity comparison of different algorithms.
Algorithm
Number of complex multiplications
Number of complex additions
SLM
L
2
R
Q
/
2
log
2
R
Q
L
2
R
Q
log
2
R
Q
GSCES
L
R
Q
/
2
log
2
R
Q
L
R
Q
log
2
R
Q
+
L
2
R
Q
GSCES/SLM
1
/
L
1
/
L
+
1
/
log
2
R
QTable2 shows that when the numbers of candidate sequences are all L2, the number of complex multiplication needed by the proposed GSCES algorithm is 1/L of that of the SLM algorithm and the number of complex addition is 1/L+1/log2RQ of the SLM algorithm. With the increase of the number of candidate sequences, the ratio decreases continuously. So, the proposed GSCES algorithm expands the number of candidate sequences by using the segmentation method and linear combination transformation. Compared with the SLM algorithm, the computational complexity is greatly reduced and the data can be transmitted more efficiently.


## 4.1. Dynamics of Lyapunov Exponents

For the system corresponding equation (4), the Runge–Kutta integration method is used with the length of time t = (0, 200), initial values (x, y, z) = (0.02, 0.01, 0.03), and the numerical simulation result of the Lyapunov exponents is shown in Figure 4.Figure 4
Lyapunov exponents of the proposed system.The Lyapunov exponents of the proposed system are given asLE1=0.055545,LE2=0.025606,andLE3=−0.881151, also LE1+LE2+LE3=−0.8. Moreover, the fractal dimension is given by(12)LD=j+1LEj+1∑i=1jLEi=2+0.055545+0.0256060.881151=2.0921.The proposed system has positive Lyapunov exponent and the dimension of Lyapunov is fractional, which further confirms that the system is in the state of chaos and the calculated Lyapunov exponent is reasonable. Moreover, this system produces strange attractor dimension LD = 2.0921, in line with the geometric characteristics of the chaotic attractor.


## 4.2. Poincare Map of Grid Multiscroll Chaotic System

For the system corresponding equation (4), the Runge–Kutta integration method is used with the length of time t = (0, 2600) and initial values (x, y, z) = (0.02, 0.01, 0.03). The Poincare map of the grid multiscroll chaotic system is shown in Figure 5.Figure 5
Poincare map of the grid multiscroll chaotic system.A Poincare section is selected in the phase space, which is used to cut off all the motion trajectories for observing section cut point. From Figure5, we can see that the Poincare map of the grid multiscroll chaotic system is a piece of dense point set and has a hierarchical structure, which verifies the system’s chaotic motion state.


## 4.3. Hardware Results

The hardware circuits shown in Figure3 can be obtained, and experimental results are shown in Figure 6.Figure 6
Hardware circuit experimental results.From Figure6, it can be seen that the hardware circuit experiment results of the analog oscilloscope generate 2 × 2 × 2-grid multiscroll chaotic attractors, which verifies the physical feasibility of the proposed system. The phase rails of the proposed grid multiscroll chaotic attractor are separated in more directions and have more complex dynamic characteristics. Therefore, the grid multiscroll chaotic map is used as random phase sequence vectors. Compared with the traditional pseudo random sequences, the proposed grid multiscroll chaotic sequence can provide a large number of random sequences with good correlation characteristics, random characteristics, and high security, which meet the requirement of 5G mass connection.


## 4.4. PAPR Performance Simulation Results

In this paper, the QPSK modulation is adopted, the subcarrier number equals to 128, and the complementary cumulative distribution function (CCDF) is used to describe the PAPR distribution of the proposed system. In paper [6], the selected data utilization (SDU) algorithm is proposed to rotate the phase factor with specific selection conditions, which improves the PAPR performance of the traditional SLM algorithm. The PAPR performance comparison between the proposed GSCES algorithm and the traditional SLM algorithm and the SDU algorithm is shown in Figure 7.Figure 7
The PAPR performance comparison results.In Figure7, the variable original is the PAPR value calculated by 1 × 128 original signal.In the traditional SLM algorithm, the 1 × 128 original signal is input data,L groups input data are copied and are dot product of random phase vectors, IFFT transforms are calculated, and the PAPR values are obtained, and the variable SLM is the minimum PAPR value of the L candidate sequences. The traditional SLM algorithm using random phase vectors requires the transmission of phase information of subchannel, so the side band information is very huge, which not only increases the complexity but also reduces the efficiency of the system.In the proposed GSCES algorithm, the 1 × 128 original signal is the input data,L groups input data are copied, the real part and the imaginary part of input data are separated, L random phase vectors are generated by the proposed grid multiscroll chaotic maps, the real part and the imaginary part are separately dot product with the random phase vectors, IFFT transforms are calculated, and real and imaginary data are linearly added. The proposed GSCES algorithm extends the candidate sequence to L2 groups, and variable LSLM is the minimum PAPR value of L2 candidate sequences.In Figure7, compared with the traditional SLM algorithm and SDU algorithm, the proposed GSCES algorithm effectively reduces the PAPR of the 5G F-OFDM system, increases the candidate sequences, reduces calculation, and transmits data more efficiently.


## 4.5. BER Performance Simulation Results

The F-OFDM signal divides the frequency band of the system into several different sub-bands, which can be configured with different link parameters according to the actual service requirements, such as different subcarrier spacing, IFFT/FFT size, and CP length. In this section, we evaluate the bit error rate (BER) performance of the proposed GSCES algorithm in the F-OFDM system. In the additive white Gaussian noise (AWGN) channel, the system performance test is carried out, and the specific simulation parameter configuration of the F-OFDM system is shown in Table1.Table 1
Simulation setup.
Parameter
Value/description
Subcarrier size
64
IFFT/FFT size
1024
Baseband modulation mode
QPSK
Subcarrier spacing
15 KHz
CP length
16
Symbol duration
66.7μs
Channel model
AWGN
Type of filters
Square root raised cosineThe configuration of link parameters in this paper is shown in Table1. In the F-OFDM system, the BER performance of the proposed GSCES algorithm is shown in Figure 8.Figure 8
The BER performance results.From Figure8, it can be seen that the BER performance of the proposed GSCES algorithm has a certain degree of degradation compared with the original signal, but the degree of degradation is not large. Combining with Figure 7, it can be seen that the proposed GSCES algorithm can effectively improve the PAPR performance of the system, and when the transmission signal meets certain signal-to-noise ratio (SNR) conditions, it will not affect the BER performance of the system.


## 4.6. Computational Complexity Analysis

Assuming that both the SLM algorithm and the proposed GSCES algorithm generateL2 candidate sequences, the number of subcarriers is R, the oversampling rate is Q, and the IFFT transformation of RQ points requires RQ/2log2RQ complex multiplications and RQlog2RQ complex additions. The SLM algorithm needs L2 IFFT transforms to generate L2 phase sequences, i.e., a total of L2RQ/2log2RQ complex multiplications and L2RQlog2RQ complex additions. For the proposed GSCES algorithm, the Lth IFFT transform generates the real and imaginary parts of L candidate sequences.That is to say,LRQ/2log2RQ complex multiplications and LRQlog2RQ complex additions are needed. Then, the linear combination of the real and imaginary parts of L candidate sequences is used to generate L2 candidate sequences, which requires L2RQ complex additions.When the number of the candidate sequence equals toL2, the computational complexity of the proposed GSCES algorithm is compared with that of the SLM algorithm as shown in Table 2.Table 2
Computational complexity comparison of different algorithms.
Algorithm
Number of complex multiplications
Number of complex additions
SLM
L
2
R
Q
/
2
log
2
R
Q
L
2
R
Q
log
2
R
Q
GSCES
L
R
Q
/
2
log
2
R
Q
L
R
Q
log
2
R
Q
+
L
2
R
Q
GSCES/SLM
1
/
L
1
/
L
+
1
/
log
2
R
QTable2 shows that when the numbers of candidate sequences are all L2, the number of complex multiplication needed by the proposed GSCES algorithm is 1/L of that of the SLM algorithm and the number of complex addition is 1/L+1/log2RQ of the SLM algorithm. With the increase of the number of candidate sequences, the ratio decreases continuously. So, the proposed GSCES algorithm expands the number of candidate sequences by using the segmentation method and linear combination transformation. Compared with the SLM algorithm, the computational complexity is greatly reduced and the data can be transmitted more efficiently.


## 5. Conclusions

Aiming at the shortcomings of the traditional SLM algorithm, the GSCES algorithm is proposed to solve the high PAPR problem of 5G F-OFDM systems. The proposed grid multiscroll chaotic maps instead of the traditional pseudo random sequence are used as random phase sequence vectors, which provide a large number of random sequences with good correlation characteristics, random characteristics, and high security. The proposed random phase sequence vectors can meet the needs of 5G mass connections. The original input signals are divided into real part and imaginary part, which are, respectively, multiplied by the proposed grid multiscroll chaotic sequences. The IFFT transforms are performed, respectively, the PAPR values are calculated by linear superposition, and the minimum PAPR value is selected for transmission. The numerical simulation results show that the proposed GSCES algorithm effectively increases the numbers of candidate sequences, reduces the PAPR values, the redundant information transmission, and the side band information transmission, and improves the transmission efficiency and security of the 5G F-OFDM system. Moreover, the hardware experimental results produce at 2 × 2 × 2-grid multiscroll chaotic attractor, which further proves the physical realization of the proposed system. The proposed schemes have a broad application prospect in 5G multicarrier modulation technology.



---

*Source: 5904801-2019-11-28.xml*