Keywords

1 Introduction

The performance evaluation of random access in the Long Term Evolution Advanced (LTE-A) system has become an important research topic in recent years, because the quality of random access will play an important role in the future 5G [1]. The most prominent feature of 5G technology is unmatched speed, which requires shorter access delay and higher random access success rate. The first and most important step in the uplink random access process of the LTE-A system is the successful transmission and correct resolution of the Physical Random Access Channel (PRACH) preamble signal [2]. At the receiving end, the preamble ID and the timing advance (TA) [3] can be correctly parsed by the preamble detection.

The sub-carrier spacing of the random access channel of the LTE-A system is very narrow, It is more susceptible to the influence of frequency offset. In the 3GPP protocol, the frequency offset in the mid-speed and low-speed modes is not processed, and the frequency offset processing algorithm in the high-speed mode only applies to the case where the Doppler frequency offset does not exceed the unit sub-carrier. Therefore, to ensure correct analysis of the random access detection signal, Doppler shift estimation and compensation need to be performed on the uplink.

With regard to the PRACH signal detection technology, experts and scholars at home and abroad have done a lot of research. For example, the preamble detection algorithm for large transmission delay proposed in [4], based on the strong correlation of sequences as an enhanced version of the algorithm to overcome the propagation delay; The ZC sequence grouping and in-group peak sliding detection algorithm proposed in [5], which has efficient hardware implementation by Discrete Fourier Transform (DFT) and large-point Fast Fourier Transform (FFT) algorithm. This type of algorithms do not analyze the increasingly serious effects of frequency offset. Other existing documents do not discuss the effect of preamble detection after frequency offset correction. For example, [6] only studied the frequency offset estimation method of PRACH signal.

Compared with the traditional frequency correlation detection method, this paper mainly completes the detection of the preamble ID signal of random access through Doppler frequency offset correction, sliding average filter processing, multiple sliding window peak detection. And the performance of the proposed method is better.

The remainder of this article is organized as follows. The PRACH signal detection process and effect of Doppler frequency offset on random access signal detection are detailed in Sect. 2. The improved detection method is detailed in Sect. 3. Performance evaluation results that demonstrate the efficiency of the traditional and proposed algorithms are presented in Sect. 4. Conclusions are drawn in Sect. 5.

2 Signal Detection and Effect of Frequency Offset

2.1 PRACH Signal Detection Process

The random access preamble sequence is generated by the cyclic shift of the Zadoff–Chu (ZC) sequence [2]. Since the ZC sequence just satisfies the good correlation characteristics required for the random access preamble sequence, the definition of ZC sequence is

$$\begin{aligned} {x_u}(n) = {e^{ - j\frac{{\pi un(n + 1)}}{{{N_{zc}}}}}},0 \le n \le {N_{zc}} - 1 \end{aligned}$$
(1)

Where \(N_{zc}\) is the length of the ZC sequence, u is physical root sequence.

Fig. 1.
figure 1

Random access to the receiving process.

The random access preambles with zero correlation zones based on the \(u^{th}\) root ZC sequence with length of \({N_{cs}} - 1\) are defined by cyclic shift according to

$$\begin{aligned} {x_{u,v}}(n) = {x_u}((n + {C_v})\bmod {N_{zc}}) \end{aligned}$$
(2)

Where \(C_v\) is the cyclic shift value and \(N_{cs}\) is the length of cyclic shift.

The random access process eNodeB receiving end [7] is shown in Fig. 1. The preamble signal is synchronized with the local ZC root sequence after CP synchronization, (Cyclic Prefix) CP removal, down sampling, DFT, and sub-carrier selection to obtain correlation values in the frequency domain correlation. And then Inverse Discrete Fourier Transform (IDFT) and modular-squares are performed on correlation values to obtain time-domain correlation energy power delay profile (PDP) sequences. The correlation peak value of PDP sequence is searched by the detection threshold, to judge whether there is random access. If there is random access, preamble ID and timing advance (TA) are calculated.

2.2 Effect of Doppler Frequency Offset

When the user equipment (UE) moves fast, a large Doppler shift occurs, affecting the zero auto-correlation of the preamble sequence. Assuming \(\varDelta f\) is the Doppler shift, and the define of preamble sequence with containing frequency offset is

$$\begin{aligned} \begin{array}{l} {x_u}(n,\varDelta f) = {e^{ - j\frac{{\pi un(n + 1)}}{{{N_{zc}}}}}} \cdot {e^{j2\pi n\frac{{\varDelta f}}{{{f_s}}}}}\\ {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} {} = {x_u}(n - {d_u}) \cdot {e^{j2\pi n\frac{{\varDelta f \cdot {T_{seq}} - k}}{{{f_s}}}}} \cdot {e^{j\phi }} \end{array} \end{aligned}$$
(3)

Where \({T_{seq}}\) is the last time of preamble sequence, \({f_s}\) is the sampling frequency, \({e^{j\phi }}\) is a phase rotation constant with modulus 1 and n independent. According to formula 3, preamble sequence has changed with containing Doppler shift. Assuming \(\varDelta f = k{f_{RA}} = k\frac{1}{{{T_{seq}}}}\), the value of displacement is \({d_u}\), \({d_u}\) satisfies \(({d_u} \cdot u)\bmod {N_{zc}} = 1\), the original main peak completely disappears and the position transfers to \({C_v} \pm (k + 1){d_u}\).

Thus, In order to achieve the uplink synchronization between the user equipment and the base station, it is necessary to eliminate the frequency offset on the signal detection at the receiving end.

3 Improved Detection Process

3.1 Frequency Offset Estimation and Correction

To analyze the influence of frequency offset, it is necessary to perform frequency offset correction on the receiver signal. In the 3GPP protocol, the frequency offset in the mid-speed and low-speed modes is not processed, and cyclic shift limit set algorithm is used by default in high-speed mode. But frequency offsets in mid-speed and low-speed modes sometimes lead to severe false alarm rates. The cyclic shift limit set algorithm in high-speed mode is computationally complex [8], takes a long time, requires cooperation from the upper layer, and only applies to the case where the Doppler frequency offset does not exceed the unit sub-carrier. Therefore, without considering the UE moving speed, it is better to use the frequency offset estimation method to correct the frequency offset.

The CP in the preamble signal is copied from the last part of the useful signal, and the length of CP is known. According this redundant information, the maximum likelihood (ML) frequency offset estimation method is used to estimate the time and frequency offsets. The signal received from the PRACH channel is modeled from both time and frequency domain, to analyze the time and frequency shift of the signal at the receiving end.

First, the received signal is modeled. The received signal contains the time offset and frequency offset. The time shift is represented by the channel impulse response \(h(n - d)\). The frequency shift is expressed by multiplying a rotation factor. Thus, the definite of the received signal is

$$\begin{aligned} r(n) = x(n - d) \cdot {e^{j \cdot \frac{{2\pi n\varDelta f}}{{{N_{zc}}}}}} + w(n) \end{aligned}$$
(4)

Assuming L is the length of CP, \({T_{GP}}\) is ignored, so the length of the received signal is \({N_{zc}} + L\). Assuming that the time offset and frequency offset are determined, then the probability density function of the \(2{N_{zc}} + L\) sampling point for the log likelihood function is

$$\begin{aligned} \wedge (d,\varDelta f) = \log f(r(n)|d,\varDelta f) \end{aligned}$$
(5)

Through collection selection and related calculations, all constants and factors that have no effect on the results of the maximum likelihood function are eliminated as useless factors. So the Eq. 5 is simplified to

$$\begin{aligned} \wedge (d,\varDelta f) = \gamma (d)\cos (2\pi \varDelta f + \angle \gamma (d)) - \beta \phi (d) \end{aligned}$$
(6)

where

$$\begin{aligned} \begin{array}{l} \gamma (d) = \sum \limits _{n - d}^{n - d + L - 1} {r(n){r^*}(n + N)} \\ \phi (d) = \frac{1}{2}\sum \limits _{n - d}^{n - d + L - 1} {({{\left. {\left| {r(n)} \right. } \right| }^2} + {{\left. {\left| {r(n + N)} \right. } \right| }^2})} \\ \beta = \frac{{SNR}}{{SNR + 1}} \end{array} \end{aligned}$$
(7)

Equations 6 and 7 indicate that the unknown parameters are d and \(\varDelta f\). The likelihood function gets the maximum score in two steps. First, let d be a constant and find the maximum value of the likelihood function corresponding to \(\varDelta f\). When the case is \(\cos (2\pi \varDelta f + \angle \gamma (d)) = 1\), we obtain the maximum value.

$$\begin{aligned} \begin{array}{l} 2\pi \varDelta f + \angle \gamma (d) = 2k\pi \\ \varDelta {{\hat{f}}_{ML}}(d) = - \frac{1}{{2\pi }}\angle \gamma (d) + k \end{array} \end{aligned}$$
(8)

When the frequency offset does not exceed the unit sub-carrier, then \(k = 0\), and when the frequency offset exceeds the unit sub-carrier, then k value needs to be calculated by trial. Second, the likelihood function is \(\wedge (d,\varDelta {\hat{f}_{ML}}) = \left. {\left| {\gamma (d)} \right. } \right| - \left. {\left| {\beta \phi (d)} \right. } \right| \). When the likelihood function gets maximum value, d is estimated. Finally, the d and \(\varDelta f\) are

$$\begin{aligned} \begin{array}{l} {{\hat{d}}_{ML}} = \arg \mathop {\max }\limits _d \left\{ {\left| {\angle \gamma (d)} \right| - \left| {\beta \phi (d)} \right| } \right\} \\ \varDelta {{\hat{f}}_{ML}}(d) = - \frac{1}{{2\pi }}\angle \gamma (d) + k \end{array} \end{aligned}$$
(9)

Doppler frequency offset is corrected based on frequency offset value by multiplying frequency deviation factor \(\exp (\frac{{j2\pi n\varDelta {{\hat{f}}_{ML}}}}{{{N_{zc}}}})\). TA is calculated by time deviation factor, but base station signal processing complexity is increased and will not be discussed here.

3.2 Sliding Average Filter Processing

The sliding average filter is a Finite Impulse Response (FIR) filter with a coefficient of 1. The peak value in the window is processed by the sliding average filter to eliminate the effect of multipath, enhance the intensity of the main peak, and reduce the false alarm probability.

Table 1. Different format parameters configuration.

The frequency offset-corrected received signal is multiplied by the local ZC root sequence in the frequency domain, and the result of the time domain correlation is obtained by the IFFT. Then the time domain results of the multiple antennas at the receiving end are summed to obtain the energy-combined PDP spectrum sequence p(k).

Fig. 2.
figure 2

Related peaks change with sliding average filtering.

According to the cyclic shift value and the number of multipaths in different channel models, the value of the \(MA\_value\) is set, \(MA\_value = MA\_order(k)\), where \(k = zeroCorrelationZoneConfig + 1\), values of zeroCorrelationZoneConfig and \(MA\_order\) are listed in Table 1. The value of moving average group delay is calculated by formula \(\left\lfloor {MA\_value/2} \right\rfloor \), and the \({N_{shift\_num}}\) values at the end of p(k) are advanced, the end of p(k) is filled with 0 and the number of 0 is the value of moving average group delay. When the format of preamble is 0 3, the value of \({N_{shift\_num}}\) is 3; when the format of preamble is 4, the value of \({N_{shift\_num}}\) is 0.

FIR filtering is performed according to the value of \(MA\_value\), and then the data of the group delay of p(k) is removed. a new energy-combined PDP spectrum sequence \(p'(k)\) is obtained, since time domain peak values are corrected by value of \(cal\_value\), the value of \(cal\_value\) is listed in Table 1.

When the relevant signal output performance deteriorates, the peak energy is not obvious due to noise, and it is not easy to do peak detection. Figure 2 manifest that it is improved by sliding average filter processing to eliminate the effect of multipath, enhance the main peak intensity, and increase the probability of successful detection.

3.3 Multiple Sliding Window Peak Detection

On the basis of time-domain peak correction and main peak enhancement, multiple sliding window peak detection is performed, which can further reduce the false alarm rate and increase the success rate of random access.

The noise power is calculated according to the new energy-combined PDP spectrum sequence \(p'(k)\), and then according to the noise power and protocol requirements that the false alarm rate should be less than 0.1%, the absolute threshold \(Thre\_A\) and the detection threshold \(Thre\_B\) are calculated.

The detection window is divided. According to the new energy-combined PDP spectrum sequence \(p'(k)\), the detection window is divided by formula 10, and finally divided into 64 detection windows.

$$\begin{aligned} \left\{ \begin{array}{l} main\_win = (2048*mDetect)/839\\ mDetect = 839 - {C_v}\\ win\_length = 2048*{N_{cs}}/839 \end{array} \right. \end{aligned}$$
(10)

Where \(main\_win\) is the position of main window, \(win\_length\) is the length of detection window. Taking format 0 as an example, the preamble sequence length \({N_{zc}}\) is 839, and the cyclic shift value \({N_{cs}}\) is 13, so a root sequence can generate \(\left\lfloor {839/13} \right\rfloor = 64\) preamble sequences, the \(win\_length\) is 31.

Searching for the maximum value of the main detection window through three kinds of rectangular windows with a multiple relationship, the peak value and the position are detected. Using the first sliding rectangular window of length \({N_{cs}}\) to slide within each main detection window (\({N_{cs}}\) is the minimum non-zero value of the limit set, 13 at low speed, and 15 at high speed), calculate the total energy of the data within the window, search for the peak \(MaxValue\_win1\) of the window and the corresponding starting position; using the second sliding rectangular window of length \(\left\lfloor {\frac{{{N_{cs}}}}{2}} \right\rfloor \) to slide within the first sliding rectangular window where the peak is detected, search for the peak \(MaxValue\_win2\) of the window and the corresponding starting position; using the third sliding rectangular window of length \(\left\lfloor {\frac{{{N_{cs}}}}{4}} \right\rfloor \) to slide within the second sliding rectangular window where the peak is detected, search for the peak \(MaxValue\_win3\) of the window and the corresponding starting position.

Finally, preamble ID and timing advance are calculated according to the value \(MaxValue\_win3\) and the corresponding starting position.

4 Simulation Results

The performance of the preamble detection in LTE-A system is measured by false alarm probability and successful detection probability [9]. According to the protocol requirements of [10], the false alarm probability shall be less than or equal to 0.1%. The probability of successful detection shall be equal to or exceed 99%. According to the noise power and false alarm probability protocol requirements, the random access preamble detection thresholds are obtained by a large number of simulations. The PRACH parameters used in simulation are listed in Table 2.

Figure 3 shows that when the frequency offset is 600 HZ, the proposed method performance is better than traditional method whether it is AWGN channel or ETU channel. Due to the influence of frequency offset, the false alarm rate rises and the detection performance decrease. In this case, the detection threshold needs to be raised. But the proposed method does not need to increase the detection threshold. Under the condition of the false alarm probability is equal to 0.1%, the SNR of the proposed method is about 20 dB when the channel condition is AWGN and the SNR of the proposed method is about 17.8 dB when the channel condition is ETU.

Table 2. Simulation parameters.
Fig. 3.
figure 3

Performance of different methods for 600 Hz frequency offset.

Fig. 4.
figure 4

Performance of different methods for 900 Hz frequency offset.

Fig. 5.
figure 5

Performance of different methods for 1500 Hz frequency offset.

Figure 4 shows that the false alarm probability gradually decreases as the SNR increases. With the increase of SNR in AWGN channel, the reduction of false alarm rate of traditional detection algorithm becomes more and more slowly. However, with the increase of SNR, the reduction of false alarm rate of proposed detection algorithm becomes more increase. The false alarm probability performance is 3.8 dB better than the protocol requirement in AWGN channel and the false alarm probability performance is 1 dB better than the protocol requirement in ETU channel.

Figure 5 shows the false alarm probability is very large when the frequency offset exceeds 1250 Hz unit sub-carrier. Under the condition of the false alarm probability is equal to 0.1%, the SNR of the proposed method is about 14.7 dB and the SNR of the traditional method is about 10 dB when the channel condition is AWGN. The false alarm probability performance is 1.2 dB better than the traditional method in ETU channel.

In a word, the proposed method has different degrees of performance improvement for different frequency offset. We can draw a conclusion that the false alarm performance under the AWGN channel is at least 3.8 dB better, and the false alarm performance under ETU channel is at least 1 dB better.

5 Conclusion

In this paper, we formulated and studied a mixed-combinatorial programming problem for EE optimization in a downlink multiuser OFDM DASs. We divided the optimization problem into two sub-problems, which are DAU selection, and subcarrier assignment and power allocation optimization. Firstly, an energy efficient resource allocation scheme is presented. Then, we transform the optimization problem into a subtractive form, and solved by Lagrangian dual decomposition. From simulation results, we can see the better performance of the proposed algorithm. In the future, the inter-cell interference and cell-edge users’ performance will be taken into consideration to how to design EE optimization scheme.