Unambiguous Acquisition/Tracking Technique Based on Sub-Correlation Functions for GNSS Sine-BOC Signals

The autocorrelation function (ACF) of the Binary Offset Carrier modulation (BOC) signal for Global Navigation Satellite System (GNSS) has multiple peaks, ambiguity is easily generated during the synchronization of the baseband signal. Some methods have been proposed to remove the ambiguity, but the performance is not suitable for high-order BOC signals or does not maintain narrow correlation characteristics. This paper proposes a sub-function reconstruction synchronization algorithm to solve this problem, of which the key is to design a new local auxiliary code: the local Pseudo-Random Noise (PRN) code is divided into several new codes with different delays. The auxiliary code performs a coherent integration operation with the received signal. Then, a correlation function without any positive side peaks is obtained by multiplying the two correlation results to make the acquisition/tracking completely unambiguous. The paper gives a design scheme of navigation signal acquisition/tracking and deduces the theoretical analysis of detection performance. The phase discrimination function is provided. The performance of the method is analyzed from both theoretical and simulation aspects. Compared with the Binary phase shift keying-like (BPSK-LIKE) method, Subcarrier Phase Cancellation (SCPC) method and the Autocorrelation Side-Peak Cancellation Technique (ASPeCT) method, the proposed method has the best detection probability for the acquisition, which is 0.5 dB-Hz better than ASPeCT. For tracking, the proposed method performs best in terms of phase-detection curve, anti-multipath performance, and anti-noise performance. For high-order BOC signals, the SRSA technique successfully removes the false lock points, and there is only one multipath error envelope, and the code tracking error is almost the same as the ASPeCT method.


Introduction
Compared to traditional the Global Navigation Satellite System (GNSS), the addition of BOC modulation signals marks a breakthrough in the development of modern GNSS. The frequency spectrum splitting characteristic of the BOC signal helps different GNSS signals efficiently utilize limited band resources. The ACF of the BOC modulation signal also has a narrow correlation main peak, and a large main peak slope allows the signal to have better confidentiality and location accuracy. However, there is a severe ambiguity in the synchronization processing of BOC signal, because the S BOC(kn,n) (t) = A·D(t)·c(t)·sign(sin(2π f sc t)) (1) In the above formula, A represents the signal amplitude; D(t) represents the navigation signal data code; c(t) is PRN code; Subcarriers are represented by sign(sin(2π f sc t)). Using f 0 = 1.023 MHz as the reference frequency, BOC(kn, n) has the characteristics of PRN code rate f c = n f 0 and subcarrier frequency f sc = kn f 0 . N = 2kn/n = 2k is defined as the modulation factor of BOC(kn, n). The BOC(kn, n) code after PRN code and subcarrier modulation can be expressed as: Since the PRN code and subcarrier have specific correlation characteristics, the correlation function of the BOC(kn, n) signal has multiple peaks. The mathematical formula of the autocorrelation function R B (τ) and the cross-correlation function R B/P (τ) of the BOC(kn, n) is [10] where tri(τ − aT c ) represents a triangular function with peak at a·Tc. The triangle duration is 2T sc , and T sc = T c /N. Tc = 1/ f c is a PRN code chip duration. τ indicates the code phase delay. Figure 1 is a comparison of autocorrelation functions of BPSK, BOC(n, n) and BOC(2n, n). Figure 2 is a comparison of the cross-correlation functions between the BOC(n, n)/BOC(2n, n) signals and the PRN code. As can be seen from the figures, the larger the modulation factor, the greater the number of correlation peaks.  (2) Since the PRN code and subcarrier have specific correlation characteristics, the correlation function of the BOC(kn, n) signal has multiple peaks. The mathematical formula of the autocorrelation function ( ) B R  and the cross-correlation function ( ) / BP R  of the BOC(kn, n) is [10] ( ) ( ) ( ) ( )    Figure 2 is a comparison of the cross-correlation functions between the BOC(n, n)/BOC(2n, n) signals and the PRN code. As can be seen from the figures, the larger the modulation factor, the greater the number of correlation peaks.  However, for BOC signals, once the side peaks are acquired, the false locks will occur during the subsequent tracking phase [11]. Especially for high-order BOC signals, it is difficult to distinguish the main peak and the sub-peak of the correlation function, which is more likely to cause the false lock phenomenon. The relationship between the false acquisition probability of different factors N and the signal-to-noise ratio (SNR) is given in Figure 3. SNR is defined as the ratio of signal to noise in an electronic device or electronic system. It can be seen that in the same SNR environment, the larger the modulation factor, the greater the probability of false acquisition. At −27 dB, the false acquisition probability of N = 4 and N = 2 are the same, close to zero, and the false acquisition probability of N = 8 is still 0.05.
In the code tracking stage, the classic EMLP (Early-Minus-Late-Power) phase discriminator is used, and the phase discrimination formula is   (5)  represents the estimation error of the code phase. d is the delay interval between the early and late correlators. Figure 4 shows the discrimination curves for the BPSK signal, the BOC(1,1) signal, and the BOC(10,5) signal in an infinite bandwidth. False-lock point corresponds to a zero of the discriminator where the S-curve presents a positive slope. Obviously, the larger the modulation factor, the more false-lock points, which are generated by the side peaks of ACF. This situation will result in intolerable code tracking errors. However, for BOC signals, once the side peaks are acquired, the false locks will occur during the subsequent tracking phase [11]. Especially for high-order BOC signals, it is difficult to distinguish the main peak and the sub-peak of the correlation function, which is more likely to cause the false lock phenomenon. The relationship between the false acquisition probability of different factors N and the signal-to-noise ratio (SNR) is given in Figure 3. SNR is defined as the ratio of signal to noise in an electronic device or electronic system. It can be seen that in the same SNR environment, the larger the modulation factor, the greater the probability of false acquisition. At −27 dB, the false acquisition probability of N = 4 and N = 2 are the same, close to zero, and the false acquisition probability of N = 8 is still 0.05.   In the code tracking stage, the classic EMLP (Early-Minus-Late-Power) phase discriminator is used, and the phase discrimination formula is Sensors 2020, 20, 485 5 of 23 ∆τ represents the estimation error of the code phase. d is the delay interval between the early and late correlators. Figure 4 shows the discrimination curves for the BPSK signal, the BOC(1,1) signal, and the BOC(10, 5) signal in an infinite bandwidth. False-lock point corresponds to a zero of the discriminator where the S-curve presents a positive slope. Obviously, the larger the modulation factor, the more false-lock points, which are generated by the side peaks of ACF. This situation will result in intolerable code tracking errors. Figure 3. The false acquisition probability of three different factors.

Generation of Sub-PRN Code Sequences
By definition, the BOC code and the PRN code are expressed in the form of pulses as follows.
C T P is a rectangular pulse with a period of C T and an amplitude of 1.

Generation of Sub-PRN Code Sequences
By definition, the BOC code and the PRN code are expressed in the form of pulses as follows.
P T C is a rectangular pulse with a period of T C and an amplitude of 1. P T sc is a rectangular pulse with a duration of T sc and an amplitude of 1, and T sc = T c /N.C i is the symbol of the chip, C i ∈ (−1, 1). M is the total number of pulses in a chip interval, which means that each PRN code chip is divided into M segments. Here M = N. This paper uses S PRN,i (t) to represent the i-th sub-PRN code. Then, separate the local PRN code, retain the i-th segment, and set the rest to zero. When M = 2, as shown in Figure 5, when M = 4, as shown in Figure 6.
Sensors 2020, 20, x FOR PEER REVIEW 6 of 23 code. Then, separate the local PRN code, retain the i-th segment, and set the rest to zero. When M = 2, as shown in Figure 5, when M = 4, as shown in Figure 6.  It is supposed that the coherent integration time is coh T , then the cross-correlation function of BOC code and PRN code is:  Sensors 2020, 20, x FOR PEER REVIEW 6 of 23 code. Then, separate the local PRN code, retain the i-th segment, and set the rest to zero. When M = 2, as shown in Figure 5, when M = 4, as shown in Figure 6.  It is supposed that the coherent integration time is coh T , then the cross-correlation function of BOC code and PRN code is:  It is supposed that the coherent integration time is T coh , then the cross-correlation function of BOC code and PRN code is:   And it can also be represented by triangular functions. When M = 2, it can be expressed as    And it can also be represented by triangular functions. When M = 2, it can be expressed as And when M = 4 and the triangle duration is 2 sc T , it can be expressed as  And it can also be represented by triangular functions. When M = 2, it can be expressed as And when M = 4 and the triangle duration is 2T sc , it can be expressed as

Correlation Function Combination
By analyzing the sub-correlation functions of the BOC(kn, n) signal with each modulation factor, it is found that the main peak position of the correlation function of the first segment corresponds to the main peak position of the correlation function of the M-th segment, and the side peak corresponds to the zero points. No matter what value M is, the product of R B/P1 and R B/PM can yield non-zero value only near the (0,0) point. And R B/PM can be obtained by R B/P1 shift (M − 1)Tc/M and multiply by −1. Thus, combining correlation functions, such as formulas It can be found that R 0 has two small sub-peaks with a negative value and a positive main peak. To achieve the purpose of eliminating sub-peaks, the combination algorithm is Figure 9 is a simulation diagram of the combination function for M = 2 and M = 4. It can be seen from the graph that the larger M is, the smaller the main peak width of the combination function is.

Correlation Function Combination
By analyzing the sub-correlation functions of the BOC (kn, n) signal with each modulation factor, it is found that the main peak position of the correlation function of the first segment corresponds to the main peak position of the correlation function of the M-th segment, and the side peak corresponds to the zero points. No matter what value M is, the product of It can be found that 0 R has two small sub-peaks with a negative value and a positive main peak. To achieve the purpose of eliminating sub-peaks, the combination algorithm is Figure 9 is a simulation diagram of the combination function for M = 2 and M = 4. It can be seen from the graph that the larger M is, the smaller the main peak width of the combination function is.

The Acquisition Structure Diagram
When the receiver generates a local signal, the local PRN sequence is separated to obtain a subsignal. The sub-signal is correlated with the received signal to obtain a sub-correlation function, and the sub-correlation function is combined according to Equation (17) to get a correlation function of the no secondary peak. Figure 10 shows the SRSA acquisition schematic. It is worth noting that the sub-correlation functions can be obtained from each other. According to this property, only one sub-

The Acquisition Structure Diagram
When the receiver generates a local signal, the local PRN sequence is separated to obtain a sub-signal. The sub-signal is correlated with the received signal to obtain a sub-correlation function, and the sub-correlation function is combined according to Equation (17) to get a correlation function of the no secondary peak. Figure 10 shows the SRSA acquisition schematic. It is worth noting that the sub-correlation functions can be obtained from each other. According to this property, only one sub-correlation function can be generated, and the generated sub-correlation function can be delayed to get other functions.
Sensors 2020, 20, x FOR PEER REVIEW 9 of 23 correlation function can be generated, and the generated sub-correlation function can be delayed to get other functions. The steps for signal acquisition are as follows: Step 1: The carrier NCO generates two orthogonal local carriers, and mixes with the received intermediate frequency (IF) BOC(kn, n) signal with the purpose of cancelling the carrier.
Step 2: Generate a local PRN code. And then generate a local auxiliary code according to the method in Section 2.2.
Step 3: The auxiliary code is coherently integrated with the input signal to obtain a subcorrelation function Step 4: Delay is obtained.
Step 5: According to the formula (15), the final algorithm operation is performed to obtain a correlation function without a sub-peak, that is, the detection value V.

Detection Performance Analysis
The input BOC signal is expressed as follows: 2A is the amplitude of the input signal, ( ) C t is the PRN code, ( ) D t is the navigation data, τ is the code delay of the input signal,   The steps for signal acquisition are as follows: Step 1: The carrier NCO generates two orthogonal local carriers, and mixes with the received intermediate frequency (IF) BOC(kn, n) signal with the purpose of cancelling the carrier.
Step 2: Generate a local PRN code. And then generate a local auxiliary code according to the method in Section 2.2.
Step 3: The auxiliary code is coherently integrated with the input signal to obtain a sub-correlation function R B/P1 .
Step 4: Delay R B/P1 by sample points of (M − 1)/M PRN chip length, and a new sub-function R B/PM is obtained.
Step 5: According to the Formula (15), the final algorithm operation is performed to obtain a correlation function without a sub-peak, that is, the detection value V.

Detection Performance Analysis
The input BOC signal is expressed as follows: 2A is the amplitude of the input signal, C(t) is the PRN code, D(t) is the navigation data, τ is the code delay of the input signal, ∆ f D is the Doppler frequency of the input signal, f IF is the intermediate frequency, S c (t) is the subcarrier, ϕ is the initial phase of carrier and N n is the noise term.
Mixing input signal with local carrier. For simplicity, we exploit the baseband complex envelope expression of S O (t).
N c and N s are independent Gaussian random processes. They have the same zero mean and double-sided power spectrum density N 0 . Then, multiply the local auxiliary signal according to the SRSA principle.
Then perform coherent integration, D(t) is a constant, does not affect the overall process, omitted here, no need to consider the change of navigation data bits.
When the carrier and code loop tracking is successful, the complex exponential is almost is the signal part of S M , and the non-coherent accumulation time is M noh . In digital signal processing and communication theory, the normalized sin c function is usually defined as sin c(x) = sin(πx)/πx. According to the proposed combination principle, the final detection value is The main peak of the correlation function is much higher than the side peak. |S 1 × S M | + S 1 × S M can be approximated as 2|S 1 × S M |. Assuming that X 0 is the case that only noise presents in the received signal, X 1 is the other case that both signal and noise exist, here the two cases are analysed [12]. When the target signal does not exist, it can also be said that the received signal is phase-aligned with the local signal code outside of one chip. At this time, the detection statistic value V 1 obeys Rayleigh distributions. Suppose the probability density function (PDF) at this time is P V 1 , and the false alarm probability can be expressed as Therefore, according to Equation (25), the threshold value V can be reversed after the false alarm probability and noise power are given. σ n 2 = C/ 10 0.1dB /0.004. C is carrier power of the input (IF) signal. dB is the carrier-to-noise ratio range.
When the received signal is aligned with the locally generated chip, the detected value obeys the Rice distribution, and its mean and variance are when M noh is large, the detection statistic V 2 is approximately obeying the Rice distribution. P V 2 (x) is assumed to be the probability density at this time, and the detection probability P d is: a 2 /σ 2 is the signal-to-noise ratio (SNR), I 0 (x) is the Modified Bessel function of the first kind. The detection statistics can only be maximized when the code phase error τ is close to zero.

Performance Simulation and Analysis
Based on the Matlab platform, the intermediate frequency of the input signal is 4.092 MHz, the sampling rate is set to 40.92 MHz, the code phase offset is in the 601th sampling point, the Doppler is set to 2000 Hz. The coherent integration time is T coh = 1 ms. The four acquisition methods of SRSA, SCPC, ASPeCT and BPSK-LIKE are compared to the performance. Figures 11 and 12 shows a normalized two-dimensional acquisition comparison of the four methods. When M = 2, it can be found that the SRSA method is better than the SCPC, ASPeCT, and BPSK-LIKE methods. In terms of main peak span, the SRSA main peak spans 20 sampling points (half chip points) and is the same as the ASPeCT method, and is better than the BPSK-LIKE method and the SCPC method 80 sampling points (i.e., two-chip points). For the peak value, the SRSA method is the same as the ASPeCT and SCPC methods and 10% higher than the BPSK-LIKE method. And the SRSA method removes the effects of side peaks while the ASPeCT still has two smaller sub-peaks. When M = 4, the SCPC and BPSK-LIKE methods remove the sub-peaks, but still do not retain the narrow correlation characteristic of BOC signal. The ASPeCT method has more sub-peaks of the correlation function when M = 4, which is not applicable to BOC signals above the 2nd order. And the SRSA can still completely remove all the sub-peaks of the 4th-order BOC, and the main peak span is only ten sampling points.    12 shows a normalized two-dimensional acquisition comparison of the four methods. When M = 2, it can be found that the SRSA method is better than the SCPC, ASPeCT, and BPSK-LIKE methods. In terms of main peak span, the SRSA main peak spans 20 sampling points (half chip points) and is the same as the ASPeCT method, and is better than the BPSK-LIKE method and the SCPC method 80 sampling points (i.e., two-chip points). For the peak value, the SRSA method is the same as the ASPeCT and SCPC methods and 10% higher than the BPSK-LIKE method. And the SRSA method removes the effects of side peaks while the ASPeCT still has two smaller sub-peaks. When M = 4, the SCPC and BPSK-LIKE methods remove the sub-peaks, but still do not retain the narrow correlation characteristic of BOC signal. The ASPeCT method has more sub-peaks of the correlation function when M = 4, which is not applicable to BOC signals above the 2nd order. And the SRSA can still completely remove all the sub-peaks of the 4th-order BOC, and the main peak span is only ten sampling points.

Computational Complexity Analysis
The one millisecond signal is received in the pre-set simulation environment, and the number of frequency searches is 41 times. Using the FFT parallel code phase search method, the number of complex additions required to complete a 40,920 points FFT is: One complex multiplication is equal to four real multiplications and two real additions, and a complex addition equals two real additions [13,14]. Table. 1 is the computational complexity of the four algorithms in the acquisition. It shows from the table that the computational complexity of SRSA is the same as ASPeCT, and is better than BPSK-Like and SCPC.

Acquisition Probability Analysis
The Monte Carlo method is used to simulate the detection probability of BOC (1, 1) and BOC (10, 5) under different acquisition methods. Set the carrier-to-noise ratio range of the simulation environment to , set the false alarm probability, the non-coherent accumulation number is L = 10, and perform 2000 statistics as shown in Figures 13 and 14.

Computational Complexity Analysis
The one millisecond signal is received in the pre-set simulation environment, and the number of frequency searches is 41 times. Using the FFT parallel code phase search method, the number of complex additions required to complete a 40,920 points FFT is: n log n 2 = 40, 920 log 40,920 The number of complex multiplications required is One complex multiplication is equal to four real multiplications and two real additions, and a complex addition equals two real additions [13,14]. Table 1 is the computational complexity of the four algorithms in the acquisition. It shows from the table that the computational complexity of SRSA is the same as ASPeCT, and is better than BPSK-Like and SCPC.

Acquisition Probability Analysis
The Monte Carlo method is used to simulate the detection probability of BOC(1, 1) and BOC(10, 5) under different acquisition methods. Set the carrier-to-noise ratio range of the simulation environment to , set the false alarm probability, the non-coherent accumulation number is L = 10, and perform 2000 statistics as shown in Figures 13 and 14. Sensors 2020, 20, x FOR PEER REVIEW 13 of 23  As can be seen from the above figure, the SRSA method has obvious advantages when the acquisition probability is higher than 0.9. For 2nd order BOC signals, the SRSA acquisition probability is better than the BPSK-LIKE, SCPC and ASPeCT methods 2.5 dB-Hz, 1 dB-Hz, and 0.5 dB-Hz. For high-order BOC signals, the ASPeCT method cannot suppress the sub-peaks of the correlation function, and the effect is not satisfactory. There is no comparison here. The SRSA acquisition probability is better than the BPSK-LIKE and SCPC methods 0.5 dB-Hz and 0.25 dB-Hz when the acquisition probability is higher than 0.9.

Peak-to-Average Ratio Analysis
The peak-to-average ratio is also an important indicator for evaluating the performance of an algorithm, and is defined as the ratio of the peak value to the average value of the correlation result obtained by the acquisition. In the preset simulation environment, the BPSK-LIKE, SCPC, ASPeCT and SRSA methods were compared by repeating 3000 experiments, and the peak-to-average ratios of the four methods at different signal-to-noise ratios were obtained, as shown in Figures 15 and 16.  As can be seen from the above figure, the SRSA method has obvious advantages when the acquisition probability is higher than 0.9. For 2nd order BOC signals, the SRSA acquisition probability is better than the BPSK-LIKE, SCPC and ASPeCT methods 2.5 dB-Hz, 1 dB-Hz, and 0.5 dB-Hz. For high-order BOC signals, the ASPeCT method cannot suppress the sub-peaks of the correlation function, and the effect is not satisfactory. There is no comparison here. The SRSA acquisition probability is better than the BPSK-LIKE and SCPC methods 0.5 dB-Hz and 0.25 dB-Hz when the acquisition probability is higher than 0.9.

Peak-to-Average Ratio Analysis
The peak-to-average ratio is also an important indicator for evaluating the performance of an algorithm, and is defined as the ratio of the peak value to the average value of the correlation result obtained by the acquisition. In the preset simulation environment, the BPSK-LIKE, SCPC, ASPeCT and SRSA methods were compared by repeating 3000 experiments, and the peak-to-average ratios of the four methods at different signal-to-noise ratios were obtained, as shown in Figures 15 and 16. As can be seen from the above figure, the SRSA method has obvious advantages when the acquisition probability is higher than 0.9. For 2nd order BOC signals, the SRSA acquisition probability is better than the BPSK-LIKE, SCPC and ASPeCT methods 2.5 dB-Hz, 1 dB-Hz, and 0.5 dB-Hz. For high-order BOC signals, the ASPeCT method cannot suppress the sub-peaks of the correlation function, and the effect is not satisfactory. There is no comparison here. The SRSA acquisition probability is better than the BPSK-LIKE and SCPC methods 0.5 dB-Hz and 0.25 dB-Hz when the acquisition probability is higher than 0.9.

Peak-to-Average Ratio Analysis
The peak-to-average ratio is also an important indicator for evaluating the performance of an algorithm, and is defined as the ratio of the peak value to the average value of the correlation result obtained by the acquisition. In the preset simulation environment, the BPSK-LIKE, SCPC, ASPeCT and SRSA methods were compared by repeating 3000 experiments, and the peak-to-average ratios of the four methods at different signal-to-noise ratios were obtained, as shown in Figures 15 and 16.  Sensors 2020, 20, x FOR PEER REVIEW 14 of 23

Discriminator Function and Tracking Loop Structure
Using the first and the M-th sub-PRN codes as two local auxiliary codes in the tracking loop. Without considering multipath and interference, the BOC IF signal received by a GNSS receiver from a satellite can be expressed as [15]:

Discriminator Function and Tracking Loop Structure
Using the first and the M-th sub-PRN codes as two local auxiliary codes in the tracking loop. Without considering multipath and interference, the BOC IF signal received by a GNSS receiver from a satellite can be expressed as [15]:

Discriminator Function and Tracking Loop Structure
Using the first and the M-th sub-PRN codes as two local auxiliary codes in the tracking loop. Without considering multipath and interference, the BOC IF signal received by a GNSS receiver from a satellite can be expressed as [15]: Among them, P is the total power of the received signal, D(t) is the navigation data code, S BOC (t) is defined in Equation (6), f IF is the intermediate frequency after down-converting the received signal, ϕ 0 is the initial phase of the carrier. n(t) is Band-limited white noise [16], and it has the zero mean and double-sided power spectrum density N 0 .
After the carrier is cancelled, the I and Q signals perform coherent integration operations with the Early and Late local auxiliary codes, and the following is obtained: In the formula, the subscripts 1 and M indicate the local code number, and the subscripts E and L respectively indicate the Early and Late branches, and other branches are similarly represented. ∆τ and ∆ϕ respectively represent the estimation error of the code phase and the initial phase of the carrier, d is the delay spacing between the early and late correlators. All n are noise terms obeying the Gaussian distribution [16,17].
Combined with the Formulas (26) and (27), The distribution function of the outputs I E1 , I EM , I L1 , The output of Q branch and I branch are independent of each other. The distribution function of the outputs Q E1 , Q EM , Q L1 , Q LM at ∆τ= 0 is N(0, ω). R P1/PM is the cross-correlation function of the auxiliary signal.
According to Equations (17), the formula for the incoherent discriminator function is: Figure 17 shows the discriminator curve for the proposed method at different delay spacings. Compared with Figure 4, the proposed method successfully removes the mis-lock point.
Sensors 2020, 20, x FOR PEER REVIEW 16 of 23 Figure 17 shows the discriminator curve for the proposed method at different delay spacings. Compared with Figure 4, the proposed method successfully removes the mis-lock point.    Figure 18. The proposed code tracking loop.

The Code Tracking Error Analysis
The code tracking error formula is given in [18].
( )  Figure 18 shows the proposed code tracking loop structure. The received intermediate frequency signal is first subjected to carrier cancellation operation. At the same time, the code loop generates two local auxiliary codes and performs Early and Late delays. The received signal is correlated with the local code. Then the local code phase is adjusted by the phase detector and the NCO (Numerically Controlled Oscillator) to complete the unambiguous tracking of the BOC signal.
Sensors 2020, 20, x FOR PEER REVIEW 16 of 23 Figure 17 shows the discriminator curve for the proposed method at different delay spacings. Compared with Figure 4, the proposed method successfully removes the mis-lock point.    Figure 18. The proposed code tracking loop.

The Code Tracking Error Analysis
The code tracking error formula is given in [18].

The Code Tracking Error Analysis
The code tracking error formula is given in [18].
where B L is the code loop filter bandwidth, σ v is the discriminator output standard deviation, and K v is the discriminator gain [19].
In Equation (39), H( f ) is the power spectral density of the front-end filter, and G B/P represents the cross-power spectral density between the BOC signal and the auxiliary signal. For convenience, let when the tracking process is in a steady state, considering that ∆ f ≈ 0, ∆ϕ ≈ 0 and ∆τ ≈ 0, we have  (1)

Performance Simulation and Analysis
Based on the Matlab platform, the intermediate frequency of the input signal is 4.092 MHz, the sampling rate is set to 40.92 MHz, the code phase offset is in the 609th sampling point, the Doppler search range is [−10 kHz, 10 kHz], and the step is 500 Hz. The four methods of SRSA, SCPC, ASPeCT and BPSK-LIKE are compared to the performance.

Phase Discrimination Curve Analysis
The classical EMLP (Early-Minus-Late-Power) phase detector is often used to generate the phase discrimination curve to evaluate the tracking performance of each method [11]. Assuming that the front-end bandwidth is infinite, compare the traditional Delay Lock Loop (DLL), BPSK-like, ASPeCT, and SRSA methods. The results show that for the second-order BOC signal (Figure 19), the phase discrimination curve of the traditional DLL has two mis-locking points, and the other three algorithms can remove the mis-locking point. The stable region is [−0.1 Tc, +0.1 Tc]. However, the slope gain of the phase discrimination curve of the DLL, ASPeCT, and SRSA methods relative to the linear region of the phase discrimination curve of BPSK-like is 5.2 dB. For the 4th-order BOC signal (Figure 20), the phase discrimination curve of the traditional DLL has six mis-locking points. The stability of the other three algorithms is [−0.05 Tc, +0.05 Tc], but the ASPeCT method has four mis-locking points, which cannot remove the tracking ambiguity. The proposed SRSA method can completely remove the mis-locking point, and the slope gain is 7.2 dB compare with BPSK-like, and the slope of the phase discrimination curve can be kept large. The phase discrimination error output is proportional to the slope of the phase discrimination curve at the center zero-crossing point, and the performance such as anti-noise and tracking jitter accuracy is closely related to this.
search range is [−10 kHz, 10 kHz], and the step is 500 Hz. The four methods of SRSA, SCPC, ASPeCT and BPSK-LIKE are compared to the performance.

Phase Discrimination Curve Analysis
The classical EMLP (Early-Minus-Late-Power) phase detector is often used to generate the phase discrimination curve to evaluate the tracking performance of each method [11]. Assuming that the front-end bandwidth is infinite, compare the traditional Delay Lock Loop (DLL), BPSK-like, ASPeCT, and SRSA methods. The results show that for the second-order BOC signal (Figure 19), the phase discrimination curve of the traditional DLL has two mis-locking points, and the other three algorithms can remove the mis-locking point. The stable region is [−0.1 Tc, +0.1 Tc]. However, the slope gain of the phase discrimination curve of the DLL, ASPeCT, and SRSA methods relative to the linear region of the phase discrimination curve of BPSK-like is 5.2 dB. For the 4th-order BOC signal (Figure 20), the phase discrimination curve of the traditional DLL has six mis-locking points. The stability of the other three algorithms is [−0.05 Tc, +0.05 Tc], but the ASPeCT method has four mislocking points, which cannot remove the tracking ambiguity. The proposed SRSA method can completely remove the mis-locking point, and the slope gain is 7.2 dB compare with BPSK-like, and the slope of the phase discrimination curve can be kept large. The phase discrimination error output is proportional to the slope of the phase discrimination curve at the center zero-crossing point, and the performance such as anti-noise and tracking jitter accuracy is closely related to this.

Anti-Multipath Performance Analysis
Multipath Error Envelope (MEE) is a typical indicator for evaluating the multipath performance of tracking loops, reflecting the sensitivity of a code tracking loop to different parameters of multipath signals [20,21]. Figures 21 and 22 show the multipath envelope comparison of BOC(1,1) and BOC(10,5) obtained by the four tracking algorithm when the correlator interval is set to 0.1 Tc and 0.05 Tc. The envelope extreme value (the absolute maximum value of the MEE), the length of the envelope interval length (the sum of the abscissa intervals when the MEE takes a non-zero error), and the envelope area (the area enclosed by the MEE) are three measures of anti-multipath performance [22].

Anti-Multipath Performance Analysis
Multipath Error Envelope (MEE) is a typical indicator for evaluating the multipath performance of tracking loops, reflecting the sensitivity of a code tracking loop to different parameters of multipath signals [20,21]. Figures 21 and 22 show the multipath envelope comparison of BOC(1, 1) and BOC (10,5) obtained by the four tracking algorithm when the correlator interval is set to 0.1 Tc and 0.05 Tc. The envelope extreme value (the absolute maximum value of the MEE), the length of the envelope interval length (the sum of the abscissa intervals when the MEE takes a non-zero error), and the envelope area (the area enclosed by the MEE) are three measures of anti-multipath performance [22]. The smaller the three indicators, the better the anti-multipath performance. It can be seen from the Figures 21  and 22 that the SRSA and ASPeCT methods have better anti-multipath performance under short multipath delay conditions. Still, ASPeCT does not completely remove the sub-peaks and causes errors in a certain multipath delay range. Therefore, the method proposed in this paper has excellent anti-multipath performance.

Anti-Multipath Performance Analysis
Multipath Error Envelope (MEE) is a typical indicator for evaluating the multipath performance of tracking loops, reflecting the sensitivity of a code tracking loop to different parameters of multipath signals [20,21]. Figures 21 and 22 show the multipath envelope comparison of BOC(1,1) and BOC (10,5) obtained by the four tracking algorithm when the correlator interval is set to 0.1 Tc and 0.05 Tc. The envelope extreme value (the absolute maximum value of the MEE), the length of the envelope interval length (the sum of the abscissa intervals when the MEE takes a non-zero error), and the envelope area (the area enclosed by the MEE) are three measures of anti-multipath performance [22]. The smaller the three indicators, the better the anti-multipath performance. It can be seen from the figures 21 and 22 that the SRSA and ASPeCT methods have better anti-multipath performance under short multipath delay conditions. Still, ASPeCT does not completely remove the sub-peaks and causes errors in a certain multipath delay range. Therefore, the method proposed in this paper has excellent anti-multipath performance.

Anti-Noise Performance Analysis
Thermal noise is another important cause of tracking error, and loop code tracking error is an important indicator to measure the anti-noise performance of tracking methods [23]. As shown in Figure 23, under different carrier-to-noise ratios, the single-sideband loop bandwidth is set to 2 Hz B = , the coherent integration time is coh T 1 ms = , and the tracking interval is 0.1 Tc . The standard deviation of the code tracking error is obtained by tracking the BOC(1,1) using several

Anti-Noise Performance Analysis
Thermal noise is another important cause of tracking error, and loop code tracking error is an important indicator to measure the anti-noise performance of tracking methods [23]. As shown in Figure 23, under different carrier-to-noise ratios, the single-sideband loop bandwidth is set to B = 2 Hz, the coherent integration time is T coh = 1 ms, and the tracking interval is 0.1 Tc. The standard deviation of the code tracking error is obtained by tracking the BOC(1,1) using several tracking methods. The code tracking error of ASPeCT and SRSA is improved compared with the traditional EMLP phase discriminator at a low carrier-to-noise ratio, and the BPSK-LIKE method has poor code tracking error. And compared with BPSK-LIKE, the standard deviation of code tracking error is reduced by 0.045 Tc. As shown in Figure 24, under different carrier-to-noise ratios, the single-sideband loop bandwidth is set to B = 2 Hz, the coherent integration time is T coh = 1 ms, and the tracking interval is 0.05 Tc. The code tracking error standard deviation is obtained by tracking the BOC(10,5) by several tracking methods. Because ASPeCT is only applicable to 2nd-order BOC signals, only BPSK-LIKE, EMLP, and SRSA are analyzed here. The performance of the SRSA method is close to that obtained by EMLP, compared with BPSK-LIKE, the standard deviation of code tracking error is reduced by 0.03 Tc. The BPSK-LIKE method is still poor.

Anti-Noise Performance Analysis
Thermal noise is another important cause of tracking error, and loop code tracking error is an important indicator to measure the anti-noise performance of tracking methods [23]. As shown in Figure 23, under different carrier-to-noise ratios, the single-sideband loop bandwidth is set to 2 Hz B = , the coherent integration time is coh T 1 ms = , and the tracking interval is 0.1 Tc . The standard deviation of the code tracking error is obtained by tracking the BOC(1,1) using several tracking methods. The code tracking error of ASPeCT and SRSA is improved compared with the traditional EMLP phase discriminator at a low carrier-to-noise ratio, and the BPSK-LIKE method has poor code tracking error. And compared with BPSK-LIKE, the standard deviation of code tracking error is reduced by 0.045 Tc . As shown in Figure 24, under different carrier-to-noise ratios, the single-sideband loop bandwidth is set to B=2 Hz , the coherent integration time is coh T =1 ms , and the tracking interval is 0.05 Tc . The code tracking error standard deviation is obtained by tracking the BOC(10,5) by several tracking methods. Because ASPeCT is only applicable to 2nd-order BOC signals, only BPSK-LIKE, EMLP, and SRSA are analyzed here. The performance of the SRSA method is close to that obtained by EMLP, compared with BPSK-LIKE, the standard deviation of code tracking error is reduced by 0.03 Tc . The BPSK-LIKE method is still poor.

Conclusions
Aiming at the ambiguity of BOC signal acquisition/tracking, many methods have been proposed . Sub-function reconstruction synchronization algorithm is proposed in this paper. By designing

Conclusions
Aiming at the ambiguity of BOC signal acquisition/tracking, many methods have been proposed . Sub-function reconstruction synchronization algorithm is proposed in this paper. By designing two auxiliary codes and performing cross-correlation operation with BOC signal, and then obtaining a single peak correlation function by Formula (17), we achieved the purpose of eliminating ambiguity. In the acquisition stage, the acquisition probability, computational complexity, and peak-to-average ratio were evaluated. Compared with ASPeCT, BPSK-LIKE, and SCPC, the SRSA method has excellent performance in the acquisition process. The SRSA method preserves the narrow correlation of the BOC signal correlation function and also removes the interference of the sub-peak. In the tracking stage, the tracking loop uses incoherent discriminator function (36) to eliminate ambiguity. The SRSA method removes the mis-locking point. In terms of anti-multipath performance, the SRSA method has the smallest envelope interval length and envelope area compared to ASPeCT and BPSK-LIKE. In terms of anti-noise performance, the SRSA method has almost the same code tracking error as the ASPeCT method and is superior to the BPSK-LIKE method. In summary, the proposed method can completely remove the threat of ambiguity while achieving significant performance advantages in terms of acquisition and tracking.
The main contributions of this paper are as follows: (1) A sub-function reconstruction synchronization algorithm is proposed. Design auxiliary code and perform cross-correlation operation with BOC signal to obtain cross-correlation functions, as shown in Figure 7 or Figure 8. The first sub-function is at the same position as the main peak of the last sub-function and the sub-peak corresponds to 0 point. Based on this characteristic, combining Equation (17), we can obtain a new function with a single peak. (2) The proposed method can be applied to BOC signals of arbitrary modulation order.
(3) Reduced computational complexity and resource consumption.