RIS-Aided Cell-Free Massive MIMO System: Joint Design of Transmit Beamforming and Phase Shifts
Bibliographic record
Abstract
This article studies a reconfigurable intelligent surface (RIS)-aided cell-free massive multiple-input multiple-output system and formulate the max–min fairness problem that maximizes the minimum achievable rate among all the users by jointly optimizing the transmit beamforming at access points and the phase shifts at RISs. To address such a challenging problem, we first study the special single-user scenario and propose an algorithm that can transform the optimization problem into a semidefinite program (SDP) or an integer linear program for the cases of continuous or discrete phase shifts, respectively. Then, in order to solve the optimization problem for the multiuser scenario with continuous phase shifts, we propose an alternating optimization algorithm, which can alternately transform the problem into a second-order-cone program and an SDP. Finally, for the multiuser scenario with discrete phase shifts, we design a zero-forcing-based successive refinement algorithm, which can find the suboptimal transmit beamforming and phase shifts by means of alternating optimization. Numerical results show that compared with the benchmark schemes of random phase shifts and without using the RIS, the proposed algorithms can significantly increase the minimum achievable rate. It is also demonstrated that, compared with the case of programming continuous phase shifts, using 2-bit discrete phase shifts can practically achieve the same performance.
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.000 | 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.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".