Combining secondary code correlations for fast GNSS signal acquisition
Bibliographic record
Abstract
The secondary codes of the modern GNSS signals bring some notable advantages, however they constitute a challenge for the acquisition process. Indeed, it becomes much more difficult to extend the coherent integration time with these codes. Several methods have been proposed for increasing the coherent integration time when there is a secondary code. Basically, the methods fall into two categories : 1) Methods with long coherent integration times, which require synchronization with the secondary code and imply a significant computational burden, and 2) Methods with short coherent integration times, which test all possible combinations for the secondary code. Since this leads to an exponential increase in the number of combinations, the coherent integration time remains limited, while non-coherent integrations are not usable. Therefore, there is currently no effective solution with intermediate coherent integration time, which would enable moderate to high sensitivity, while maintaining a reasonable level of complexity. In this paper, a method is proposed to address this problem. The method combines secondary code correlations to reduce the number of possible secondary code delays and reduce the complexity. In exchange, there is a loss in the signal-to-noise ratio as compared to the full secondary code correlation. It is shown that the proposed method offers similar or better performance than the short integration times method, in addition to offering the possibility of using non-coherent integrations, and offers lower complexity than the traditional long integration times method with greater sensitivity.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 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 teacher head, 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".