Semi-Blind Interference Aligned NOMA for Downlink MU-MISO Systems
Bibliographic record
Abstract
The application of non-orthogonal multiple access (NOMA) to downlink multi-user multiple-input single-output systems involves the design of a beamforming strategy in which the spatial dimension provided by each beam is shared among several users performing NOMA. This approach requires the management of both inter-cluster and intra-cluster interference. Moreover, the beamforming design is subject to instantaneous knowledge of the channel state information at the transmitter (CSIT). We propose a novel transmission scheme that combines blind interference alignment and NOMA. The proposed scheme fully cancels the inter-cluster interference for all users without the need for instantaneous CSIT, which is limited to the knowledge of the large scale effects of the channel in order to implement NOMA within each cluster. Considering user pairing, i.e., each cluster is composed of two users, we derive a method for determining the NOMA power coefficients that maximize the sum-rate, the user fairness or satisfy first the rate of a specific user by simply solving a polynomial function. Furthermore, we propose an alternative methodology based on some approximations in order to provide sub-optimal closed-form expressions of these NOMA power coefficients. Simulation results show that the proposed scheme outperforms conventional MISO-NOMA taking into consideration the costs of providing CSIT.
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.001 |
| Science and technology studies | 0.001 | 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.001 | 0.001 |
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".