MétaCan
Menu
Back to cohort
Record W2420110223 · doi:10.1109/lsp.2016.2572666

Fold-based Kolmogorov–Smirnov Modulation Classifier

2016· article· en· W2420110223 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIEEE Signal Processing Letters · 2016
Typearticle
Languageen
FieldComputer Science
TopicWireless Signal Modulation Classification
Canadian institutionsMemorial University of Newfoundland
FundersFundamental Research Funds for the Central UniversitiesState Key Laboratory of Rail Traffic Control and SafetyNatural Sciences and Engineering Research Council of CanadaNational Natural Science Foundation of China
KeywordsClassifier (UML)Computer sciencePattern recognition (psychology)Robustness (evolution)Artificial intelligenceSpeech recognitionPhase-shift keyingMachine learningAlgorithmBit error rateDecoding methods

Abstract

fetched live from OpenAlex

Modulation classification is crucial in applications such as electronic warfare and interference cancellation. In this letter, a novel feature-based Kolmogorov-Smirnov classifier is proposed for the identification of the modulation formats. The received signal is first preprocessed with a folding operation that helps identify the modulation formats based on their different axes of symmetry. Simulation results show that the performance of the proposed classifier is close to that of the optimal likelihood-based classifier, while its robustness to noise uncertainty is improved and its computational complexity is reduced compared to that of the optimal likelihood-based classifier.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.906
Threshold uncertainty score0.860

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.002
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.029
GPT teacher head0.243
Teacher spread0.215 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it