Robust Energy-Efficient Design for MISO Non-Orthogonal Multiple Access Systems
Bibliographic record
Abstract
Non-orthogonal multiple access (NOMA) has been envisioned as a promising multiple access technique for 5G and beyond wireless networks due to its significant enhancement of spectral efficiency. In this paper, we investigate a robust energy efficiency design for multi-user multiple-input single-output (MISO) NOMA systems, where the imperfect channel state information is available at the base station (BS). A clustering algorithm is applied to group the users into different clusters, and then, the NOMA technique is employed to share the available resources fairly among the users in each cluster. To remove the interference between clusters, two different types of zero-forcing (ZF) designs, namely, hybrid-ZF and full-ZF, are employed at the BS. The full-ZF scheme completely removes the interference leakage at the cost of more number of antennas, and the hybrid-ZF scheme partially mitigates the interference leakage. To solve the problem, Dinkelbach’s algorithm is employed to convert the non-linear fractional programming problem into a simple subtractive form. Finally, simulation results reveal that hybrid-ZF outperforms the full-ZF scheme with a few clusters, while full-ZF shows a better performance with higher number of clusters. Numerical results confirm that our proposed robust scheme outperforms the non-robust scheme in terms of the rate-satisfaction ratio at each user.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| 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.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".