TY - JOUR
T1 - Power and Channel Allocation for Non-Orthogonal Multiple Access in 5G Systems
T2 - Tractability and Computation
AU - Lei, Lei
AU - Yuan, Di
AU - Ho, Chin Keong
AU - Sun, Sumei
N1 - Publisher Copyright:
© 2002-2012 IEEE.
PY - 2016/12
Y1 - 2016/12
N2 - A promising multi-user access scheme, non-orthogonal multiple access (NOMA) with successive interference cancellation (SIC), is currently under consideration for 5G systems. NOMA allows more than one user to simultaneously access the same frequency-Time resource and separates multi-user signals by SIC. These render resource optimization in NOMA different from orthogonal multiple access. We provide theoretical insights and algorithmic solutions to jointly optimize power and channel allocation in NOMA. We mathematically formulate NOMA resource allocation problems, and characterize and analyze the problems' tractability under a range of constraints and utility functions. For tractable cases, we provide polynomial-Time solutions for global optimality. For intractable cases, we prove the NP-hardness and propose an algorithmic framework combining Lagrangian duality and dynamic programming to deliver near-optimal solutions. To gauge the performance of the solutions, we also provide optimality bounds on the global optimum. Numerical results demonstrate that the proposed algorithmic solution can significantly improve the system performance in both throughput and fairness over orthogonal multiple access as well as over a previous NOMA resource allocation scheme.
AB - A promising multi-user access scheme, non-orthogonal multiple access (NOMA) with successive interference cancellation (SIC), is currently under consideration for 5G systems. NOMA allows more than one user to simultaneously access the same frequency-Time resource and separates multi-user signals by SIC. These render resource optimization in NOMA different from orthogonal multiple access. We provide theoretical insights and algorithmic solutions to jointly optimize power and channel allocation in NOMA. We mathematically formulate NOMA resource allocation problems, and characterize and analyze the problems' tractability under a range of constraints and utility functions. For tractable cases, we provide polynomial-Time solutions for global optimality. For intractable cases, we prove the NP-hardness and propose an algorithmic framework combining Lagrangian duality and dynamic programming to deliver near-optimal solutions. To gauge the performance of the solutions, we also provide optimality bounds on the global optimum. Numerical results demonstrate that the proposed algorithmic solution can significantly improve the system performance in both throughput and fairness over orthogonal multiple access as well as over a previous NOMA resource allocation scheme.
KW - 5G
KW - Non-orthogonal multiple access
KW - resource allocation
KW - successive interference cancellation
UR - https://www.scopus.com/pages/publications/85012907176
U2 - 10.1109/TWC.2016.2616310
DO - 10.1109/TWC.2016.2616310
M3 - 文章
AN - SCOPUS:85012907176
SN - 1536-1276
VL - 15
SP - 8580
EP - 8594
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 12
M1 - 7587811
ER -