{'fraction_non_alphanumeric': 0.021971830985915493, 'fraction_numerical': 0.0, 'mean_word_length': 5.320284697508897, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Resource Allocation for OFDM-NOMA Systems under Multiuser Scenarios with Different Speeds

In this paper, we consider an OFDM-NOMA (orthogonal frequency division multiplexing-nonorthogonal multiple access) downlink system, which has multiple subcarriers and multiple users at different locations and speeds from the base station. The goal is to maximize energy efficiency (EE), which is the bit rate per unit of energy consumption, while meeting the user’s quality of service and power constraints. Since the optimization problem of joint user subcarrier allocation and power allocation is a mixed-integer nonlinear programming (MINLP) problem, the use of traversal search will produce an unacceptable amount of calculation. It should be noted that the optimization problem includes the variables of user and subcarrier allocation and power allocation coefficient. In order to effectively solve this problem, we divide the problem into two subproblems: the problem of user and subcarrier allocation and the problem of power allocation between users. We use a matching algorithm to solve the problem of user and subcarrier assignment. An iterative algorithm to ensure convergence is proposed to obtain the power budget between subcarriers. Finally, the effective binary search is used to obtain the power allocation among users. The simulation results show that the proposed algorithm has a faster convergence rate. At the same time, as the number of users and subcarriers increases, EE improves significantly. As the user speed increases, the EE gradually decreases; especially when the number of users is larger, the effect is more obvious. Compared with random matching, the proposed algorithm has higher EE under the same number of users, number of subcarriers, and speed.