MétaCan
Menu
Back to cohort
Record W2042909471 · doi:10.1109/camsap.2013.6714087

Frequency domain distributed OFDM source detection

2013· article· en· W2042909471 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.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed Sensor Networks and Detection Algorithms
Canadian institutionsQueen's University
Fundersnot available
KeywordsDetectorOrthogonal frequency-division multiplexingComputer scienceFrequency domainNoise (video)AlgorithmMultiplexingTime domainNoise powerSignal-to-noise ratio (imaging)Computational complexity theoryPower (physics)Electronic engineeringTelecommunicationsArtificial intelligenceEngineeringPhysicsChannel (broadcasting)

Abstract

fetched live from OpenAlex

We consider distributed detection of an orthogonal frequency-division multiplexing (OFDM) random source using a cooperative set of sensors. Assuming that the observations of different sensors are independent, we derive/propose several frequency-domain detectors: the Neyman-Pearson detector for known SNRs and noise variances and three generalized likelihood ratio detectors for unknown SNRs and/or noise variances assuming that the transmit power is either uniformly allocated to all the subcarriers or not. Our theoretical analysis matches our simulation results and show that the proposed detectors, despite their lower computational complexity, outperform the state-of-the-art time-domain detectors in practical cases.

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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.926
Threshold uncertainty score1.000

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.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.005
GPT teacher head0.188
Teacher spread0.183 · 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