Performance of Multi-RIS-Aided Cell-Free Massive MIMO: Do More RISs Always Help?
Bibliographic record
Abstract
Cell free (CF) massive multiple-input multiple-output (mMIMO) is a promising technology in realizing beyond fifth generation (B5G) networks. Massive deployment of access points (APs) in a CF-mMIMO system increases the spectral efficiency, however it also increases the energy consumption and fronthaul requirements. Since recently reconfigurable intelligent surface (RIS) is shown to be a cost-effective solution to improve performance of wireless networks, RIS can be a promising technology to enhance the performance of CF-mMIMO systems. In this work, we study the downlink (DL) performance of CF-mMIMO system aided by multiple RISs, while considering correlated Rician fading channels, discrete RIS phase-shifts and low-complexity channel estimation (CE) protocol. Given the obtained imperfect channel state information (CSI), we derive lower bounds on the rates achieved using conjugate beamforming (CB) and zero-forcing (ZF) precoders. The obtained bounds depend on channel statistics, RIS phase-shifts and number of RIS elements. To optimize the performance with respect to RIS phase-shifts, we formulate a maximization problem and propose a sub-optimal genetic algorithm (GA)-based solution. Through simulations, we demonstrate that distributed RIS deployment outperforms centralized RIS deployment in terms of DL throughput. Interestingly, we demonstrate that the DL throughput improves as number of RISs increases until an optimal number of distributed RISs over which the DL performance of the system starts to drop. We discuss this effect under varying the number of APs and RISs. We extend the analysis by considering different precoders, CE and RIS optimization schemes, and verify the accuracy of our derived analytical results by Monte-Carlo simulations.
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.003 |
| 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".