MétaCan
Menu
Back to cohort
Record W2074311317 · doi:10.1109/iccnc.2013.6504072

Dual-hop AF systems with maximum end-to-end SNR relay selection over nakagami-m and rician fading links

2013· article· en· W2074311317 on OpenAlexaff
Samy S. Soliman, Norman C. Beaulieu

Bibliographic record

Venue2013 International Conference on Computing, Networking and Communications (ICNC) · 2013
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsRician fadingRelayNakagami distributionFadingCumulative distribution functionProbability density functionComputer scienceMaximal-ratio combiningSignal-to-noise ratio (imaging)Selection (genetic algorithm)Relay channelMathematicsTopology (electrical circuits)AlgorithmTelecommunicationsStatisticsChannel (broadcasting)Physics

Abstract

fetched live from OpenAlex

Novel, exact closed-form expressions are derived for the probability density function (PDF) and the cumulative distribution function (CDF) of the instantaneous end-to-end signal-to-noise ratio (SNR) of opportunistic dual-hop amplify-and-forward relaying systems with maximum end-to-end SNR relay selection. The derived expressions are used to find exact integral solutions for the ergodic capacity and the average symbol error probability as well as an exact explicit closed-form solution for the outage probability of the opportunistic AF system. The analysis is presented for the common channel fading distributions, Nakagami-m and Rician fadings, and for the cases of statistically identical fading links and statistically non-identical fading links. Examples show precise agreement between analytical results and simulation results. It is shown that the system performance is superior to AF relaying systems without relay selection. The maximum end-to-end SNR relay selection method provides diversity gain, proportional to the relay selection pool size, over AF relaying systems without relay selection.

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.001
metaresearch head score (Gemma)0.002
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.001
Threshold uncertainty score0.004

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
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.051
GPT teacher head0.289
Teacher spread0.238 · 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

Citations8
Published2013
Admission routes1
Has abstractyes

Explore more

Same venue2013 International Conference on Computing, Networking and Communications (ICNC)Same topicCooperative Communication and Network CodingFrench-language works237,207