1. INTRODUCTION
The ‘GNSS Baseline Model’ is widely used in GNSS computations involving the relative positioning technique (Tiberius, Reference Tiberius1998; Wang, 2002; Leick, Reference Leick2003; Misra and Enge, Reference Misra and Enge2006; Hofmann-Wellenhof et al., Reference Hofmann-Wellenhof, Lichtenegger and Wasle2008). The Double Differenced (DD) method is a very common approach for constructing the GNSS Baseline Model (Strang and Borre, Reference Strang and Borre1997; Teunissen and Kleusberg, Reference Teunissen and Kleusberg1998); however, some scholars assume that there are some drawbacks in the DD method (Chang and Paige, Reference Chang and Paige2003a). For example it is numerically slightly dubious, it makes the DD measurements correlated and it gives unnecessary prominence to the reference satellite. In (Chang and Paige, Reference Chang and Paige2003b; Chang et al., Reference Chang, Paige and Yin2004), an ‘Orthogonal Transformation’ approach is presented, which can avoid the first two drawbacks, while maintaining all the advantages. Both the DD and Orthogonal Transformation can be utilized to construct the GNSS Baseline Model. In order to evaluate both models, we focus on the ‘Integer Ambiguity Resolution’ and the conditional least-squares solution. The theoretical equivalence of both models is proved for the short baseline based on those two aspects.
2. GNSS BASELINE MODEL
2.1. The Standard GNSS Baseline Model
The standard GNSS Baseline Model is the mixed integer model (Teunissen, Reference Teunissen2003, Reference Teunissen2011a). It is defined as:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn1.gif?pub-status=live)
where:
Y is the given GNSS data vector.
a and b are the unknown parameter vectors of order n and p respectively.
E(·) and D(·) denote the expectation and dispersion operators, respectively.
A and B are the given design matrices that link the data vector to the unknown parameters.
The variance matrix of Y is given by the positive definite matrix Q Y. The n-vector a contains the integer DD ambiguities and the real-valued p-vector b contains the remaining unknown parameters, such as for instance baseline components (coordinates) and possibly atmospheric delay parameters (troposphere, ionosphere). Many relative positioning methods make use of the Least-Squares Ambiguity Decorrelation Adjustment (LAMBDA) method to estimate the integer ambiguity, as this method is known to be efficient and to maximize the ambiguity success rate (Teunissen, Reference Teunissen1995, Reference Teunissen1999; Verhagan, 2004). In order to utilize the LAMBDA method, first regardless of the integer constraint of a, the float solution and its variance–covariance (v-c) matrix
should be obtained by the (weighted) least-squares method. The least-squares solution can be written as follows (Teunissen, Reference Teunissen2006):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn2.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn3.gif?pub-status=live)
where with the orthogonal projector P
.
For the GNSS compass problem (Teunissen, Reference Teunissen2006, Reference Teunissen2010), the Constrained LAMBDA method is used since the baseline length is provided as well (Giorgi et al., Reference Giorgi, Teunissen and Verhagen2010; Teunissen et al., Reference Teunissen, Giorgi and Buist2011b). In this case, the conditional least-squares solution for b, which assumes that a is known, is also required for the estimator. The conditional least-squares solution and its v-c matrix read:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn4.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn5.gif?pub-status=live)
The notation emphasizes that we consider
a function. With the fixed integer ambiguity
, the fixed baseline vector can be obtained by:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn6.gif?pub-status=live)
In order to make the proof clearer, we firstly focus on the single frequency, single epoch and short baseline scenario for constructing the GNSS Baseline Model.
2.2. The Double-Differenced (DD) Model
For the short baseline and m visible satellites, with σ ϕ,i2 and σ ρ,i2 being the variance of carrier phase and code on band L i , the Single-Differenced (SD) carrier phase and code equations can be expressed in compact vector and matrix notation as (Chang et al., Reference Chang, Paige and Yin2004; Chen and Qin, Reference Chen and Qin2011)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn7.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn8.gif?pub-status=live)
where:
yi,Sϕ and yi,Sρ are SD phase and code observations in units of cycles.
E is the (m−1)×3 matrix of normalized SD line-of-sight vectors.
vi,Sϕ and vi,Sρ are SD phase and code noise.
Ni ,S is the SD integer ambiguity vector.
λ i is the wave length.
em is a vector of order m for which each entry is 1 and β is the clock bias.
In order to eliminate the clock biases of all the SD equations, the (m−1)×m DD matrix operator will be defined as D=(d1d2… dm) (Teunissen, Reference Teunissen1997). This matrix can be set up in several ways, depending on the choice of reference satellite (Odijk, Reference Odijk2003). If satellite k is chosen as the reference satellite, thus the vector d k=−em− 1 where em−1 is an m−1 vector for which each entry is 1, and all the other vectors of D can be treated as Im−1. When the first satellite is selected as the reference satellite, it reads D=(−em− 1, Im−1). Pre-multiplications of Equations (7) and (8) by this operator give:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn9.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn10.gif?pub-status=live)
where:
- yi,D ϕ
=Dyi,Sϕ
- yi,Dρ
=Dyi,Sρ
- vi,Dϕ
=Dv i,Sϕ
- vi,Dρ
=Dv i,Sρ
- Ni,D
=DN i,S
- Hi
=1/λ iDE
- Q
=DD T.
The DD model can be obtained by combining Equations (9) and (10):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn11.gif?pub-status=live)
Thus the standard GNSS model can be obtained if each term is expressed as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn12.gif?pub-status=live)
The subscript i denotes that the item is depending on the given band and the subscript 0 denotes that its structure does nothing with the given band.
2.3. The Orthogonal Transformation Model
This model is based on an Orthogonal Transformation of single differences and the vector of DD integer ambiguities is still available (Chang and Paige, Reference Chang and Paige2003b). The main steps are re-derived as follows (Chen and Qin, Reference Chen and Qin2011). Let P∈Rm ×m be an Orthogonal Transformation such that and the Householder transformation is used to form P as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn13.gif?pub-status=live)
where u1=(1, 0,…, 0)T=(1 0)T.
By simple algebraic operations, we obtain for this matrix
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn14.gif?pub-status=live)
where .
In order to eliminate the clock bias, applying P to Equation (7), we obtain the initial Orthogonal Transformation of Equation (7):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn15.gif?pub-status=live)
Note that only the first equation involves the clock bias term, the remaining part can be written as:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn16.gif?pub-status=live)
Although double differencing is not used, the DD integer ambiguity vector can also be obtained by the following algebraic operations. Define the matrix F as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn17.gif?pub-status=live)
where F is nonsingular.
With Equation (14), it is easy to verify that:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn18.gif?pub-status=live)
where D≡[−em− 1Im−1] is the DD operator.
Thus the following formulation can be deduced:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn19.gif?pub-status=live)
Replacing in Equations (16) by (19), we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn20.gif?pub-status=live)
where the DD integer ambiguity vector exists.
The transformed noise vector still follows the same distribution because Orthogonal Transformation will not change the statistical properties of white noise (Chang and Paige, Reference Chang and Paige2003b). Similarly, applying P to Equation (8), we obtain the following Orthogonal Transformation of SD code observation equation (Chang et al., Reference Chang, Paige and Yin2004):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn21.gif?pub-status=live)
The combination expression of Equations (20) and (21) reads
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn22.gif?pub-status=live)
where:
.
Note that both phase and code are expressed in units of cycles. This can be considered as the standard GNSS model if each term is expressed as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn23.gif?pub-status=live)
3. CONDITIONAL LEAST-SQUARE SOLUTION EQUIVALENCE OF BOTH MODELS
3.1. The Conditional Least-Squares Baseline Vector of the Double Difference Model
With Equations (4) and (5), the conditional least-squares solution reads
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn24.gif?pub-status=live)
With Hi=1/λiDE and Q=DDT, we obtain (Chen et al., Reference Chen, Qin, Zhang and Jin2012)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn25.gif?pub-status=live)
where and Γ=DT(DDT)−1D.
Since Equation (5) is part of Equation (4), the conditional least-squares solution reads:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn26.gif?pub-status=live)
3.2. The Conditional Least-Squares Solution of the Orthogonal Transformation Model
In the same way, the conditional variance-covariance matrix of the Orthogonal Transformation model reads:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn27.gif?pub-status=live)
where the matrix .
The conditional least squares solution is expressed as the same structure of Equation (27):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn28.gif?pub-status=live)
3.3. Equivalence of the Conditional Least-Squares Solution
In order to prove the equivalence of baseline vector, we should prove the equivalence of Equations (25) and (27) and also the equivalence of Equations (26) and (28). It is worth noting that they have similar expressions and only the matrix Γ and K are different for the DD model and the Orthogonal Transformation model. In order to prove Γ =K, we should prove the following Equation (29):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn29.gif?pub-status=live)
With Equation (29), we can obtain the following expression:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn30.gif?pub-status=live)
With Equation (17), the following equation can be verified:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn31.gif?pub-status=live)
For the DD operator, we have the same structure (Teunissen, Reference Teunissen1997) as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn32.gif?pub-status=live)
With Equations (31) and (32), we have:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn33.gif?pub-status=live)
With Equations (30) and (33), Equation (29) can be verified, and so we prove the conditional least-square solution equivalence of both models.
4. INTEGER AMBIGUITY RESOLUTION EQUIVALENCE OF BOTH MODELS
In order to prove the equivalence of integer ambiguity resolution, we should focus on the float ambiguity vector and its v-c matrix
, see also Equations (2) and (3). For the orthogonal projector
, the following properties can be verified:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn34.gif?pub-status=live)
With Equation (34), the equivalent expression of Equation (3) is written as:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn35.gif?pub-status=live)
We may also therefore write Equation (2) as:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn36.gif?pub-status=live)
4.1. Integer Ambiguity Resolution of the Double-Differenced (DD) Model
With the notations of Equation (12), the unknown matrices of Equation (35) can be calculated as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn37.gif?pub-status=live)
The unknown matrices of (36) read as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn38.gif?pub-status=live)
4.2. Integer Ambiguity Resolution of the Orthogonal Transformation Model
With the notations of Equation (23), the matrices of Equation (35) can be calculated as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn39.gif?pub-status=live)
The matrices of Equation (36) read as:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn40.gif?pub-status=live)
4.3. Equivalence of Integer Ambiguity Resolution
With the derivation given in Equations (29) to (33), the equivalence of both operators is proved:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn41.gif?pub-status=live)
With Equation (33), the following equations can also be verified:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn42.gif?pub-status=live)
With Equations (33) (41) and (42), the equivalence of both models can be verified for and
, can all be proved. Thus the same float solution
and its variance-covariance matrix
can be obtained for both models.
5. ASSESSMENT OF GENERAL CASES
Assume that n GNSS bands are used to construct the GNSS Baseline Model, the single epoch GNSS model can be written as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn43.gif?pub-status=live)
The multi-frequency observation of the same GNSS constellation will bring the summation operator Σ into the computation, for example:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn44.gif?pub-status=live)
For the computation of and
, we obtain the following matrices:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn45.gif?pub-status=live)
Thus, in this case, the equivalence of both models does not alter. For k epochs, the standard GNSS model reads as follows (Giorgi et al., Reference Giorgi, Teunissen and Verhagen2010)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn46.gif?pub-status=live)
where:
A(0) denotes the constant A matrix for each epoch.
(k) denotes the corresponding matrix of the k epoch.
The multi-epoch observation will result in the Kronecker product operator (Giorgi et al., Reference Giorgi, Teunissen and Verhagen2010), and in this case the equivalence of both models is also valid, since the basic matrix of Equations (41) and (42) still remain in the derivations.
6. ASSESSMENT OF THE DRAWBACKS AND ADVANTAGES
Note that the cofactor matrix Q in Equations (9) and (10) has 2 s on the main diagonal and 1 s in all off-diagonal positions. Some scholars assume that the double differencing makes the DD measurements correlated, which is a drawback. However, this is not appropriate. Although the noise of Orthogonal Transformation model is white, the noise of DD model can still be white if an inverse-Cholesky factorization is used. The Cholesky decomposition of Q reads:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn47.gif?pub-status=live)
where:
L is a lower triangular matrix with strictly positive diagonal entries.
LT denotes the conjugate transpose of L.
Pre-multiplication of Equations (9) and (10) by inverse of L gives:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn48.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151022025822722-0228:S0373463312000136_eqn49.gif?pub-status=live)
The structure of Equations (48) and (49) are the same as Equations (20) and (21). Although the noise levels of Equations (20) and (21) seem smaller than those of Equations (9) and (10), with the use of the Orthogonal Transformation, one does not avoid the higher noise level of double differencing, due to the equivalence of both models. Finally, although Orthogonal Transformation is a numerically stable approach, double differencing is also not numerically dubious if properly implemented.
7. CONCLUSIONS
The Double Difference (DD) method and the Orthogonal Transformation approach can both construct the standard GNSS Baseline Model. Some scholars assume that the Orthogonal Transformation approach is better than the DD method. In this paper, we prove the theoretical equivalence of both approaches for the short baseline. Assessment of some views about the model drawbacks and advantages is also given and discussed.