TY - JOUR
T1 - Joint User Pairing and Power Allocation with Compressive Sensing in NOMA Systems
AU - Nasser, Ahmed
AU - Muta, Osamu
AU - Gacanin, Haris
AU - Elsabrouty, Maha
N1 - Funding Information:
Manuscript received June 28, 2020; accepted September 6, 2020. Date of publication September 11, 2020; date of current version January 8, 2021. This work was supported in part by the Support Center for Advanced Telecommunications Technology Research Foundation, JSPS KAKENHI under Grant JP17K06427, and in part by the Research Project “SuperHETs, Empowering 5G HetNets for Better Performance” Funded by NTRA Egypt, Kyushu University Platform of Inter/ Transdisciplinary Energy Research (Q-PIT). The associate editor coordinating the review of this article and approving it for publication was J. Lee. (Corresponding author: Ahmed Nasser.) Ahmed Nasser was with the Graduate School of Information Science and Electrical Engineering, Kyushu University, Fukuoka 812-8581, Japan. He is now with the Department of Electronics and Communication, Faculty of Engineering, Suez Canal University, Ismailia 41522, Egypt (e-mail: ahmed.nasser@mobcom.ait.kyushu-u.ac.jp).
Publisher Copyright:
© 2012 IEEE.
PY - 2021/1
Y1 - 2021/1
N2 - In this letter, we propose a novel low-complexity user pairing (UP) and power allocation (PA) technique utilizing the compressive sensing (CS) theory for non-orthogonal multiple access (NOMA) systems. In the proposed scheme, we formulate the joint UP and PA optimization problem in NOMA systems as a relaxed sparse l_{1} -norm problem, based on the fact that a limited, i.e., 'sparse,' number of users has to be paired among a large number of users over a dedicated resource block (RB). By exploiting this inherent sparsity property, we can obtain a near-optimal solution by relaxing the original NP-hard problem of joint UP and PA. Then, a CS technique is proposed to find a solution for the relaxed problem. Simulation results validate the effectiveness of our proposed idea regarding the sum-rate and the reduced complexity compared to the state-of-the-art schemes.
AB - In this letter, we propose a novel low-complexity user pairing (UP) and power allocation (PA) technique utilizing the compressive sensing (CS) theory for non-orthogonal multiple access (NOMA) systems. In the proposed scheme, we formulate the joint UP and PA optimization problem in NOMA systems as a relaxed sparse l_{1} -norm problem, based on the fact that a limited, i.e., 'sparse,' number of users has to be paired among a large number of users over a dedicated resource block (RB). By exploiting this inherent sparsity property, we can obtain a near-optimal solution by relaxing the original NP-hard problem of joint UP and PA. Then, a CS technique is proposed to find a solution for the relaxed problem. Simulation results validate the effectiveness of our proposed idea regarding the sum-rate and the reduced complexity compared to the state-of-the-art schemes.
UR - http://www.scopus.com/inward/record.url?scp=85099520813&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85099520813&partnerID=8YFLogxK
U2 - 10.1109/LWC.2020.3023619
DO - 10.1109/LWC.2020.3023619
M3 - Article
AN - SCOPUS:85099520813
SN - 2162-2337
VL - 10
SP - 151
EP - 155
JO - IEEE Wireless Communications Letters
JF - IEEE Wireless Communications Letters
IS - 1
M1 - 9194721
ER -