MétaCan
Menu
Back to cohort

Iterative Water-Filling Power and Subcarrier Allocation for Multicarrier Non-Orthogonal Multiple Access Uplink

2022· article· en· W4289655427 on OpenAlexaff
Chin Choy Chai, Xiao–Ping Zhang

Bibliographic record

Venue2022 IEEE International Symposium on Information Theory (ISIT) · 2022
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Technologies
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsSubcarrierTelecommunications linkNomaMathematical optimizationComputer scienceIterative methodConvergence (economics)Power (physics)Orthogonal frequency-division multiplexingPower controlMathematicsTelecommunicationsChannel (broadcasting)

Abstract

fetched live from OpenAlex

Novel closed form formulae of iterative optimal power control and allocation, and a criterion for optimal subcarrier allocation, are derived for uplink of multicarrier non-orthogonal multiple access (MC-NOMA) systems. Our new formulae provide intuitive insights on how to optimally allocate subcarriers and power to MC-NOMA (and as a special case, MC-OMA) users. In particular, the novel water-filling power allocation formulae provide a mean to iteratively compute optimal power allocation for a general NOMA cluster size. Convergence of the iterative algorithm and sum rate performance of MC-NOMA system are presented and compared with MC-OMA system.

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.001
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.565
Threshold uncertainty score0.976

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.002
Open science0.0010.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.010
GPT teacher head0.254
Teacher spread0.244 · 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
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
Published2022
Admission routes1
Has abstractyes

Explore more

Same venue2022 IEEE International Symposium on Information Theory (ISIT)Same topicAdvanced Wireless Communication TechnologiesFrench-language works237,207