An uncombined triple-frequency user implementation of the decoupled clock model for PPP-AR
Bibliographic record
Abstract
Abstract Precise point positioning (PPP) has proved its capacity to provide centimetre-level position solutions in open sky environments. However, the technique still suffers from relatively long initial convergence times. Research has proved the potential of ambiguity resolution (AR) to reduce the convergence time and three main methods are used to perform AR: the fractional cycle bias method, the decoupled clock model (DCM) and the integer recovery clock method. This paper focuses on the DCM and expands it at the user side to better fit the current context. Seeing as multi-frequency processing is proving to improve PPP performance, the classical DCM model is extended from a combined dual-frequency model to an uncombined triple-frequency one. The user implementation is tested on 1400, 3-h-long datasets from global IGS stations for 1 week with the Galileo constellation in both static and kinematic modes. First, some of the model-specific parameters are plotted and the estimated receiver biases are visualized. Then, dual- and triple-frequency PPP-AR results are shown. In both frequency modes, the convergence time and accuracy of the float solutions are improved with AR. In the dual-frequency case, the 100-percentile mean convergence time reduces from 19 min for the float solution to 14 min for the fixed solution, and the horizontal root mean square error improves 2.7 to 1.1 cm. In the triple-frequency case, the convergence time reduces from 17.5 min for the float solution to 9.5 min for the fixed solution, and the accuracy improves from 2.6 to 1.0 cm. These results show a minimal improvement in the accuracy between the dual-frequency and triple-frequency AR solutions, and a significant 40–50 $$\%$$ % improvement in the convergence time. Future work includes applying these developments to multi-constellation PPP-AR, which would further reduce the convergence time.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".