Suppression of Continuous Wave Interference in Loran-C Signal Based on Sparse Optimization Using Tunable Q-Factor Wavelet Transform and Discrete Cosine Transform
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Loran-C is the most essential backup and supplementary system for the global navigation satellite system (GNSS). Continuous wave interference (CWI) is one of the main interferences in the Loran-C system, which will cause errors in the measurement of the time of arrival, thereby affecting positioning performance. The traditional adaptive notch filter method needs to know the frequency of CWI when removing it, and the number is limited. This paper presents a method based on sparseness to suppress the CWI in the Loran-C signal. According to the different morphological characteristics of the Loran-C signal and the CWI, we construct dictionaries suitable for the two components, respectively. We use the tunable Q-factor wavelet transform and the discrete cosine transform to make the two components obtain a good sparse representation in their respective dictionaries. Then, the two components are separated using the morphological component analysis theory. We illustrate this method using both synthetic data and actual data. A huge advantage of the proposed method is that there is no need to know the frequencies of the CWI for it can better cope with frequency changes of the CWI in the actual environments. Compared with the adaptive notch filter method, the results of the proposed method show that our approach is more effective and convenient.
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.
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.000 | 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 it