Closed-form solution for the max-min fairness problem in non-orthogonal multiple access systems
Shiyong Yang, Shiwen Mao, Bin Tan
International Journal of Cognitive Computing in Engineering · 2021
doi:10.1016/j.ijcce.2021.11.001 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Non-orthogonal multiple access (NOMA) can improve both the spectrum efficiency and the number of users in wireless communication systems. In the downlink of NOMA, the base station superimposes multiple data flows in the power domain and the users decode the information using successive interference cancellation SIC. The performance of downlink NOMA systems is highly dependent on the power allocation scheme for all users. This paper investigates the max-min fairness problem that maximizes the minimum achievable user rate, aiming to ensure fairness for all users in downlink NOMA systems. Although the max-min fairness problem in downlink NOMA systems is non-convex, we obtain its closed-form optimal solution in this paper. This result will be useful for the analysis and design of future NOMA systems. Numerical results validate the correctness and effectiveness of our closed-form optimal solution.
Abstract licence: CC BY-NC-ND
References12
12 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.