Swift Statistical Fingerprinting Supporting Electronic Warfare Signal Characterization: A Music Processing Approach
Bibliographic record
Abstract
In electronic warfare, distinguishing adversarial from friendly signals is a persistent challenge, especially when no reference templates exist.This work explores a blind signal processing approach, combining latent dictionary learning with Markov chain modeling, to rapidly characterize unknown radio-frequency signals using frequency state transitions.To test the method, we used musical excerpts (Brahms' Violin Concerto) as proxies for radio frequency waveforms, analyzing both clean and corrupted versions.First, we decomposed the audio signals into time-frequency spectra using the Fourier transform, then construct overcomplete spectral dictionaries via nonnegative matrix factorization.By applying sparse coding using the least absolute shrinkage and selection operator and Markovian analysis, we derived transition matrices that served as statistical, frequency state transition fingerprints.These fingerprints revealed clear differences between clean and distorted signals-such as gaps in transition probabilities (e.g., [898-1021] Hz) caused by simulated violin playing errors.While nonnegative matrix factorization and Markov modeling successfully highlighted corruption patterns, simplex-based endmember extraction proved less discriminative, likely due to its inherent lack of eigenmode generation.The results suggest that temporal-spectral fingerprinting-without relying on neural networks-could enable fast, efficient signal classification in electronic warfare, particularly for signals of unknown origin.This approach may serve as a preprocessing step for more complex radio frequency analysis pipelines.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| 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".