The GNSS integer ambiguities: estimation and validation
The GNSS integer ambiguities: estimation and validation
The GNSS integer ambiguities: estimation and validation
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
IE<br />
IEU<br />
IU<br />
LU<br />
Figure 4.1: <strong>The</strong> set of relationships between the different classes of estimators: <strong>integer</strong><br />
equivariant estimators (IE), unbiased <strong>integer</strong> equivariant estimators (IEU), unbiased <strong>integer</strong><br />
estimators (IU), <strong>and</strong> linear unbiased estimators (LU).<br />
By its definition, the class of IE estimators is larger than the class of admissible estimators<br />
defined in section 3.1, <strong>and</strong> thus all admissible estimators are also <strong>integer</strong> equivariant.<br />
Recall that the admissible <strong>integer</strong> estimators are unbiased, <strong>and</strong> therefore this class is<br />
referred to here as the class of <strong>integer</strong> unbiased (IU) estimators.<br />
<strong>The</strong> class of IE estimators is also larger than the class of linear unbiased (LU) estimators.<br />
Let f T θ y be the linear estimator of θ = lT a a + l T b b for some fθ ∈ R m . This estimator is<br />
unbiased if f T θ Aa + f T θ Bb = lT a a + l T b b, ∀a ∈ Rn , b ∈ R m with E{y} = Aa + Bb. This<br />
gives:<br />
<br />
fθ(y + Aa) = fθ(y) + l T a a ∀y ∈ R m , a ∈ R n<br />
fθ(y + Bb) = fθ(y) + l T b b ∀y ∈ Rm , b ∈ R p (4.2)<br />
Comparing this result with (4.1) shows indeed that the condition of linear unbiasedness<br />
is more restrictive than that of <strong>integer</strong> equivariance, since the first condition must be<br />
fulfilled for all a ∈ R n . Hence, the class of linear unbiased estimators is a subset of the<br />
class of <strong>integer</strong> equivariant (IE) estimators, so that there must exist IE estimators that<br />
are unbiased. Summarizing, this gives the following relationships: IEU = IE ∩ U = ∅,<br />
LU ⊂ IEU, <strong>and</strong> IU ⊂ IEU (see figure 4.1).<br />
<strong>The</strong> goal was to find an estimator that is ’best’ in a certain sense. <strong>The</strong> criterion of ’best’<br />
that will be used is that the mean squared error (MSE) should be minimal. <strong>The</strong> reason<br />
for this choice is that the MSE is a well-known probabilistic criterion to measure the<br />
closeness of an estimator to its target value. Furthermore, the MSE-criterion is often<br />
used as a measure for the quality of the float solution itself. With the MSE-criterion the<br />
best <strong>integer</strong> equivariant (BIE) estimator, ˜ θ, is defined as:<br />
˜θ = arg min<br />
fθ∈IE E{(fθ(y) − θ) 2 } (4.3)<br />
Note that the minimization is taken over all IE functions that satisfy the condition of<br />
definition 4.1.1. <strong>The</strong> solution of this minimization problem is given by:<br />
˜θ =<br />
<br />
z∈ZnRp <br />
(lT a z + lT b ζ)fy (y + A(a − z) + B(b − ζ)) dζ<br />
<br />
fy (y + A(a − z) + B(b − ζ)) dζ<br />
z∈ZnRp U<br />
(4.4)<br />
68 Best Integer Equivariant <strong>estimation</strong>