Papers › Low-Complexity Sum-Capacity Maximization for Intelligent Reflecting Surface-Aided MIMO Systems
Low-Complexity Sum-Capacity Maximization for Intelligent Reflecting Surface-Aided MIMO Systems
Ahmad Sirojuddin, Dony Darmawan Putra, Wan-Jen Huang
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.
Reducing computational complexity is crucial in optimizing the phase shifts of Intelligent Reflecting Surface (IRS) systems since IRS-assisted communication systems are generally deployed with a large number of reflecting elements (REs). This letter proposes a low-complexity algorithm, designated as Dimension-wise Sinusoidal Maximization (DSM), to obtain the optimal IRS phase shifts that maximize the sum capacity of a MIMO network. The algorithm exploits the fact that the objective function for the optimization problem is sinusoidal w.r.t. the phase shift of each RE. The numerical results show that DSM achieves a near-maximal sum rate and faster convergence speed than two other benchmark methods.
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