Max-Min Fairness for Uplink Rate-Splitting Multiple Access with Finite Blocklength
Jiawei Xu, Yijie Mao
TL;DR
The paper addresses max-min fairness for uplink RSMA in a $K$-user SISO MAC under finite blocklength constraints. It proposes a general RSMA model with selective message splitting, a low-complexity decoding order, and a successive convex approximation based power-allocation algorithm to maximize the minimum user rate under FBL. Key contributions include a convexified optimization framework with convergence guarantees and complexity analysis, plus a comprehensive numerical study showing RSMA yields higher MMF than NOMA and can even surpass IFBL NOMA as the number of splitting users grows. The results highlight RSMA's potential to improve fairness and latency performance in URLLC uplink scenarios, albeit with increased hardware and computational demands as splitting complexity rises.
Abstract
In this letter, we investigate the performance of Max Minimum Fairness (MMF) for uplink Rate-Splitting Multiple Access (RSMA) in short-packet communications. Specifically, considering a Single-Input Single-Output (SISO) Multiple Access Channel (MAC), we optimize the transmit power allocation between the splitting user messages to maximize the minimum rate among users with Finite Blocklength (FBL) constraints. To tackle this problem, we propose a Successive Convex Approximation (SCA)-based approach. Additionally, we introduce a low-complexity scheme to design the decoding order at the receiver. Numerical results show that RSMA outperforms conventional transmission schemes such as Non-orthogonal Multiple Access (NOMA) in terms of MMF.
