Novel Deep-Learning Modulation Recognition Algorithm Using 2D Histograms over Wireless Communications Channels
Bibliographic record
Abstract
Modulation recognition (MR) has become an essential topic in today’s wireless communications systems. Recently, convolutional neural networks (CNNs) have been employed as a potent tool for MR because of their ability to minimize the feature’s susceptibility to its surroundings and reduce the need for human feature extraction and evaluation. In particular, these investigations rely on the unrealistic assumption that the channel coefficient is typically one. This motivates us to overcome the previous constraint by providing a novel MR suited to fading wireless channels. This paper proposes a novel MR algorithm that is capable of recognizing a broad variety of modulation types, including M-ary QAM and M-ary PSK, without enforcing any restrictions on the modulation size, M. The analysis has shown that each modulation choice has a distinct two-dimensional in-phase quadrature histogram. This property is beneficially utilized to design a convolutional neural-network-based MR algorithm. When compared to the existing techniques, Monte Carlo simulations demonstrated the success of the proposed design.
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.001 |
| 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.001 |
| 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".