Full-Duplex Non-Orthogonal Multiple Access in Cooperative Relay Sharing for 5G Systems
Bibliographic record
Abstract
In this paper, a full-duplex (FD) non-orthogonal multiple access (NOMA) scheme for a cooperative relay sharing network (termed as FD-NOMA-RS) is presented, in which two source-destination pairs share a dedicated FD relay FD-R. Following the principle of uplink NOMA, both sources transmit their symbols to FD-R, forming a NOMA pair, by depending on their channel conditions with respect to FD-R. The FD-R then decodes these symbols and simultaneously transmits a superimposed composite signal to the destinations with a processing delay τ according to the principle of downlink NOMA. The ergodic sum capacity, outage probability and outage sum capacity of FD-NOMA-RS are investigated comprehensively along with analytical derivations, considering both perfect and imperfect interference cancellation. A simulation is conducted to corroborate the correctness of the analysis presented here. Moreover, the effectiveness of FD-NOMA-RS is demonstrated through analysis and simulation and then compared with that of its counterpart, the half-duplex 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 machine prediction
Teacher imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".