Rate-splitting multiple access (RSMA) uplink requires optimization of decoding order and power allocation, while decoding order is a discrete variable, and it is very complex to find the optimal decoding order if the number of users is large enough. This letter proposes a low-complexity user pairing-based resource allocation algorithm with the objective of minimizing the maximum latency, which significantly reduces the computational complexity and also achieves similar performance to unpaired uplink RSMA. A closed-form expression for power and bandwidth allocation is first derived, and then a bisection method is used to determine the optimal resource allocation. Finally, the proposed algorithm is compared with unpaired RSMA, paired NOMA and unpaired NOMA. The results demonstrate the effectiveness of the proposed algorithm.

翻译：速率分裂多址接入（RSMA）上行链路需优化解码顺序与功率分配，而解码顺序作为离散变量，在用户数量较大时寻找最优解码顺序的复杂度极高。本文提出一种基于用户配对的低复杂度资源分配算法，以最小化最大时延为目标，显著降低计算复杂度的同时实现了与未配对上行RSMA相近的性能。通过推导功率与带宽分配的闭合表达式，并采用二分法确定最优资源分配方案。最终将所提算法与未配对RSMA、配对NOMA及未配对NOMA进行对比，结果验证了算法的有效性。