## PART2 » History » Version 27

*JANVIER, Thibault, 03/22/2016 04:42 PM *

1 | 1 | COLIN, Tony | h1. PART 3 : Acquisition and Tracking. |
---|---|---|---|

2 | 1 | COLIN, Tony | |

3 | 18 | JANVIER, Thibault | {{toc}} |

4 | 1 | COLIN, Tony | |

5 | 18 | JANVIER, Thibault | --- |

6 | 18 | JANVIER, Thibault | |

7 | 2 | COLIN, Tony | h2. 1- Introduction. |

8 | 3 | COLIN, Tony | |

9 | 1 | COLIN, Tony | h3. a- General overview of a GPS receiver using CDMA technique. |

10 | 1 | COLIN, Tony | |

11 | 20 | JANVIER, Thibault | The GPS signal generation scheme has been detailed in [[PART|PART 2]] and is using a CDMA technique which spreading sequences are the PRN codes. Thereby, the major steps of the whole communication chain can be summarized by the figure below. |

12 | 17 | JANVIER, Thibault | |

13 | 19 | JANVIER, Thibault | p=. !CDMA_Overview.png! |

14 | 20 | JANVIER, Thibault | *Figure 3.1* : GPS Communication Chain Overview. |

15 | 5 | COLIN, Tony | |

16 | 20 | JANVIER, Thibault | Now that the transmitting side has been detailed in [[PART|PART 2]], it is possible to focus on the receiving side. |

17 | 20 | JANVIER, Thibault | The receiving front-end filters, down converts to an intermediate frequency and digitizes the received signal. Thus, the signal still has to be down converted to baseband and to have its spreading sequence removed before being able to demodulate and recover the actual navigation data. The down-conversion to baseband is done by multiplying the signal at the output of the receiving front-end by a local carrier frequency which frequency matches the one of the received carrier. Therefore, the baseband signal x can be expressed as follows: |

18 | 1 | COLIN, Tony | |

19 | 5 | COLIN, Tony | p=. !2.png! |

20 | 20 | JANVIER, Thibault | *Figure 3.2* : Expression of the signal after downconversion to baseband . |

21 | 5 | COLIN, Tony | |

22 | 3 | COLIN, Tony | Where: |

23 | 6 | COLIN, Tony | *A* is the amplitude of the signal |

24 | 6 | COLIN, Tony | *τ_j* = jT is the sampling time |

25 | 6 | COLIN, Tony | *T* is the sampling period |

26 | 20 | JANVIER, Thibault | *td(τ_j)* is the time difference between the start time of the navigation sequence and τ_j . In other words, τ_j - td(τ_j) represents the actual phase of the incoming navigation data at time τ_j. |

27 | 20 | JANVIER, Thibault | *ts(τ_j)* is the time difference between the start time of the spreading sequence and τ_j. In other words, τ_j – ts(τ_j) represents the actual phase of the incoming PRN sequence. |

28 | 7 | COLIN, Tony | *θ* is the phase shift due to non-coherent down-conversion to baseband (Doppler shift) |

29 | 6 | COLIN, Tony | *n* is a white Gaussian noise |

30 | 25 | JANVIER, Thibault | !D_tau_C_tau_expression.png! |

31 | 6 | COLIN, Tony | *T_d* is the symbol period |

32 | 1 | COLIN, Tony | *T_c* is the chip period |

33 | 1 | COLIN, Tony | *d_k* is a navigation symbol taking its values in ±1 |

34 | 1 | COLIN, Tony | *c_k* is a chip symbol taking its values in ±1 |

35 | 1 | COLIN, Tony | *π_Td* is the standard pulse function of width Td |

36 | 6 | COLIN, Tony | *π_Tc* is the standard pulse function of width Tc |

37 | 1 | COLIN, Tony | *N_c* is the number of chips in one spreading code |

38 | 1 | COLIN, Tony | |

39 | 20 | JANVIER, Thibault | Then, by generating a local spreading sequence that is similar to the received one and which phase matches the received one, the spreading code is removed from the signal and it is possible to retrieve the useful data. |

40 | 20 | JANVIER, Thibault | The principle seems simple to understand, however, it highlights some practical issues that are depicted in the next subsection. |

41 | 20 | JANVIER, Thibault | |

42 | 20 | JANVIER, Thibault | |

43 | 3 | COLIN, Tony | h3. b- List of the key parameters in the implementation of a GPS receiver. |

44 | 3 | COLIN, Tony | |

45 | 20 | JANVIER, Thibault | To decode navigation data, one first needs to remove the incoming carrier from the signal. To do so, the carrier frequency has to be known to generate a local carrier signal and down-convert the incoming signal to baseband. Nonetheless, this carrier frequency might deviate from the expected value. Indeed, the relative motion of the satellite with respect to the receiver induces a Doppler effect that shifts the frequency of the incoming carrier. If the GPS receiver is moving, it is reasonable to assume that the maximum Doppler shift for the L1 frequency is around ± 10 kHz. Otherwise, for a stationary GPS receiver, the maximum Doppler shift for the L1 frequency is around ± 5 kHz. Once the carrier frequency is known, its phase has to be determined as well in order to have a coherent demodulation that limits the bit error rate. These uncertainties regarding the carrier frequency and its phase will have to be dealt with in the implementation of the GPS receiver. |

46 | 3 | COLIN, Tony | |

47 | 20 | JANVIER, Thibault | Another key parameter is related to the PRN sequences that are used to spread the information. First of all, the satellites are differentiated by 32 different PRN sequences. Consequently, the GPS receiver has to search for the right PRN code among all the PRN sequences to remove it from the signal and decode the data. Still, knowing the right PRN code to despread the signal at the receiving side is not sufficient. Indeed, PRN codes have high correlation only for zero lag. As such, it is of prime concern to know the incoming code phase in order to generate a local PRN code that is perfectly aligned with the incoming one. In addition, the Doppler shift induces a jitter regarding the actual duration of a PRN code. Thus, the local PRN code will have to be generated taking into consideration the phase and the jitter. The software-defined GPS receiver will have to address and overcome these issues. |

48 | 3 | COLIN, Tony | |

49 | 20 | JANVIER, Thibault | The practical issues that have just been highlighted can be overcome using two major processes known as acquisition and tracking (see Figure 3.4). These processes will be carefully depicted in the following sections. |

50 | 5 | COLIN, Tony | |

51 | 20 | JANVIER, Thibault | |

52 | 1 | COLIN, Tony | p=. !4.png! |

53 | 20 | JANVIER, Thibault | *Figure 3.4* : Block Diagram of a GPS receiver. |

54 | 3 | COLIN, Tony | |

55 | 1 | COLIN, Tony | --- |

56 | 1 | COLIN, Tony | |

57 | 1 | COLIN, Tony | h2. 2- Acquisition. |

58 | 3 | COLIN, Tony | |

59 | 20 | JANVIER, Thibault | In order to receive and efficiently decode navigation data, the receiver must know which satellites are initially visible. This can be achieved using two common methods referred to as warm start and cold start. In a warm start, the receiver uses the information it has stored from the previous results and is able to compute which satellites are visible. In a cold start, the receiver has no stored information and has to search for the visible satellites. This process is called acquisition and aims at determining the visible satellites as well as the coarse values of the carrier frequency and the code phase of the satellite signals. Acquisition is quite time-consuming as it has to search through all possible satellites (all PRN sequences), all possible carrier frequencies taking into account the Doppler shift and all possible code phases of a given PRN sequence. As a result, a 2-dimensional search in frequency (Doppler shift) and time (code phase) is carried out for each PRN sequence. This process can be performed using a serial search acquisition, a parallel frequency space search acquisition or a parallel code phase search acquisition. These three commons methods have different characteristics regarding the execution time, their complexities and their accuracies. They will be briefly depicted in the three following subsections. |

60 | 1 | COLIN, Tony | |

61 | 3 | COLIN, Tony | h3. a- Serial Search Acquisition. |

62 | 1 | COLIN, Tony | |

63 | 1 | COLIN, Tony | p=. !5.png! |

64 | 22 | JANVIER, Thibault | *Figure 3.5* : Block Diagram - Serial Search Acquisition. |

65 | 3 | COLIN, Tony | |

66 | 20 | JANVIER, Thibault | The serial search acquisition procedure is based on the C/A code correlation properties (see [[PART|PART 2]]) according to which the cross correlation between two different C/A codes is really low and the autocorrelation is high only for zero lag. The algorithm is described just below. |

67 | 20 | JANVIER, Thibault | The incoming signal is multiplied by a given C/A code with a certain code phase between 0 and 1022 chips. Then, the signal is mixed with a locally generated carrier signal to remove the carrier wave of the received signal. This generates an in-phase signal I and a quadrature signal Q. As the C/A code is modulated onto the I signal, one should only take into consideration the I signal. Nevertheless, the down-conversion is non-coherent. This means that the locally generated carrier wave used to down-convert the incoming signal is not in phase with the incoming carrier wave. As a consequence, the signal of interest is divided on both I and Q signals after down-conversion. Thus, it is necessary that one should use both of the I and Q signals. These I and Q signals are integrated over 1 ms which corresponds to the length of one C/A code. By doing so, one is correlating the incoming PRN sequence with the locally generated C/A code on both I and Q signals. The outputs of both I and Q signals are finally squared and added. The final result is compared to a threshold. If the threshold is exceeded, the frequency and code phase parameters used for the locally generated signals are correct for the PRN sequence that is considered. If the threshold is not exceeded, this could be due to several reasons that are listed just below: |

68 | 3 | COLIN, Tony | - The locally generated PRN sequence is not the same as the one that is received, which means that the receiver is not configured to receive signals from the actually targeted satellite. |

69 | 3 | COLIN, Tony | - The locally generated PRN sequence is the right one but its code phase does not match the incoming PRN sequence. |

70 | 3 | COLIN, Tony | - The locally generated carrier wave does not have the same frequency as the incoming carrier wave because of the Doppler shift. |

71 | 3 | COLIN, Tony | The GPS receiver cannot know the cause that leads to low correlation. It will therefore proceed using a two-dimensional search in frequency and time for each PRN sequence in order to find the right frequency and the right code phase for the PRN sequence that is considered. Considering that the Doppler shift is around ± 10 kHz, it is reasonable to take a frequency step of 500 Hz resulting in 41 frequencies around the theoretical L1 frequency. For each frequency, 1023 different code phases are tried for the PRN sequence that is considered (recall that one C/A code contains 1023 chips). The output is computed for all the pairs “frequency/code phase” and can be plotted on a 3D graph as shown on *figures XX and XX*. Then, the maximum value from all the possibilities is computed. If this maximum does not exceed the threshold, the PRN sequence for which the search has been done corresponds to a satellite that is not visible to the receiver and the search has to be carried out for another PRN sequence. If the maximum exceeds the threshold, the satellite is acquired with coarse values of its carrier frequency and code phase. |

72 | 1 | COLIN, Tony | |

73 | 1 | COLIN, Tony | h3. b- Parallel frequency space search acquisition. |

74 | 3 | COLIN, Tony | |

75 | 22 | JANVIER, Thibault | The serial search acquisition implies to test every combination of frequencies and code phases of a given PRN sequence before being able to tell if the acquisition is successful or not. This process is really time-consuming. If the search procedure of one of the two parameters could be implemented in parallel, this would drastically decrease the acquisition time. The parallel frequency space search acquisition aims at automatically giving a coarse value of the frequency carrier of the incoming signal once the right code phase has been found. It is implemented as follows: |

76 | 1 | COLIN, Tony | |

77 | 26 | JANVIER, Thibault | p=. !Parallelized_frequency_search.png! |

78 | 22 | JANVIER, Thibault | *Figure 3.6* : Block diagram - Parallel frequency space search acquisition. |

79 | 3 | COLIN, Tony | |

80 | 22 | JANVIER, Thibault | The incoming signal is multiplied by a given PRN sequence which code phase varies between 0 and 1022 chips. A Fourier transform is then used to assess the previous result in the frequency domain. The Fourier transform gives a complex signal and the output is obtained by taking the squared magnitude of this signal. When the locally generated PRN sequence corresponds to the satellite that is targeted and when the phase of this locally generated PRN sequence perfectly matches the one of the PRN sequence from the incoming signal, the output of the multiplication is illustrated as follows: |

81 | 3 | COLIN, Tony | |

82 | 5 | COLIN, Tony | p=. !7.png! |

83 | 22 | JANVIER, Thibault | *Figure 3.7* : Principle of Parallel frequency space search acquisition. |

84 | 1 | COLIN, Tony | |

85 | 1 | COLIN, Tony | As such, the result corresponds to the carrier wave of the incoming signal. Consequently, the final output corresponds to the squared magnitude of the Fourier transform of a sine wave. In a nutshell, with a perfectly aligned PRN code of a visible satellite, the output displays a distinct peak in magnitude that corresponds to the real carrier frequency of the targeted satellite. This peak can be found using a threshold. When this threshold is exceeded, the satellite is acquired with coarse values of its carrier frequency and code phase. *(insert image p 82 of the book)* |

86 | 1 | COLIN, Tony | |

87 | 1 | COLIN, Tony | h3. c- Parallel code phase search acquisition. |

88 | 22 | JANVIER, Thibault | |

89 | 22 | JANVIER, Thibault | The parallel frequency search acquisition implies to test every code phase among the 1023 possible options but eliminates the need to search through the 41 frequencies around the intermediate frequency of the received signal. The parallel code phase search acquisition allows parallelizing the code phase search. Thereby, the searching process only has to go through the 41 frequencies which drastically decreases the execution time. |

90 | 22 | JANVIER, Thibault | The parallel code phase search acquisition takes advantage of the circular cross-correlation theorem that claims that the circular cross-correlation sequence between two finite sequences of length N and with periodic repetition can be obtained as the inverse transform of the product of the individual transforms: |

91 | 22 | JANVIER, Thibault | |

92 | 22 | JANVIER, Thibault | Let z be the circular cross-correlation sequence between x and y that are two finite sequences of length N periodically repeated. |

93 | 22 | JANVIER, Thibault | |

94 | 24 | JANVIER, Thibault | p=. !Cross_Correlation.png! |

95 | 22 | JANVIER, Thibault | |

96 | 27 | JANVIER, Thibault | Let Z(k), X(k) and Y(k) respectively be the discrete N-point Fourier transforms of z(n), x(n) and y(n). |

97 | 27 | JANVIER, Thibault | |

98 | 23 | JANVIER, Thibault | p=. Z(k) = X*(k)Y(k) where X*(k) is the conjugate of X(k) |

99 | 23 | JANVIER, Thibault | |

100 | 1 | COLIN, Tony | Then: |

101 | 27 | JANVIER, Thibault | |

102 | 22 | JANVIER, Thibault | p=. z(n) = invFFT(Z(k)) |

103 | 22 | JANVIER, Thibault | |

104 | 22 | JANVIER, Thibault | Such a property allows computing the cross-correlation of the incoming PRN sequence with a locally generated PRN sequence without the necessity of shifting its code phase. Consequently, only one PRN sequence has to be generated. |

105 | 22 | JANVIER, Thibault | |

106 | 22 | JANVIER, Thibault | The block diagram of the parallel code phase search acquisition can be illustrated by the following figure: |

107 | 22 | JANVIER, Thibault | |

108 | 3 | COLIN, Tony | |

109 | 3 | COLIN, Tony | --- |

110 | 3 | COLIN, Tony | |

111 | 3 | COLIN, Tony | h2. 3- Tracking. |

112 | 3 | COLIN, Tony | |

113 | 3 | COLIN, Tony | h3. a- |

114 | 10 | COLIN, Tony | |

115 | 15 | COLIN, Tony | p=. !002.png! |

116 | 15 | COLIN, Tony | *Figure 3.8* : from [2]. |

117 | 1 | COLIN, Tony | |

118 | 15 | COLIN, Tony | p=. !001.jpg! |

119 | 15 | COLIN, Tony | |

120 | 11 | COLIN, Tony | --- |

121 | 11 | COLIN, Tony | |

122 | 10 | COLIN, Tony | *References :* |

123 | 1 | COLIN, Tony | *[1]* K. Borre, D. M. Akos, N. Bertelsen, P. Rinder, S. H. Jensen, A software-defined GPS and GALILEO receiver |

124 | 16 | COLIN, Tony | *[2]* D. Kubrak, GNSS Signal Tracking Workshop, March 2016 |