MétaCan
Menu
Back to cohort
Record W2000817821 · doi:10.1109/icc.2010.5501930

A Generalized Switching Policy for Incremental Relaying with Adaptive Modulation

2010· article· en· W2000817821 on OpenAlexaff
Essam Saleh Altubaishi, Xuemin Shen

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsSpectral efficiencyRayleigh fadingComputer scienceTransmission (telecommunications)Bit error rateLink adaptationFadingModulation (music)Reduction (mathematics)Diversity combiningWirelessElectronic engineeringTopology (electrical circuits)TelecommunicationsMathematicsChannel (broadcasting)EngineeringPhysics

Abstract

fetched live from OpenAlex

In this paper, we consider how to improve the capacity of wireless communication networks that employ cooperative diversity techniques. For Amplify and Forward (AF) fixed relaying scheme with adaptive modulation, it has been shown that the scheme can increase transmit diversity but with the expense of a reduction in the spectral efficiency. An efficient Generalized Switching Policy (GSP) for AF incremental relaying with adaptive modulation is proposed to maximize the average spectral efficiency while maintaining the target Bit Error Rate (BER). The performance of the GSP over independent nonidentical Rayleigh fading channels is derived in terms of average spectral efficiency, average BER, and outage probability, then verified by using Monte Carlo simulation. It is shown that the GSP not only outperforms both the conventional direct transmission and the AF fixed relaying but also the Outage Switching Policy (OSP) of the AF incremental relaying proposed recently.

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: Methods · Consensus signal: none
Teacher disagreement score0.989
Threshold uncertainty score0.263

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.0000.000
Scholarly communication0.0000.000
Open science0.0000.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.042
GPT teacher head0.299
Teacher spread0.257 · 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
GenreMethods

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

Citations9
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207