An Efficient Specific Emitter Identification Method Based on Complex-Valued Neural Networks and Network Compression
Bibliographic record
Abstract
Specific emitter identification (SEI) is a promising technology to discriminate the individual emitter and enhance the security of various wireless communication systems. SEI is generally based on radio frequency fingerprinting (RFF) originated from the imperfection of emitter's hardware, which is difficult to forge. SEI is generally modeled as a classification task and deep learning (DL), which exhibits powerful classification capability, has been introduced into SEI for better identification performance. In the recent years, a novel DL model, named as complex-valued neural network (CVNN), has been applied into SEI methods for directly processing complex baseband signal and improving identification performance, but it also brings high model complexity and large model size, which is not conducive to the deployment of SEI, especially in Internet-of-things (IoT) scenarios. Thus, we propose an efficient SEI method based on CVNN and network compression, and the former is for performance improvement, while the latter is to reduce model complexity and size with ensuring satisfactory identification performance. Simulation results demonstrated that our proposed CVNN-based SEI method is superior to the existing DL-based methods in both identification performance and convergence speed, and the identification accuracy of CVNN can reach up to nearly 100% at high signal-to-noise ratios (SNRs). In addition, SlimCVNN just has 10% ~ 30% model sizes of the basic CVNN, and its computing complexity has different degrees of decline at different SNRs; there is almost no performance gap between SlimCVNN and CVNN. These results demonstrated the feasibility and potential of CVNN and model compression.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".