WMMSE resource allocation for FD-NOMA
Andrea Abrardo, Marco Moretti, Fabio Saggese

TL;DR
This paper introduces an iterative WMMSE-based power allocation algorithm for FD-NOMA systems, effectively managing interference and reducing computational complexity while achieving near-optimal performance.
Contribution
It proposes a novel WMMSE-based iterative algorithm for resource allocation in FD-NOMA, addressing computational complexity and interference challenges.
Findings
Lowest complexity among compared algorithms
Converges to a feasible solution
Performance close to theoretical optimum
Abstract
Power and channel allocation in interference-limited systems is a key enabler for beyond 5G (B5G) technologies, such as multi-carrier full duplex non-orthogonal multiple access (FD-NOMA). In FD-NOMA systems power allocation is a very computationally intense non-convex problem due to the presence of strong interference and the integrality condition on channel allocation. In this paper, we propose an iterative power allocation algorithm based on the minimization of the weighted mean square error, which converges to a feasible allocation of the original problem. Experimental results show that the proposed algorithm has by far the lowest complexity among other state-of-the-art solutions. Moreover, they assess the validity of our approach showing performance close to the theoretical optimum.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Wireless Communication Technologies · Sparse and Compressive Sensing Techniques · PAPR reduction in OFDM
