08.06.2013 Views

Bernese GPS Software Version 5.0 - Bernese GNSS Software

Bernese GPS Software Version 5.0 - Bernese GNSS Software

Bernese GPS Software Version 5.0 - Bernese GNSS Software

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

if the real-valued ambiguities p1 ij ij<br />

kℓ , p2kℓ ambiguities we may use the alternative (integer) values pA1 ij ij<br />

kℓ , pA2kℓ hand site of Eqn. (8.14):<br />

The difference<br />

| (λ1p1 ij<br />

kℓ<br />

8.3 Ambiguity Resolution Algorithms<br />

are taken into account. Instead of these real-valued<br />

to compute the right-<br />

λ1pA1 ij ij<br />

kℓ − λ2pA2kℓ ij ij<br />

− λ2p2kℓ ) − (λ1pA1kℓ ij<br />

− λ2pA2kℓ ) |<br />

is actually the difference between the ionosphere bias which was estimated during the initial<br />

ambiguity-free solution and the ionosphere bias which would be the result of the alternative<br />

ambiguity-fixed solution. The difference has to be very small (see option “Search width<br />

for geometry-free linear combination” in panel “<strong>GPS</strong>EST 3.2.1: General Search Ambiguity Resolution<br />

Strategy”).<br />

It is almost mandatory to use the SEARCH strategy in rapid static mode. If both frequencies<br />

are available (L1 and L2 measurements are processed) usually several minutes of data<br />

are sufficient to resolve the ambiguities and achieve an accuracy of about a centimeter. If<br />

only one frequency is processed the observation interval has to be longer (usually about<br />

30 minutes of data are sufficient). In rapid static mode usually only short (up to several<br />

kilometers) baselines are processed.<br />

The disadvantage of our SEARCH strategy has to be seen in the fact, that either all the<br />

ambiguities or none are resolved. This may cause problems if long sessions are processed<br />

and/or very long baselines are involved (see Figure 8.3(b)).<br />

8.3.3 SIGMA-Dependent Algorithm<br />

Let pi, pj be two (double-difference) ambiguity parameters (relative to the same reference<br />

ambiguity). For each parameter pi we compute the a posteriori rms error in the initial<br />

least-squares adjustment:<br />

<br />

mi = σ0 Qii , (8.15)<br />

where Qii is the corresponding element of the cofactor matrix. For the difference pi −pj the<br />

a posteriori rms error is<br />

mij = σ0<br />

<br />

Qii − 2 · Qij + Qjj . (8.16)<br />

The rms errors mi and mij of every possible double-difference ambiguity (see Eqn. (8.9) and<br />

(8.10)) are first sorted in ascending order of their rms errors. Within one iteration step the<br />

Nmax best determined ambiguities (or differences between ambiguities) are then resolved<br />

(rounded to nearest integers), provided<br />

• that the corresponding a posteriori rms error mi,mij is compatible with σ0 (mi ≤ σmax<br />

or mij ≤ σmax), and<br />

• that within the confidence interval (pi −ξmi,pi +ξmi) or (pij −ξmij,pij +ξmij) there<br />

is exactly one integer number.<br />

Nmax (“Maximal number of ambiguities fixed per iteration step”), σmax (“Maximal sigma of resolvable<br />

ambiguities”) and ξ (“Ambiguity resolvable if exactly one integer within”) are input parameters of<br />

the program <strong>GPS</strong>EST (panel “<strong>GPS</strong>EST 3.2.2: Sigma-Dependent Ambiguity Resolution Strategy”,<br />

<strong>Bernese</strong> <strong>GPS</strong> <strong>Software</strong> <strong>Version</strong> <strong>5.0</strong> Page 175

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!