MétaCan
Menu
Back to cohort
Record W2806013832 · doi:10.1109/lwc.2018.2844852

Compute-and-Forward for Uplink Non-Orthogonal Multiple Access

2018· article· en· W2806013832 on OpenAlexafffund
Cheng Guo, Abdelmalik Nasser Ali Aljalai, Chen Feng, Liqiang Zhao, Victor C. M. Leung, Rabab Ward

Bibliographic record

VenueIEEE Wireless Communications Letters · 2018
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Technologies
Canadian institutionsOkanagan University CollegeUniversity of British Columbia, Okanagan CampusUniversity of British Columbia
FundersHigher Education Discipline Innovation ProjectNatural Sciences and Engineering Research Council of CanadaNational Natural Science Foundation of China
KeywordsTelecommunications linkDecoding methodsSingle antenna interference cancellationNomaComputer scienceInterference (communication)Power (physics)Outage probabilityDe factoAlgorithmComputer networkFadingChannel (broadcasting)

Abstract

fetched live from OpenAlex

Successive interference cancellation (SIC) has been regarded as the de facto decoding method in the non-orthogonal multiple access (NOMA) system. However, SIC often requires the paired users to have significantly different received power levels for the uplink scenario. This is problematic in terms of fairness and outage probabilities when the paired users are close to each other. To address this challenge, we propose a new decoding method for uplink NOMA based on compute-and-forward. In particular, we show that our method achieves better fairness and smaller average outage probabilities while enjoying essentially the same complexity as SIC decoding.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.868
Threshold uncertainty score1.000

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.0010.001
Scholarly communication0.0000.000
Open science0.0030.001
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.033
GPT teacher head0.294
Teacher spread0.261 · 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.

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

Citations13
Published2018
Admission routes2
Has abstractyes

Explore more

Same venueIEEE Wireless Communications LettersSame topicAdvanced Wireless Communication TechnologiesFrench-language works237,207