{'fraction_non_alphanumeric': 0.029205607476635514, 'fraction_numerical': 0.0, 'mean_word_length': 5.801587301587301, '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}}
An Enhanced Greedy Resource Allocation Algorithm for Localized SC-FDMA Systems

The subchannel adjacency constraint makes resource allocation difficult to solve in single carrier localized frequency division multiple access (SC-LFDMA) systems. In this letter, we propose an enhanced greedy two-step resource allocation algorithm. In the first 'enclosure' step, through a 'potential assign' processing, a base station (BS) chooses several 'stronger' users and gives them priorities to locate their first subchannels. In the second 'contributing' step, the BS allows all users to compete for the remaining subchannels according to the best contribution criterion. Simulation results show that the proposed algorithm not only achieves higher spectral efficiency than the conventional greedy algorithms, but also improves the proportional fairness among users.