Spectrally-Efficient Beamforming Design for STAR-RIS-Aided URLLC NOMA Systems
Bibliographic record
Abstract
Next-generation wireless applications are expected to enable extended ultra-reliable low-latency communication (URLLC) to support high data rates along with ultra-reliability and low-latency features beyond the capabilities of existing core services. There is a need to transition from conventional architectures to more efficient and robust multiple-access schemes to meet these consolidated requirements in resource-constrained systems. This study explores the utilization of simultaneous transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) in non-orthogonal multiple access (NOMA) systems to enable spectrally efficient URLLC, even under the imperfect channel state information. In particular, we focus on maximizing spectral efficiency by jointly designing robust beamforming at the base station and STAR-RIS subject to given URLLC requirements. Due to the non-convexity of the formulated problem, we propose an alternating optimization framework that obtains sub-optimal solutions to the problems of beamforming design at the BS and STAR-RIS, respectively by exploiting$\mathcal {S}-$procedure and successive convex approximation. Simulation results confirm that the STAR-RIS-NOMA system can significantly boost the spectral efficiency by 10-15% compared to conventional reflecting-only RIS while guaranteeing the strict URLLC requirements. Specifically, among all the possible modes of STAR-RIS, the time-splitting mode provides better spectral efficiency than other modes owing to its better interference management.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 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.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".