Papers › Achievable Rate Optimization for MIMO Systems with Reconfigurable Intelligent Surfaces

Achievable Rate Optimization for MIMO Systems with Reconfigurable Intelligent Surfaces

21 Aug 2020arXiv:2008.09563links table onlyarchive 2025-07-28

Nemanja Stefan Perović, Le-Nam Tran, Marco Di Renzo, Mark F. Flanagan

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Reconfigurable intelligent surfaces (RISs) represent a radical new technology that can shape the radio wave propagation in wireless communication systems and offers a great variety of possible performance and implementation gains. Motivated by this, in this paper we study the achievable rate optimization for a multi-stream multiple-input multiple-output (MIMO) system equipped with an RIS, and formulate a joint optimization problem of the covariance matrix of the transmitted signal and the RIS elements. To solve this problem, we propose an iterative optimization algorithm that is based on the projected gradient method (PGM). We derive the step size that guarantees the convergence of the proposed algorithm and we define a backtracking line search to improve its convergence rate. Furthermore, we introduce the total free space path loss (FSPL) ratio of the indirect and direct links as a first-order measure of the applicability of an RIS in the considered communication system. Simulation results show that the proposed PGM achieves the same achievable rate as a state-of-the-art benchmark scheme, but with a significantly lower computational complexity. In addition, it is demonstrated that the RIS application is particularly suitable to increase the achievable rate in an indoor environment, as in this case even a small number of RIS elements is sufficient to provide a substantial achievable rate gain.

PaperPDFCode

Code

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections