Automatic Modulation Classification of Frequency-Hopping Signals Using High-Dimensional Phase Diagrams
Bibliographic record
Abstract
Automatic modulation recognition for frequency-hopping (FH) signals remains very challenging to researchers due to the signals' time-varying spectral characteristics. In this work, a novel robust automatic modulation recognition scheme is investigated for FH signals using the phase-space topological features represented by the embedded phase diagrams. As such embedded phase diagrams are often high-dimensional, it is necessary to formulate the phase-space features as tensors. In the training process, the phase-space tensor features will be utilized to establish the regression models as linear encoders for the individual modulations. The aforementioned linear encoders are constructed using the support vector machine (SVM); the phase-space feature-tensors of the training signals of all modulations will be projected by their corresponding regression models (or linearly encoded) to produce the representative code-vectors, respectively. In the test stage, the phase-space feature-tensor produced from a test signal will be projected by each individual trained regression model (or linearly encoded) to generate the respective code-vectors. Then, the code-vectors resulting from the test stage will be compared with the representative code-vectors to find which modulation will lead to the smallest Euclidean distance in between and such a modulation will be picked as the modulation type of the test signal. Monte Carlo simulation results have demonstrated that the average recognition accuracy of our proposed new approach is more than 90% when the signal-to-noise ratio is no less than 0 dB for additive white Gaussian noise.
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.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| 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 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".