MétaCan
Menu
Back to cohort
Record W2099076571 · doi:10.1109/vetecf.2007.284

Optimal Training Signals and Detection for OFDM Under Colored Noise

2007· article· en· W2099076571 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

VenueIEEE Vehicular Technology Conference · 2007
Typearticle
Languageen
FieldComputer Science
TopicBlind Source Separation Techniques
Canadian institutionsUniversity of Saskatchewan
Fundersnot available
KeywordsOrthogonal frequency-division multiplexingComputer scienceFrequency domainNoise (video)Symbol (formal)Channel (broadcasting)AlgorithmTime domainComputationSignal-to-noise ratio (imaging)Computational complexity theoryColors of noiseMultiplexingTelecommunicationsArtificial intelligenceNoise reductionComputer visionImage (mathematics)

Abstract

fetched live from OpenAlex

Based on convex programming, this paper presents the optimal training signal design for orthogonal frequency-division multiplexing (OFDM) under colored noise. An effective method for OFDM symbol detection with the use of preceding is also described. Both analytical and simulation results show that the proposed design and method can effectively estimate the channel and reliably detect the OFDM symbols. By working in the frequency domain rather than the time domain, the computation complexity of the proposed estimation algorithm is significantly reduced.

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.001
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: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.477
Threshold uncertainty score0.731

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.000
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.035
GPT teacher head0.285
Teacher spread0.250 · 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