Power Minimization Under Quality of Service Constraints for MIMO Systems With a RIS-Based Transmitter
Bibliographic record
Abstract
This study investigates a virtual multiuser multiple-input multiple-output (MU-MIMO) system with PSK modulation, realized with a reconfigurable intelligent surface (RIS)-based transmitter. The study focuses on minimizing transmit power under quality-of-service (QoS) constraints while addressing the associated computational complexity. A discrete phase-shift RIS model is considered, and the power minimization problem is formulated in two scenarios. First, for QPSK user data, the symbol-error probability (SEP) is adopted as the QoS criterion. Second, for general <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</i>-PSK modulation, the union-bound SEP (UBSEP) is used to define the QoS constraints. Based on the considered formulations, a partial branch-and-bound (PBB) approach is developed, which improves on full branch-and-bound (FBB) methods in the sense of allowing for favorable complexity performance trade-offs. For the special case of high-resolution RIS, the discrete phase-shift set is approximated by its continuous counterpart, enabling the reformulation of the original problems as constrained optimizations on an oblique manifold, which are solved with reduced computational complexity with the proposed bisection method. Numerical results demonstrate the effectiveness of the proposed approaches in minimizing the transmit power for different SEP requirements and showcase the balance between power efficiency and computational complexity.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".