A robust vector tracking loop structure based on potential bias analysis
Bibliographic record
Abstract
This paper proposes a robust vector tracking loop structure based on potential bias analysis. The influence of four kinds of biases on the existing two implementations of Vector Tracking Loops (VTLs) is illustrated by theoretical analysis and numerical simulations, and the following findings are obtained. Firstly, the initial user state bias leads to steady navigation solution bias in the relative VTL, while new measurements can eliminate it in the absolute VTL. Secondly, the initial code phase bias is transferred to the following navigation solutions in the relative VTL, while new measurements can eliminate it in the absolute VTL. Thirdly, the user state bias induced by erroneous navigation solution of VTLs can be eliminated by both of the two VTLs. Fourthly, the multipath/NLOS likely affects the two VTLs, and the induced tracking bias in the duration of the multipath/NLOS would decrease the performance of VTLs. Based on the above analysis, a robust VTL structure is proposed, where the absolute VTL is selected for its robustness to the two kinds of initialization biases; meanwhile, the instant bias detection and correction method is used to improve the performance of VTLs in the duration of the multipath/NLOS. Numerical simulations and experimental results verify the effectiveness of the proposed robust VTL structure.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".