MétaCan
Menu
Back to cohort

On the Ergodic Capacity of Amplify-and-Forward Relay Channels with Interference in Nakagami-m Fading

2013· article· en· W1999499117 on OpenAlexaff
Imène Trigui, Sofiène Affes, Alex Stéphenne

Bibliographic record

VenueIEEE Transactions on Communications · 2013
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsHuawei Technologies (Canada)
Fundersnot available
KeywordsNakagami distributionFadingErgodic theoryRelayInterference (communication)Computer scienceSignal-to-noise ratio (imaging)Topology (electrical circuits)Channel capacityElectronic engineeringChannel (broadcasting)Co-channel interferenceIndependent and identically distributed random variablesSingle antenna interference cancellationTelecommunicationsMathematicsPower (physics)EngineeringPhysicsElectrical engineeringRandom variableStatistics

Abstract

fetched live from OpenAlex

Integrating relaying techniques into cellular communications sheds new light on higher capacity and broader coverage. However, applying relaying techniques in practice has to take into account important issues such as co-channel interference (CCI). In this work, a generalized framework for the ergodic capacity analysis of dual-hop fixed-gain amplify and forward (AF) relaying systems in the presence of interference is presented. New expressions for the ergodic capacity are derived considering transmissions over independent but not necessarily identically distributed Nakagami-m fading channels in the presence of a finite number of co-channel interferers. Our results establish that the ergodic capacity is dominated by the source-relay interference power and that it improves slowly with the average signal-to-noise ratio (SNR) increasing. It slightly deteriorates, however, with a larger Nakagami-m fading parameter for interference channels. Furthermore, our results offer an analytical insight into the key impact of relay placement on performance. Our new ergodic capacity expressions could therefore provide a very practical/low-cost performance optimization tool for relayed-communication system designers.

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.010
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.005
Threshold uncertainty score0.016

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.010
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.002
Scholarly communication0.0010.002
Open science0.0010.001
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.064
GPT teacher head0.267
Teacher spread0.203 · 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

Citations23
Published2013
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on CommunicationsSame topicCooperative Communication and Network CodingFrench-language works237,207