Low-complexity Resource Allocation for Uplink RSMA in Future 6G Wireless Networks

TL;DR

This paper introduces a low-complexity user pairing-based resource allocation algorithm for uplink RSMA in 6G networks, optimizing latency with reduced computational complexity.

Contribution

It proposes a novel user pairing algorithm with closed-form power and bandwidth allocation, and uses a bisection method to minimize latency efficiently.

Findings

Outperforms NOMA in latency minimization.

Achieves similar performance to unpaired RSMA.

Significantly reduces computational complexity.

Abstract

Uplink rate-splitting multiple access (RSMA) 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. Closed-form expressions for power and bandwidth allocation for a given latency are first derived. Then a bisection method is used to determine the minimum latency and optimal resource allocation. Finally, the proposed algorithm is compared with unpaired RSMA using an exhaustive method to obtain the optimal decoding order, unpaired RSMA using a suboptimal decoding order, paired non-orthogonal multiple access (NOMA) and unpaired NOMA. The results show that our proposed algorithm outperforms NOMA and achieves similar performance to unpaired RSMA. In addition, the complexity of the proposed algorithm is significantly reduced.