MétaCan
Menu
← Back to cohort
Record W2169167200 · doi:10.1109/icc.2011.5963232

New Performance Approximations for Multi-Hop Fixed-Gain AF Relay Networks

2011· article· en· W2169167200 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
KeywordsNakagami distributionRelayMoment-generating functionCoding gainDiversity gainCumulative distribution functionFadingHop (telecommunications)MathematicsIndependent and identically distributed random variablesApplied mathematicsComputer scienceProbability density functionOutage probabilitySignal-to-noise ratio (imaging)AlgorithmTopology (electrical circuits)Control theory (sociology)Mathematical optimizationStatisticsRandom variableTelecommunicationsDecoding methodsCombinatorics

Abstract

fetched live from OpenAlex

A novel approximation for the end-to-end signal-to-noise ratio (e2e SNR) of multi-hop (N≥2) fixed-gain amplify-and-forward (FG-AF) relay networks over independent and non-identically distributed Nakagami-m fading channels is proposed. Two types of FG-AF relays; (i) blind-AF, and (ii) semi-blind-AF are treated. The cumulative distribution and the moment generating function of the proposed e2e SNR approximation are derived in closed-form and used to derive the outage probability, the average symbol error rate, and the generalized SNR moments. The resulting performance metrics for the blind-AF relay case are asymptotically exact and thus, the asymptotic outage probability, the asymptotic average SER, the diversity order, and the coding gain are derived. Numerical and simulation results are presented to verify the comparative performance against the exact performance metrics and existing bounds. Our results reveal that the proposed performance approximations outperform the existing bounds in most of the 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 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.003
metaresearch head score (Gemma)0.015
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: none
Teacher disagreement score0.003
Threshold uncertainty score0.018

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.015
Meta-epidemiology (narrow)0.0020.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0020.003
Open science0.0020.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0020.001

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.114
GPT teacher head0.292
Teacher spread0.178 · 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
Published2011
Admission routes1
Has abstractyes

Explore more

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