MétaCan
Menu
Back to cohort
Record W2161700532 · doi:10.1109/glocom.2005.1578341

Fano space-time multiple symbol differential detectors

2005· article· en· W2161700532 on OpenAlexaff
P. Pun, P. Ho

Bibliographic record

VenueGLOBECOM '05. IEEE Global Telecommunications Conference, 2005. · 2005
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsFano planeDetectorAlgorithmChannel (broadcasting)FadingComputer scienceDecoding methodsTelecommunicationsMathematics

Abstract

fetched live from OpenAlex

We present in the paper a multiple-symbol differential detector (MSDD) for differential space-time (ST) codes in Rayleigh flat fading channel. The detector, termed a Fano ST-MSDD, uses the Fano algorithm as its decoding engine and is capable of delivering excellent error performance at moderate implementation complexity over a wide range of fading rates. Essentially, the detector is an "intelligent" decision feedback detector (DFD) that uses a running threshold and the accumulated path metric as navigation tools when it roams the decoding tree. In the static channel, our best Fano ST-MSDD scheme with a detection window size of N=6 is able to narrow the original 3 dB gap between ideal coherent and conventional ST differential detection by 1 dB. In a fast fading channel with a Doppler frequency of three percent the ST symbol rate, the error curve of our best TV-10 Fano ST-MSDD is able to "track" that of the ideal coherent detector (with a 3-dB gap in between) and there is no irreducible error floor. All these performances become even more remarkable when we consider the rather moderate implementation complexity reported in the paper. Because of its close relationship with a DFD, the Fano ST-MSDD has a similar complexity as the DFD at large signal-to-noise ratio (SNR). Actually, we found that the complexity of the Fano ST-MSDD is a relatively stable function of the SNR

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 imitation

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

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation 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.002
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.014
GPT teacher head0.248
Teacher spread0.234 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreEmpirical

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

Quick stats

Citations4
Published2005
Admission routes1
Has abstractyes

Explore more

Same venueGLOBECOM '05. IEEE Global Telecommunications Conference, 2005.Same topicAdvanced Wireless Communication TechniquesFrench-language works237,207