这份文本探讨了在短分组通信中,上行速率分裂多址(RSMA)实现最大最小公平性(MMF)的性能。文章提出了一种基于逐次凸逼近(SCA)的方法来优化传输功率分配,以在有限码长(FBL)约束下最大化用户之间的最小速率。作者还引入了一种低复杂度的接收端解码顺序设计方案。数值结果表明,与传统的非正交多址(NOMA)和干扰视为噪声(TIN)方案相比,RSMA在MMF方面表现出卓越的性能,尤其是在增加分裂用户数量和码长时。研究强调,即使只分裂一个用户,FBL RSMA也能超越无限码长(IFBL)NOMA的性能,并且在不同信噪比和用户数量下都保持优势。
Max-Min Fairness for Uplink Rate-Splitting Multiple Access With Finite Blocklength
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 an uplink Single-Input Single-Output (SISO) channel, 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.
Published in: IEEE Transactions on Vehicular Technology ( Volume: 74, Issue: 5, May 2025)
Page(s): 8437 - 8441
Date of Publication: 13 January 2025
ISSN Information:
Print ISSN: 0018-9545
Electronic ISSN: 1939-9359
Publisher: IEEE
Funding Agency:
10.13039/501100001809-National Natural Science Foundation of China (Grant Number: 62201347)
Shanghai Sailing Program (Grant Number: 22YF1428400)
