MétaCan
Menu
Back to cohort
Record W2151544711 · doi:10.1109/twc.2009.080818

On the ergodic capacity of multi-hop wireless relaying systems

2009· article· en· W2151544711 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 Transactions on Wireless Communications · 2009
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsErgodic theoryComputer scienceHop (telecommunications)Upper and lower boundsRayleigh fadingFadingTopology (electrical circuits)WirelessChannel capacityTransmission (telecommunications)ErgodicityTelecommunicationsChannel (broadcasting)MathematicsMathematical analysisStatisticsCombinatorics

Abstract

fetched live from OpenAlex

The ergodic capacity in Rayleigh fading of multi- hop wireless transmission systems employing either amplify- and-forward relaying or decode-and-forward relaying is studied, assuming channel state information is only known at the receiving terminals. Two upper bounds based on Jensen's inequality and the harmonic-geometric means inequality as well as an infinite series representation for the ergodic capacity of an amplify-and- forward multi-hop transmission system are derived. Numerical results are provided to examine the tightness of the upper bounds as well as to show the high accuracy of the infinite series approach. In addition, the ergodic capacity of a decode- and-forward multi-hop transmission system is obtained. It is shown that multi-hop transmission systems employing a decode- and-forward relaying scheme achieve higher ergodic capacities than multi-hop transmission systems with amplify-and-forward relaying schemes.

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 categoriesScience and technology studies
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.955
Threshold uncertainty score1.000

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.0010.000
Scholarly communication0.0000.000
Open science0.0040.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.081
GPT teacher head0.292
Teacher spread0.210 · 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