MétaCan
Menu
Back to cohort
Record W2119975703 · doi:10.1109/twc.2010.01.090432

Optimum/sub-optimum detectors for multi-branch dual-hop amplify-and-forward cooperative diversity networks with limited CSI

2010· article· en· W2119975703 on OpenAlexaff
Peng Liu, Il‐Min Kim

Bibliographic record

VenueIEEE Transactions on Wireless Communications · 2010
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsQueen's University
Fundersnot available
KeywordsChannel state informationDetectorComputer scienceHop (telecommunications)RelayDetection theoryAlgorithmDual (grammatical number)Diversity gainControl theory (sociology)Mathematical optimizationMathematicsTelecommunicationsWirelessFadingDecoding methodsArtificial intelligencePhysicsPower (physics)

Abstract

fetched live from OpenAlex

We study the optimum maximum-likelihood (ML) detection and sub-optimum detection for a multi-branch dual-hop cooperative diversity network with limited channel state information (CSI). Compared to the full CSI strategy, the signalling overhead at each relay involved with the limited CSI is reduced by 50%. We derive optimum ML detection with the limited CSI, which involves numerical integral evaluations. We also propose two closed-form sub-optimum detection rules of low complexity. It is shown that the first sub-optimum detection has almost identical performance to the optimum ML detection when Gaussianity in the added noise dominates, and the second sub-optimum detection has almost identical performance to the optimum ML detection when non-Gaussianity dominates. Finally, we propose a hybrid sub-optimum detection and demonstrate that its performance is almost identical to that of the optimum ML detection for general 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.

How this classification was reachedexpand

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 categoriesMeta-epidemiology (narrow), Science and technology studies
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.869
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.0040.001
Scholarly communication0.0000.001
Open science0.0020.000
Research integrity0.0000.001
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.049
GPT teacher head0.281
Teacher spread0.232 · 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 teacher head, not a consensus.

Study designSimulation or modeling
Domainnot available
GenreMethods

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

Citations13
Published2010
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Wireless CommunicationsSame topicCooperative Communication and Network CodingFrench-language works237,207