TY - JOUR
T1 - Exact BER Analysis of NOMA with Arbitrary Number of Users and Modulation Orders
AU - Yahya, Hamad
AU - Alsusa, Emad
AU - Al-Dweik, Arafat
N1 - Funding Information:
Manuscript received November 12, 2020; revised March 28, 2021 and May 28, 2021; accepted June 3, 2021. Date of publication June 11, 2021; date of current version September 16, 2021. The work of Arafat Al-Dweik was supported by Khalifa University Competitive Internal Research Award, grant number CIRA 2056. The associate editor coordinating the review of this article and approving it for publication was X. Lei. (Corresponding author: Hamad Yahya.) Hamad Yahya and Emad Alsusa are with the Department of Electrical and Electronic Engineering, The University of Manchester, Manchester M13 9PL, U.K. (e-mail: [email protected]; [email protected]).
Publisher Copyright:
© 1972-2012 IEEE.
PY - 2021/9
Y1 - 2021/9
N2 - Non-orthogonal multiple access (NOMA) is a promising candidate for future mobile networks as it enables improved spectral-efficiency, massive connectivity and low latency. This paper derives exact and asymptotic bit error rate (BER) expressions under Rayleigh fading channels for NOMA systems with arbitrary number of users and arbitrary number of receiving antennas and modulation orders, including binary phase-shift keying and rectangular/square quadrature amplitude modulation. Furthermore, the power coefficients' bounds, which ensure users' fairness, and solve the constellation ambiguity problem, are derived for N=2 and 3 users cases with any modulation orders. In addition, this paper determines the optimal power assignment that minimizes the system's average BER. These results provide valuable insight into the system's BER performance and power assignment granularity. For instance, it is shown that the feasible power coefficients range becomes significantly small as the modulation order, or N , increases, where the BER performance degrades due to the increased inter-user interference. Hence, the derived expressions can be crucial for the system scheduler in allowing it to make accurate decisions of selecting appropriate N , modulation orders, and power coefficients to satisfy the users' requirements. The presented expressions are corroborated via Monte Carlo simulations.
AB - Non-orthogonal multiple access (NOMA) is a promising candidate for future mobile networks as it enables improved spectral-efficiency, massive connectivity and low latency. This paper derives exact and asymptotic bit error rate (BER) expressions under Rayleigh fading channels for NOMA systems with arbitrary number of users and arbitrary number of receiving antennas and modulation orders, including binary phase-shift keying and rectangular/square quadrature amplitude modulation. Furthermore, the power coefficients' bounds, which ensure users' fairness, and solve the constellation ambiguity problem, are derived for N=2 and 3 users cases with any modulation orders. In addition, this paper determines the optimal power assignment that minimizes the system's average BER. These results provide valuable insight into the system's BER performance and power assignment granularity. For instance, it is shown that the feasible power coefficients range becomes significantly small as the modulation order, or N , increases, where the BER performance degrades due to the increased inter-user interference. Hence, the derived expressions can be crucial for the system scheduler in allowing it to make accurate decisions of selecting appropriate N , modulation orders, and power coefficients to satisfy the users' requirements. The presented expressions are corroborated via Monte Carlo simulations.
KW - arbitrary modulation orders
KW - arbitrary number of users
KW - bit error rate (BER)
KW - Non-orthogonal multiple access (NOMA)
KW - quadrature amplitude modulation (QAM)
UR - http://www.scopus.com/inward/record.url?scp=85111028039&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2021.3088526
DO - 10.1109/TCOMM.2021.3088526
M3 - Article
AN - SCOPUS:85111028039
SN - 0090-6778
VL - 69
SP - 6330
EP - 6344
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 9
ER -