# A New Multipath Mitigation Method for GNSS Receivers Based on an Antenna Array

Authors: Sébastien Rougerie; Guillaume Carrié; François Vincent; Lionel Ries; Michel Monnerat
Journal: International Journal of Navigation and Observation
 (2012)

---

## Abstract

The well-known Space-Alternating Generalized Expectation Maximisation (SAGE) algorithm has been recently considered for multipath mitigation in Global Navigation Satellite System (GNSS) receivers. However, the implementation of SAGE in a GNSS receiver is a challenging issue due to the numerous number or parameters to be estimated and the important size of the data to be processed. A new implementation of the SAGE algorithm is proposed in this paper in order to reach the same efficiency with a reduced complexity. This paper focuses on the trade-off between complexity and performance thanks to the Cramer Rao bound derivation. Moreover, this paper shows how the proposed algorithm can be integrated with a classical GNSS tracking loop. This solution is thus a very promising approach for multipath mitigation.


---

## Body

## 1. Introduction

In Global Navigation Satellite System (GNSS) applications, multipath (MP) errors are still one of the major error sources for conventional receivers. The additional signal replicas due to reflections on the local environment introduce a bias in the delay lock loops (DLLs), which finally leads to a positioning error [1, 2]. Several techniques have been developed for multipath mitigation. One of the most popular approaches is the Narrow Correlator Spacing [3], which reduces the chip spacing between the early and late correlators in order to mitigate the impact of multipath. However, this technique suffers from high sensitivity to noise and cannot perform with short delay multipath (<0.1 chip). Based on the Maximum Likelihood (ML) estimation, the Multipath Estimating Delay-Lock-Loop (MEDLL) [4] algorithm has also been proposed to estimate the delay and the power of all the paths by studying the shape of the cross-correlation function. This approach shows better performances than the Narrow Correlator Spacing technique, but short delay multipath mitigation is still an issue [4]. More recently, Bayesian approaches have been proposed [5–7]. Indeed, most of the time, prior information could be used in order to improve the delays estimations. However in practice, it is difficult to get correct prior information. Measurement campaigns can be used to build a first-order Markov process for a sequential estimation, but the performance will consequently be strongly dependent on the measured environment (design of the city…).Last, the use of array antenna algorithms has been proposed for multipath mitigation [8, 9]. Array antennae enable a spatial sampling that makes it possible to distinguish different sources in the spatial domain. Therefore, mitigation techniques based on such an array are independent of the relative delays of the MP. Consequently, the rejection of any kind of MP seems possible (and especially short-time delay MP). In conventional mobile receivers, the room available to incorporate an array antenna is reduced. Only a small number of elements can be integrated. This study will focus on a square 2×2 elements antenna. The choice of the shape of the array antenna is out of the scope of this paper, and we will only focus on the array processing.Using appropriate weights on each channel, beamforming technics perform a spatial filtering in order to concentrate the energy beam towards the signal of interest, while trying to minimise the gain towards the interferences. However, in the MP mitigation context, these classical approaches present limited performances for the following reasons [10].(i)
Near angle signals are difficult to separate because of the low antenna resolution [10, 11].(ii)
Line-of-sight signal (LOSS) and multipaths are strongly correlated, which implies a severe degradation of adaptive beamforming algorithms.(iii)
Adaptive algorithms should operate after the correlation step in order to work with positive SNR signals. That implies that only a small number of samples are available to estimate the array covariance matrix. Bad covariance matrix estimation can lead to inversion or eigenvalues decomposition instabilities.To overcome these problems, several solutions have been proposed. In [12, 13], for example, the authors propose to use additional Choke ring techniques, GPS microstrip array antenna, and/or angle constraint for negative elevation in order to reject ground multipaths. However, for a generic application, we cannot assume any specific MP DOA.In order to improve the MP mitigation, another approach proposes to include the different DOA paths parameters in the estimation procedure [10, 14–18]. In other words, we estimate a set of parameters (amplitudes, times/delays, Doppler shifts, elevations, and azimuths) for all the incoming sources. The main difference with the beamforming approach is that, instead of filtering the sources in the spatial domain only, the different incoming paths are jointly identified in the space, time, and frequency domains. In order to estimate the parameters of all impinging signals, the Space Alternating Generalized Expectation Maximisation (SAGE) algorithm [16], which is a low-complexity generalization of the Maximum Likelihood (ML) algorithm, has been considered. The SAGE algorithm is usually used in communication systems [16], but the potential of SAGE in a navigation context has also been proven [17, 18]. Nevertheless, the computational cost increases due to the number of unknown parameters. Moreover, the memory size is also a challenging issue. Thus, the SAGE algorithm can hardly be directly implemented in real time for GNSS receivers. Last, the SAGE algorithm provides an estimation of the time delay and phase of the LOSS, as do the DLL and PLL (Phase Lock Loop). Thus, the use of SAGE implies to switch off the DLL/PLL, and, consequently, we lose the “smoothing effect” of the tracking loops.In order to reach the efficiency of the SAGE algorithm with a reduced complexity, and to keep the compatibility with conventional GNSS tracking loops (DLL/PLL), we proposed a new implementation of SAGE in [10]. The main idea is to apply the SAGE algorithm after the local correlation step. Indeed, the cross-correlation between the received signal and the local code can be seen as a compression step of the baseband signal. Thus, by reducing the size of the input signal, the complexity of the algorithm will reduce in the same proportion. By applying the ML estimation on the postcorrelated signal, we estimate the relative delay and Doppler of the paths. These estimations are then used to drive the GNSS tracking loops. We named this new algorithm the SAGE/STAP multicorrelator algorithm.Comparisons based on Monte Carlo simulations between the SAGE/STAP algorithm, the SAGE algorithm, and beamformers have been done in [10]. This paper focuses on the Cramer Rao Bound (CRB) derivation in order to present the theoretical trade-off between the complexity reduction and the estimation accuracy of the SAGE/STAP algorithm. Moreover, this paper presents an implementation of the proposed algorithm hybridized with the GNSS tracking loopsThis paper is organized as follows. The signal model and the main assumptions are outlined in Section2. A review of the SAGE algorithm, the SAGE/STAP multicorrelator algorithm, and its implementation in a GNSS receiver is given in Section 3. The simulation results in Section 4 show the trade-off between the complexity and the accuracy of the SAGE/STAP multicorrelator algorithm and present the performances of the proposed algorithm in realistic scenarios. Finally, in Section 5 we present our conclusions.


## 2. Signal Model

Let us assume that we receiveL narrowband planar wave fronts of wavelength λ on an array of M isotropic sensors. The M-sized vectorized received signal, z(t), can be written as(1)z(t)=∑l=0L-1sl(t,ψl)+n(t),
where sl(t,ψl) is given by(2)sl(t,ψl)=γla(θl,φl)exp⁡(2jπνlt)c(t-τl),
and n(t)~N(0,σn2IM) is an additional complex white Gaussian noise. Let us note that L the number of incoming paths (LOSS included) and ψl=[γl,θl,φl,τl,νl]T are, respectively, the complex amplitude, elevation, azimuth, time delay, and Doppler shift of the lth path. Note that the index l=0 corresponds to the LOSS. Here, c denotes the pseudorandom-noise (PRN) sequence that consists of a Gold code with a code period T=1 ms, 1023 chips per period, and a rectangular chip shape. a(θ,φ) represents the steering vector of a 2×2 square array antenna. The channel parameters are assumed constant during the observation time.Collecting the samples of the complex baseband signal leads to aM×Nsnap, matrix, where Nsnap denotes the number of SnapShots. Typically in GNSS, Nsnap is larger than 2000, and, thus, a direct processing of the baseband signal is hardly implemented in real time. In order to compress the signal, we propose to use the scheme presented in the Figure 1. The aim of the array antenna is to sample the wave fronts and to get access to the spatial domain. The banc of correlators is used to compress the signal and to get access to the relative delays of the sources, and finally the postcorrelation time taps enable to get access to the frequency domain. We can see that the first and last parts of this architecture are equivalent to a STAP (space time adaptive process) array applied to the postcorrelated signal. Thus, we call this architecture the STAP multicorrelator array. This array is then defined by 4 parameters: the number M of antennas, the number N of postcorrelation taps, the number P of correlators, and the time spacing Cs between each correlator. Note that the sampling time of the postcorrelated signal is equal to Tint. Therefore, we have the following relation between the number of SnapShots and the number of postcorrelated Taps: Nsnap=NTintfs, where fs denotes the sampling frequency of the baseband signal. The nth output of one correlator delayed by a time spacing of pCs is given by(3)rC,l(τrl,νrl,p,n)=1Tint⁡∫(n-1)Tint⁡nTint⁡c(t-τl)c(t-τ̂-pCs)×exp⁡[-2jπ(νl-ν̂)t]dt,
with n∈[1,N], if P is even p∈[-P/2,P/2] and if P is odd p∈[-(P-1)/2,(P-1)/2]. We introduce the relative delay of the DLL estimation τ̂ and the relative Doppler of the FLL (Frequency Lock Loop) estimation ν̂ with respect to the lth path parameters: τrl=τ̂-τl,νrl=ν̂-νl. We can then approximate the integral as(4)rC,l(τrl,νrl,p,n)=r(τrl+pCs)sinc[πνrlTint⁡]exp⁡[2jπ(νrl2n-12Tint⁡)],
with r(·) the autocorrelation function of the PRN code and sinc[x]=sin[x]/x. The amplitude and phase components are independent of p and n; they can be inserted in the modified complex amplitude γ̃l of the incoming path:(5)γ̃l=γlsinc[πνrlTint⁡]exp⁡[-jπνrlTint⁡].
Then,(6)rC,l(τrl,νrl,p,n)=γ̃lγlr̃C(τrl,νrl,p,n),
with(7)r̃C(τrl,νrl,p,n)=r(τrl+pCs)exp⁡(2jπνrlnTint⁡).Figure 1
Principle of the STAP multicorrelator.The outputs of theP correlators are rearranged in a column vector. The N cross-correlation functions obtained are then concatenated in order to get the temporal evolution of the postcorrelation signal:(8)r̃C(τrl,νrl)=[r̃C(τrl,νrl,-(P-1)2,1)⋮r̃C(τrl,νrl,(P-1)2,1)r̃C(τrl,νrl,-(P-1)2,2)⋮r̃C(τrl,νrl,(P-1)2,2)⋮r̃C(τrl,νrl,(P-1)2,N)]NP×1.Finally, the output signal of the STAP multicorrelator array can be collected in amNP column vector:(9)x=∑l=0L-1xl(Ψl)+npc,
where npc is the output noise and xl(Ψl) is given by(10)xl(Ψl)=γ̃la(θl,φl)⊗r̃C(τrl,νrl),where⊗ denotes the Kronecker product, and the parameters are now Ψl=[γ̃l,θl,φl,τrl,νrl]T, where τrl,νrl denote the relative delay and Doppler of the path l.


## 3. SAGE Algorithm

### 3.1. Concept of SAGE

The problem associated with the signal model (2) consists in estimating the parameters ψl=[γl,θl,φl,τl,νl]T,l=0,1,…,L-1 for all the paths. The estimation of L is not discussed in this paper. Usually, L is fixed to a value large enough to capture all the dominant impinging waves. Classical information theory methods for model size selection like Akaike’s and Rissanen’s [19] criteria can be used. The ML estimation is given by ψ̂=argmaxψp(Z∣ψ), where Z is the sampled complex baseband signal and p(Z∣ψ) is the likelihood function. The direct maximization of the likelihood function is a computationally prohibitive task since there is no analytical solution. Moreover, p(Z∣ψ) is generally not a concave function of ψ, and L is usually high. To perform this optimization, we use the iterative process of the SAGE algorithm [16]. The basic concept of the SAGE algorithm is to us a hidden data space. Instead of estimating the parameters of all impinging waves in one search, the SAGE algorithm sequentially estimates the parameters of each signal. The SAGE algorithm breaks down the multidimensional optimization problem into several smaller problems. In spite of this complexity reduction, SAGE is still hardly implemented in real time due to the size of the baseband signal.


### 3.2. The SAGE/STAP Multicorrelator Algorithm

The main idea to take advantages of SAGE with more reasonable hardware requirements is to process the data at the output of the STAP multicorrelator array. Using the signal model (10), the likelihood function is then(11)p(x∣Ψ)=1πNPMdet⁡Qpcexp⁡(-[x-xsi(Ψ)]HQpc-1[x-xsi(Ψ)]),
where xsi(Ψ)=∑l=0L-1xl(Ψl) contains the superimposition of the post-correlation signals. Qpc denotes the covariance matrix of the postcorrelation noise. The noise is no longer white after the correlation step, and it is shown in [20] that the postcorrelation noise covariance matrix is given by(12)Qpc=E(npcnpcH)=σ̃n2(IMN⊗QP),
where σ̃n2 denotes the noise power after the correlation step, and QP is define thanks to the auto-correlation function of the PRN code r(·):(13)QP=[r(0)r(Cs)⋯⋯r(P⋅Cs)r(Cs)r(0)r(Cs)⋮⋮r(Cs)r(0)r(Cs)⋮⋮r(Cs)r(0)r(Cs)r(P⋅Cs)⋯⋯r(Cs)r(0)]P×P.The first step of the SAGE algorithm, so-called expectation step (E-STEP), consists in estimating the hidden data space with(14)x̂l=x-∑l′=0l′≠lL-1xl′(Ψl′).The second step, so-called maximization step (M-STEP), carries out the maximization of the log-likelihood function which is associated with the estimated hidden data space. In the case of the STAP multicorrelator signal, the log-likelihood function is(15)Λ(Ψl)=ln⁡p(x̂l∣Ψl)=-ln⁡πNPM-ln⁡det⁡Qpc-(xl(Ψl)-x̂l)HQpc-1(xl(Ψl)-x̂l).The maximization of Λ with respect toΨl can be concentrated, as the dependence to γ̃l is linear:(16)γ̃l=[a(θ̂l,φ̂l)⊗r̆C(τ̂rl,ν̂rl)]Hx̂lMr̆CH(τ̂rl,ν̂rl)r̃C(τ̂rl,ν̂rl),
where r̆CH(τrl,νrl) is given by(17)r̆CH(τrl,νrl)=r̃CH(τrl,νrl)[IN⊗QP-1].Finally, the reduced likelihood function to maximize is(18)Λ̃(Ψl)=|[aH(θl,φl)⊗r̆CH(τrl,νrl)]x̂l|2Mr̆CH(τrl,νrl)r̃C(τrl,νrl).In order to better understand the expression (18), let us assume no noise is present, and we can develop (10) as(19)xl=γ̃la(θl,φl)⊗r̃C(τrl,νrl)=γ̃la(θl,φl)⊗e(νrl)⊗r(τrl),
where(20)e(νrl)=[exp⁡(j2πνrlTint⁡)⋯exp⁡(j2πνrlNTint⁡)]N×1T,(21)r(τrl)=[r(τrl-(P-1)2Cs)⋯r(τrl+(P-1)2Cs)]P×1T.Then, inserting (19), (20), and (21) in (18), we can express the reduced likelihood function as(22)Λ̃(θ,φ,τr,νr)=|γ̃l|2|aH(θ,φ)a(θl,φl)|2M︸spaceFT|eH(νr)e(νrl)|2N︸frequencyFT×|rH(τr)QP-1r(τrl)|2rH(τr)QP-1r(τr).As we can see, the first two terms are similar to space and frequency Fourier transforms. Thus, the two parametersM and N will mainly influence the accuracy of the DOA and the Doppler estimations for both algorithms (SAGE and SAGE/STAP). However, the couple {P,Cs} influences only the performances of the SAGE/STAP algorithm with respect to the paths delay estimation. This point will be detailed in more detail in Section 4.


### 3.3. Implementation in a GNSS Receiver

To implement the SAGE/STAP algorithm in a GNSS receiver, we propose the architecture illustrated in Figure2.Figure 2
Proposed receiver architecture.The first front end bloc contains the RF filters, the downconversion step, the ADC and a calibration stage [21]. A calibration stage aims to compensate the technological defects such as the RF dispersion of the filters and antenna defects.The baseband signalZ is the output of this blocx. We must therefore use the STAP multicorrelator array for each tracked PRN code in order to compress the data. Afterward, we use the SAGE algorithm in the processing bloc. Finally, the SAGE estimation of the relative delay and Doppler τr0,νr0 is used to drive the DLL and PLL/FLL. Thus, the key idea of our solution is to substitute the conventional DLL and PLL/FLL discriminators by the SAGE/STAP estimation.


## 3.1. Concept of SAGE

The problem associated with the signal model (2) consists in estimating the parameters ψl=[γl,θl,φl,τl,νl]T,l=0,1,…,L-1 for all the paths. The estimation of L is not discussed in this paper. Usually, L is fixed to a value large enough to capture all the dominant impinging waves. Classical information theory methods for model size selection like Akaike’s and Rissanen’s [19] criteria can be used. The ML estimation is given by ψ̂=argmaxψp(Z∣ψ), where Z is the sampled complex baseband signal and p(Z∣ψ) is the likelihood function. The direct maximization of the likelihood function is a computationally prohibitive task since there is no analytical solution. Moreover, p(Z∣ψ) is generally not a concave function of ψ, and L is usually high. To perform this optimization, we use the iterative process of the SAGE algorithm [16]. The basic concept of the SAGE algorithm is to us a hidden data space. Instead of estimating the parameters of all impinging waves in one search, the SAGE algorithm sequentially estimates the parameters of each signal. The SAGE algorithm breaks down the multidimensional optimization problem into several smaller problems. In spite of this complexity reduction, SAGE is still hardly implemented in real time due to the size of the baseband signal.


## 3.2. The SAGE/STAP Multicorrelator Algorithm

The main idea to take advantages of SAGE with more reasonable hardware requirements is to process the data at the output of the STAP multicorrelator array. Using the signal model (10), the likelihood function is then(11)p(x∣Ψ)=1πNPMdet⁡Qpcexp⁡(-[x-xsi(Ψ)]HQpc-1[x-xsi(Ψ)]),
where xsi(Ψ)=∑l=0L-1xl(Ψl) contains the superimposition of the post-correlation signals. Qpc denotes the covariance matrix of the postcorrelation noise. The noise is no longer white after the correlation step, and it is shown in [20] that the postcorrelation noise covariance matrix is given by(12)Qpc=E(npcnpcH)=σ̃n2(IMN⊗QP),
where σ̃n2 denotes the noise power after the correlation step, and QP is define thanks to the auto-correlation function of the PRN code r(·):(13)QP=[r(0)r(Cs)⋯⋯r(P⋅Cs)r(Cs)r(0)r(Cs)⋮⋮r(Cs)r(0)r(Cs)⋮⋮r(Cs)r(0)r(Cs)r(P⋅Cs)⋯⋯r(Cs)r(0)]P×P.The first step of the SAGE algorithm, so-called expectation step (E-STEP), consists in estimating the hidden data space with(14)x̂l=x-∑l′=0l′≠lL-1xl′(Ψl′).The second step, so-called maximization step (M-STEP), carries out the maximization of the log-likelihood function which is associated with the estimated hidden data space. In the case of the STAP multicorrelator signal, the log-likelihood function is(15)Λ(Ψl)=ln⁡p(x̂l∣Ψl)=-ln⁡πNPM-ln⁡det⁡Qpc-(xl(Ψl)-x̂l)HQpc-1(xl(Ψl)-x̂l).The maximization of Λ with respect toΨl can be concentrated, as the dependence to γ̃l is linear:(16)γ̃l=[a(θ̂l,φ̂l)⊗r̆C(τ̂rl,ν̂rl)]Hx̂lMr̆CH(τ̂rl,ν̂rl)r̃C(τ̂rl,ν̂rl),
where r̆CH(τrl,νrl) is given by(17)r̆CH(τrl,νrl)=r̃CH(τrl,νrl)[IN⊗QP-1].Finally, the reduced likelihood function to maximize is(18)Λ̃(Ψl)=|[aH(θl,φl)⊗r̆CH(τrl,νrl)]x̂l|2Mr̆CH(τrl,νrl)r̃C(τrl,νrl).In order to better understand the expression (18), let us assume no noise is present, and we can develop (10) as(19)xl=γ̃la(θl,φl)⊗r̃C(τrl,νrl)=γ̃la(θl,φl)⊗e(νrl)⊗r(τrl),
where(20)e(νrl)=[exp⁡(j2πνrlTint⁡)⋯exp⁡(j2πνrlNTint⁡)]N×1T,(21)r(τrl)=[r(τrl-(P-1)2Cs)⋯r(τrl+(P-1)2Cs)]P×1T.Then, inserting (19), (20), and (21) in (18), we can express the reduced likelihood function as(22)Λ̃(θ,φ,τr,νr)=|γ̃l|2|aH(θ,φ)a(θl,φl)|2M︸spaceFT|eH(νr)e(νrl)|2N︸frequencyFT×|rH(τr)QP-1r(τrl)|2rH(τr)QP-1r(τr).As we can see, the first two terms are similar to space and frequency Fourier transforms. Thus, the two parametersM and N will mainly influence the accuracy of the DOA and the Doppler estimations for both algorithms (SAGE and SAGE/STAP). However, the couple {P,Cs} influences only the performances of the SAGE/STAP algorithm with respect to the paths delay estimation. This point will be detailed in more detail in Section 4.


## 3.3. Implementation in a GNSS Receiver

To implement the SAGE/STAP algorithm in a GNSS receiver, we propose the architecture illustrated in Figure2.Figure 2
Proposed receiver architecture.The first front end bloc contains the RF filters, the downconversion step, the ADC and a calibration stage [21]. A calibration stage aims to compensate the technological defects such as the RF dispersion of the filters and antenna defects.The baseband signalZ is the output of this blocx. We must therefore use the STAP multicorrelator array for each tracked PRN code in order to compress the data. Afterward, we use the SAGE algorithm in the processing bloc. Finally, the SAGE estimation of the relative delay and Doppler τr0,νr0 is used to drive the DLL and PLL/FLL. Thus, the key idea of our solution is to substitute the conventional DLL and PLL/FLL discriminators by the SAGE/STAP estimation.


## 4. Simulation Results

The aim of this section is to study the impact of the compression step (realized by the STAP multicorrelator array) on the SAGE algorithm performances. Thus, this section focuses on the comparison between the classical SAGE and the SAGE/STAP multicorrelator algorithms. The estimation performances of both algorithms were numerically evaluated with Monte Carlo simulations and theoretically through the CRB derivation. The derivation of the CRB for the SAGE/STAP algorithm is given in the annexe. For the conventional SAGE algorithm, the CRB can be found in [17]. The simulations parameters are as follows: σn2=-131 dBW, γ0dB=-160 dBW, θ0=61°, φ0=131°, υ0=100 Hz, and we use N=20 blocks of 1 ms of integration. The sampling frequency of the baseband signal is fs=10 MHz. The 2×2 square array antenna contains 4 isotropic identical sensors spaced by λ/2.In a first time, we analyze the influence ofP (the number of correlators) and Cs (the correlators’ delay spacing) on the performances of the SAGE/STAP algorithm. In order to cover all the cross-correlation function, we should have PCs>2Tc. This condition is necessary if we want to take into account all the multipaths with a relative delay τrl∈[0,Tc]. Therefore, we have the following relationship P=ceil(2Tc/Cs), where the operator ceil(x) denotes the nearest integer greater than or equal to x. We now focus our attention on the Cs parameters.To study the influence ofCs, we calculate the root-mean-square error (RMSE) of the time delay based on 100 Monte Carlo simulations for both algorithms (SAGE and SAGE/STAP multicorrelator). In this first simulation, we assume no multipath, and the RMSE is plotted on Figure 3 as a function of Cs, for different signal bandwidths: B=2 MHz and B=4 MHz, where B denotes the two-sided RF bandwidth. When comparing the RMSE of SAGE and SAGE/STAP algorithms, we can see that both algorithms present the same performances in the case Cs≤1/B. This behavior is confirmed theoretically with the curve of the CRB as a function of Cs. We can see that the standard deviation increases when Cs becomes higher than the inverse of the signal bandwidth. We can deduce from this observation the following empirical rule which results from a tradeoff between accuracy and complexity:(23)P=ceil(2Tc/Cs),Cs=1B≈1fs.Figure 3
RMSE for the SAGE algorithm and RMSE and CRB for the SAGE/STAP algorithm. RMSE and CRB are plotted as a function ofCs, and for 2 different signal bandwidths: B=2 MHz (black) and B=4 MHz (blue).This conclusion can also be observed on the shape of the likelihood function. In Figures4 and 5, we plot a section of the likelihood function through the delay for the SAGE and SAGE/STAP multicorrelator algorithms. In other words, we compare |rH(τr)ΣP-1r(τr)| and |r(τr)|2 for different signal bandwidths (B=2 MHz on Figure 4 and B=4 MHz on Figure 5) and different correlator spacings Cs. We can see that if the condition (23) is fulfilled, the likelihood functions are identical for the SAGE and SAGE/STAP multicorrelator algorithms. If not, the likelihood function of the SAGE/STAP algorithm becomes wider than the classical SAGE likelihood function, which will consequently increase the variance of the estimation.Figure 4
Likelihood function section through the delay for the SAGE and SAGE/STAP algorithms.B=2 MHz and Cs=0.1, 0.2 and 0.5 Chips.Figure 5
Likelihood function section through the delay for the SAGE and SAGE/STAP algorithms.B=4 MHz and Cs=0.1, 0.2 and 0.5 Chips.In a second time, we evaluate the performances of both algorithms in the case of one multipath. The reflected multipath and the LOSS are considered to be in-phase which corresponds to one of the worst possible cases. In Figure6, we plot the RMSE of the estimated time delay for both algorithms as a function of the relative time delay and relative azimuth between the LOSS and the MP (denoted Δτ and Δφ). The multipath parameters are γ1dB=-163 dBW, θ1=30°, υ1=105 Hz.Figure 6
CRB of the LOSS delay as a function of the relative azimuth and relative delay, for the SAGE and the SAGE/STAP algorithms.ΔγdB=-3 dB, Δθ=31°, Δυ=-5 Hz.We assume that the receiver is perfectly synchronized with the LOSS at the beginning of the simulation. Therefore the initial relative parameters areυr0=0 Hz, υr1=5 Hz, τr0=0 Chip. In order to choose the couple {P,Cs}, we use the results of the first simulation together with the condition (23): fs=B=10 MHz, Cs=1/B=0.1 Chip, and P=2Tc/Cs=20. Here again, we can see that both algorithms present the same performances whatever the multipath position (in space and delay). We also plot in Figure 7 the CRB for the SAGE and SAGE/STAP algorithms. The behaviour of both CRB shows that the algorithms are theoretically equivalent. Thus, the SAGE/STAP multicorrelator can reach the efficiency of the SAGE algorithm but with a strongly reduced complexity. Indeed, the size of the baseband signal is MfsNTint compared to MNP=MN2Tcfs for the postcorrelated signal in the optimal configuration. The compression factor is Tint/(2Tc)≈500.Figure 7
RMSE of the LOSS delay as a function of the relative azimuth and relative delay, for the SAGE and the SAGE/STAP algorithms.ΔγdB=-3 dB, Δθ=31°, Δυ=-5 Hz.We compare now the RMSE and the CRB of the SAGE/STAP algorithm in Figure8 in the same configuration. We can see that the RMSE reaches the CRB if the sources are spaced by more than 50°. This result is particularly interesting because in this situation, close and far time delay multipaths are completely mitigated by the algorithm, which is mainly due to the multiantenna contribution. In the case where the relative azimuth is weaker, the algorithms mainly use the time and frequency domains to mitigate the multipath. In this condition, the array antenna is not useful anymore, and the rejection performances are similar to single antenna mitigation techniques (e.g., MEDLL). In Figure 9, we plot the RMSE and the CRB for the LOSS elevation estimation. Here again, the RMSE reaches the CRB, excepted in the case of short-time delay (Δτ<0.1 Chip) and close space sources (Δφ<20°). This shows the limitation of the SAGE approach for cases where the MP is close to the LOSS on the 4 dimensions considered in the estimation process.Figure 8
RMSE and CRB of the LOSS delay as functions of the relative azimuth and relative delay, for the SAGE/STAP algorithms.ΔγdB=-3 dB, Δθ=31°, Δυ=-5 Hz.Figure 9
RMSE and CRB of the LOSS elevation as functions of the relative azimuth and relative delay, for the SAGE/STAP algorithms.ΔγdB=-3 dB, Δθ=31°, Δυ=-5 Hz.The efficiency of the SAGE/STAP algorithm was illustrated in the previous simulations. Now, we want to address the impact of this algorithm on the performances of conventional GNSS tracking loops.First of all, we evaluate the error envelope for a conventional DLL enhanced by a conventional beamformer (CBF) and for a DLL driven by SAGE (denoted DLL/SAGE). The loops parameters are loop order = 2, damping factor = 0.707,BDLL=1 Hz, BPLL=10 Hz. In the case of classical DLL, we use the early-minus-late discriminator (EMLD) with a chips spacing equal to 0.1 Chip and the arctangent discriminator for the PLL. In Figure 10, we plot the error envelope as a function of the relative azimuth and delay of the MP. Although the DLL is enhanced by a CBF, the SAGE/STAP algorithm provides the best multipath mitigation whatever the MP position.Figure 10
Error envelope for the DLL driven by SAGE and the DLL enhanced by a conventional beamforming. The envelope error is plotted as a function of the relative delay and azimuth.ΔγdB=-3 dB, Δθ=31°,Δυ=-5 Hz.In the last simulation, we propose to test the SAGE/STAP algorithm with the DLR channel model available online (http://www.kn-s.dlr.de/satnav/) [22]. The DLR channel model generates the number of paths (LOSS + MP), their complex amplitudes, relative delays, and Doppler shifts. In the free version available online, the DOA are not generated. Thus, we computed the DOA of the MP thanks to the position of the scatterers, which are randomly positioned based on statistics established during measurement campaigns [22].The LOSS parameters areθ0=43.7°, φ0=-88.61, υ0=395.75 Hz, and we simulated a CBOC signal [23] on the L1 band with B=fs=25 MHz. Thus, according to (23), we have P=49 and Cs=40 ns. The speed of the vehicle has been chosen to 0 m/s in order to tackle the problem of stationary MP. The other simulation parameters (N, DLL and PLL) are the same as in the previous simulations. In Figure 11, we plot the pseudorange error and the Doppler estimation of the conventional DLL/PLL and the DLL/PLL driven by the SAGE/STAP multicorrelators algorithm. As we can see, the SAGE approach provides a real improvement in the time delay and Doppler estimation with respect to the conventional multiantenna receiver architecture in a tracking scenario. More tracking simulations with this solution can be found in [24].Pseudorange error and Doppler estimation for the conventional DLL/PLL and the DLL/PLL driven by the SAGE algorithm.θ0=43.7°, φ0=-88.61, υ0=395.75 Hz.
(a)(b)


## 5. Conclusion

In this work we have addressed the problem of estimating the propagation time delay of the LOSS in a GNSS receiver under severe multipath conditions. To reduce the influence of the multipaths, we investigated the use of array antenna algorithms. Previous studies suggest using the SAGE algorithm with an array antenna in order to reduce the estimation error of the delay of the LOSS. However, SAGE is hardly implemented in real time due to the memory requirements and computation cost. Moreover, SAGE is hardly compatible with classical GNSS tracking loops.In order to take the advantages of SAGE with more reasonable hardware requirements, we proposed a new implementation based on a STAP multicorrelator array. The CRB derivation and the Monte Carlo simulations were used in this paper to study the trade-off between accuracy and complexity. This trade-off appears by the influence of the parametersP (number of correlators) and Cs (correlator space) on the SAGE/STAP multicorrelator performances. The size of the data to be processed is then drastically reduced, and the CRB and Monte Carlo simulations attest that there is no performance loss between the classical SAGE algorithm and the SAGE/STAP multicorrelator algorithm. Moreover, the SAGE/STAP multicorrelator algorithm can constitute the discriminator of GNSS tracking loops. Thus, with this new implementation, the high-resolution performances of SAGE are now available for GNSS receiver, which is a very promising approach for the multipath mitigation problem in GNSS.



---

*Source: 804732-2012-05-31.xml*