Weighted Sum-Rate Maximization for Large-Scale RIS-Assisted Multi-User MISO Systems

We present a low-complexity algorithm for jointly designing active and passive beamforming to maximize the weighted sum-rate (WSR) in downlink RIS-assisted communication systems. We exploit an equivalent, lower-dimensional reformulation of the WSR maximization problem to derive a closed-form solution for active beamforming optimization using the successive convex approximation (SCA) framework. For passive beamforming, we propose a scaled projected gradient method (SPGM) algorithm and a novel line search technique to improve performance. Notably, we demonstrate that the complexity of the proposed method scales linearly with the number of BS antennas and RIS reflective elements. Extensive numerical experiments demonstrate that our proposed algorithm significantly reduces both run time and computational complexity, while enhancing WSR performance over known benchmarks.

Authors

Institutions

Publication Details

Published
2025-03-24
DOI
https://doi.org/10.1109/wcnc61545.2025.10978181
Citations
1
Primary Topic
IoT and Edge/Fog Computing
Type
article
Field-Weighted Citation Impact
1.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Weighted Sum-Rate Maximization for Large-Scale RIS-Assisted Multi-User MISO Systems

Le‐Nam Tran, Eduard E. Bahingayi, Nemanja Stefan Perović
1 citations
IoT and Edge/Fog Computing
1.49
article

Weighted Sum-Rate Maximization for Large-Scale RIS-Assisted Multi-User MISO Systems

Le‐Nam Tran, Eduard E. Bahingayi, Nemanja Stefan Perović
article en
1 citations

Abstract

We present a low-complexity algorithm for jointly designing active and passive beamforming to maximize the weighted sum-rate (WSR) in downlink RIS-assisted communication systems. We exploit an equivalent, lower-dimensional reformulation of the WSR maximization problem to derive a closed-form solution for active beamforming optimization using the successive convex approximation (SCA) framework. For passive beamforming, we propose a scaled projected gradient method (SPGM) algorithm and a novel line search technique to improve performance. Notably, we demonstrate that the complexity of the proposed method scales linearly with the number of BS antennas and RIS reflective elements. Extensive numerical experiments demonstrate that our proposed algorithm significantly reduces both run time and computational complexity, while enhancing WSR performance over known benchmarks.

University College Dublin (IE), Université Paris-Saclay (FR)
Openalex Percentile: Top 17%
IoT and Edge/Fog Computing
1.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.