这些来源主要介绍了一种新颖的资源优化算法,名为外梯度-分数规划 (EG-FP) 算法,旨在解决速率分裂多址 (RSMA) 系统中的最大最小公平性 (MMF) 问题。该算法通过将复杂问题转化为一系列可解的子问题来提高计算效率,并引入了一种低维度的变体,特别适用于大规模多输入单输出 (MISO) 系统。此外,该研究还将这些方法扩展到不完善信道状态信息 (CSIT) 的场景。数值结果表明,EG-FP 算法在实现与现有技术相当的MMF速率的同时,显著降低了计算时间,展现了其在下一代无线通信网络中的应用潜力。
An Efficient Max-Min Fair Resource Optimization Algorithm for Rate-Splitting Multiple Access
Abstract:
The max-min fairness (MMF) problem in rate-splitting multiple access (RSMA) is known to be challenging due to its non-convex and non-smooth nature, as well as the coupled beamforming and common rate variables. Conventional algorithms to address this problem often incur high computational complexity or degraded MMF rate performance. To address these challenges, in this work, we propose a novel optimization algorithm named extragradient-fractional programming (EG-FP) to address the MMF problem of downlink RSMA. The proposed algorithm first leverages FP to transform the original problem into a block-wise convex problem. For the subproblem of precoding block, we show that its Lagrangian dual is equivalent to a variational inequality problem, which is then solved using an extragradient-based algorithm. Additionally, we discover the optimal beamforming structure of the problem and based on which, we introduce a low-dimensional EG-FP algorithm with computational complexity independent of the number of transmit antennas. This feature is especially beneficial in scenarios with a large number of transmit antennas. The proposed algorithms are then extended to handle imperfect channel state information at the transmitter (CSIT). Numerical results demonstrate that the MMF rate achieved by our proposed algorithms closely matches that of the conventional successive convex approximation (SCA) algorithm and significantly outperforms other baseline schemes. Remarkably, the average CPU time of the proposed algorithms is less than 10% of the runtime required by the SCA algorithm, showing the efficiency and scalability of the proposed algorithms.
Published in: IEEE Transactions on Wireless Communications ( Early Access )
Page(s): 1 - 1
Date of Publication: 14 July 2025
ISSN Information:
Print ISSN: 1536-1276
Electronic ISSN: 1558-2248
Publisher: IEEE
