MétaCan
Menu
← Back to cohort
Record W1976739756 · doi:10.1109/bsc.2010.5472953

Capacity of selection cooperation with channel estimation errors

2010· article· en· W1976739756 on OpenAlexaff
Mehdi Seyfi, Sami Muhaidat, Jie Liang

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsSimon Fraser University
FundersMedical Research Council
KeywordsRelayChannel (broadcasting)Selection (genetic algorithm)FadingSignal-to-noise ratio (imaging)Upper and lower boundsComputer scienceChannel capacityAlgorithmOutage probabilityRelay channelNoise (video)TelecommunicationsMathematicsPower (physics)Artificial intelligencePhysics

Abstract

fetched live from OpenAlex

In this paper, we investigate the performance of selection cooperation in the presence of channel estimation errors. In particular, we consider a cooperative scenario with multiple relays and amplify-and-forward protocol over frequency flat fading channels. In the selection scheme, only the “best” relay which maximizes the effective signal-to-noise ratio (SNR) at the receiver end is selected. We present an upper bound on the effective SNR and derive closed-form expressions for the average capacity in the presence of channel estimation error. A simulation study is presented to corroborate the analytical results.

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.005
metaresearch head score (Gemma)0.022
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.005
Threshold uncertainty score0.027

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.022
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.001
Science and technology studies0.0010.003
Scholarly communication0.0020.002
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.032
GPT teacher head0.261
Teacher spread0.229 · 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 designSimulation or modeling
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

Citations1
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network Coding→French-language works237,207→