PERFORMANCE OF GNSS CARRIER-TRACKING LOOP BASED ON KALMAN FILTER IN A CHALLENGING ENVIRONMENT
Bibliographic record
Abstract
Abstract. The global navigation satellite system (GNSS) recently plays an extremely important role in positioning, navigation, and timing (PNT) applications for the modernized automations and mechanizations, e.g., unmanned aerial vehicles (UAVs), unmanned ground vehicles (UGVs), military aircrafts, etc. Nevertheless, GNSS signals are very vulnerable to the influence of various interferences when they are received on Earth, and the reason why it happens is that the long line-of-sight (LOS) distance between the satellite and the receiver user dramatically reduces the power strength after the signal reaches at the ground. The weak GNSS signal is hard to be handled with traditional phase lock loop (PLL), especially in a dynamic environment. Again, the trade-off among the coherent integration time of tracking loop, received signal power strength, and signal or user receiver dynamics is still a tough and remained problem to be solved. The Kalman filter (KF) is always a promising tool to efficiently decrease the random noise for the tracking process. In our work, we evaluate the performances of the tracking loop modelled with both standard KF and extended Kalman filter (EKF). An adaptive algorithm for the covariance matrix of the process noise is contained in our system to increase the tracking ability in a weak and dynamic environment. Besides, a noise channel is also contained to automatically adjust the priori measurement covariance for the KF tracking loop model. Simulation results demonstrate the performance with the proposed technique.
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.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
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".