MétaCan
Menu
Back to cohort
Record W2013869503 · doi:10.1109/wcnc.2010.5506440

Performance Bounds for AF Multi-Hop Relaying over Nakagami Fading

2010· article· en· W2013869503 on OpenAlexaff
Gayan Amarasuriya, Chintha Tellambura, Masoud Ardakani

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsIndependent and identically distributed random variablesNakagami distributionUpper and lower boundsFadingHop (telecommunications)Rayleigh fadingRelayMoment-generating functionMathematicsTopology (electrical circuits)Cumulative distribution functionAlgorithmHarmonic meanComputer scienceStatisticsTelecommunicationsProbability density functionCombinatoricsRandom variableMathematical analysisPhysicsDecoding methods

Abstract

fetched live from OpenAlex

This paper presents a new upper bound on the end-to- end signal-to-noise ratio (SNR) of channel-assisted amplify-and-forward (AF) multi-hop relay networks. The harmonic mean of the minimum of the first P ≥ 0 hop SNRs and the minimum of the remaining hop SNRs forms the new bound. Closed-form expressions are derived for the cumulative distribution function and the moment generating function of this SNR upper bound for independent and non-identically distributed Rayleigh, and independent and identically distributed Nakagami-m fading, where m is an integer. The outage probability and the average symbol error rate bounds are also derived. Our proposed bounds are compared against the existing bounds.

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 categoriesnone
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.916
Threshold uncertainty score0.396

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.000
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.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.049
GPT teacher head0.305
Teacher spread0.256 · 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.

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

Citations13
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207