Spectral- and Energy-Efficient Resource Allocation for Multi-Carrier Uplink NOMA Systems

• Published in: IEEE transactions on vehicular technology Vol. 68; no. 9; pp. 9293 - 9296
• Main Authors: Zeng, Ming, Nguyen, Nam-Phong, Dobre, Octavia A., Ding, Zhiguo, Poor, H. Vincent
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.09.2019; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Convex functions; Decoding; Energy efficiency; Iterative algorithms; Linear programming; Mathematical programming; Maximization; multi-carrier NOMA; NOMA; Non-orthogonal multiple access (NOMA); Nonorthogonal multiple access; Optimization; Power efficiency; Resource allocation; Resource management; Subcarriers; Uplink
• ISSN: 0018-9545; 1939-9359
• DOI: 10.1109/TVT.2019.2926701

In this paper, resource allocation for a multi-carrier uplink non-orthogonal multiple access (NOMA) system is studied. Unlike the existing works on multi-carrier uplink NOMA, in which each user is assumed to access only one subcarrier, we consider a more general scenario where the number of subcarriers allocated to a single user is not constrained. We first aim to maximize the system's sum rate, which requires selecting the appropriate subcarriers for each user and distribute the transmission power. The formulated non-convex problem is transformed into a convex one, and further, an optimal and low-complexity iterative water-filling solution is proposed. Nonetheless, it is shown that maximum transmit power is employed by each user to maximize the sum rate. Motivated by the fact that the users are power constrained, the energy efficiency (EE) maximization problem is also studied. Based on fractional programming, the EE maximization problem is transformed into a series of sum rate maximization subproblems, and the proposed iterative water-filling solution is applied to each subproblem. The proposed schemes are compared with other NOMA-based and orthogonal multiple access based algorithms, and its superiority is fully validated.