MétaCan
Menu
Back to cohort
Record W2155171138 · doi:10.1109/wcnc.2011.5779395

Multiuser Amplify-and-Forward relaying with delayed feedback in Nakagami-m fading

2011· article· en· W2155171138 on OpenAlexaff
Madushanka Soysa, Himal A. Suraweera, Chintha Tellambura, Hari Krishna Garg

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsFadingNakagami distributionChannel state informationBit error rateChannel (broadcasting)Computer scienceRelaySignal-to-noise ratio (imaging)AlgorithmDegradation (telecommunications)MathematicsStatisticsTopology (electrical circuits)Electronic engineeringTelecommunicationsWirelessEngineeringPhysicsPower (physics)

Abstract

fetched live from OpenAlex

This paper evaluates the impact of using outdated channel estimates in a multiuser Amplify-and-Forward (AF) relay network, under Nakagami-m fading. Both variable gain AF and fixed gain AF schemes are considered. Expressions for the system's outage probability and the average bit error rate (BER) are derived. Since the expressions are barely tractable, we also present approximations for the high signal-to-noise ratio (SNR) regime. By doing so we characterize the impact of network parameters such as the number of relays, correlation between the delayed and current channel state information, chosen user rank and SNR imbalance on the performance degradation.

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.002
metaresearch head score (Gemma)0.009
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.003
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.009
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.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.055
GPT teacher head0.256
Teacher spread0.201 · 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

Citations8
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207