MétaCan
Menu
Back to cohort

Performance of Non-Symmetric Relaying Networks in the Presence of Interferers with Unequal Powers

2012· article· en· W1989607297 on OpenAlexaff
Amir H. Forghani, Salama Ikki, Sonia Aı̈ssa

Bibliographic record

VenueIEEE Wireless Communications Letters · 2012
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsInstitut National de la Recherche ScientifiqueUniversité du Québec à Montréal
Fundersnot available
KeywordsRayleigh fadingUpper and lower boundsComputer scienceTopology (electrical circuits)Moment-generating functionMonte Carlo methodFadingInterference (communication)Applied mathematicsAlgorithmMathematicsTelecommunicationsStatisticsProbability density functionCombinatoricsDecoding methodsMathematical analysisChannel (broadcasting)

Abstract

fetched live from OpenAlex

The performance of non-symmetric multiple-hop multiple-branch relaying networks using amplify-and-forward (AF) protocol and operating in practical environments with unequal-power interferers, is examined. Assuming the channels, for both the desired and the interfering signals, to experience Rayleigh fading, first, exact and upper-bound expressions for the end-to-end signal-to-interference-plus-noise ratio (SINR) are derived. Then, the moment generating function of the upper-bound end-to-end SINR is obtained. According to the latter, the error and outage probabilities are assessed in closed form. Further, simple and general asymptotic expressions for the error and outage probabilities, which explicitly show the coding and the diversity gains, are derived and discussed. Finally, the analysis is validated by comparing the corresponding numerical results with Monte Carlo simulations, sustained by insightful discussions.

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.011
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.016

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.011
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0010.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.037
GPT teacher head0.273
Teacher spread0.236 · 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

Citations4
Published2012
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Wireless Communications LettersSame topicCooperative Communication and Network CodingFrench-language works237,207