Two-Timescale Design for Simultaneous Transmitting and Reflecting RIS-Assisted Massive MIMO Systems With Imperfect CSI
Bibliographic record
Abstract
This paper investigates the performance of simultaneous transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) assisted massive multiple-input multiple-output (MIMO) systems with Rician fading channels and channel estimation errors. We adopt the two-timescale scheme to design the systems, namely, applying the instantaneous channel state information (CSI) to design the base station (BS) beamforming and leveraging the statistical CSI to design the phase shifts of the STAR-RIS. Specifically, we estimate the overall channels based on the linear minimum mean-squared error (LMMSE) estimator and derive the closed-form expression of the average achievable rate. Based on the derived rate, we analyze the power scaling laws in which the transmit power is respectively reduced inversely proportional to the number of BS antennas and STAR-RIS elements. Besides, we draw insights from the comparison between STAR-RIS and conventional RIS under the same condition and the power scaling laws of STAR-RIS and optimize the phase shifts of the STAR-RIS to maximize the sum rate using an accelerated gradient ascent-based algorithm. Finally, numerical results are provided to validate our theoretical insights. In particular, we also compare the two-timescale scheme with the instantaneous CSI scheme in the simulation. We show that STAR-RIS outperforms conventional RIS, and the two-timescale-based scheme outperforms the instantaneous CSI-based scheme. Furthermore, we draw insight into this phenomenon.
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.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.000 | 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".