{'fraction_non_alphanumeric': 0.021333333333333333, 'fraction_numerical': 0.0, 'mean_word_length': 5.155737704918033, '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}}
On optimal minimum-rate discrete loading in OFDMA systems

This paper considers the discrete bit loading problem in OFDMA downlink systems where each user has a minimum-rate constaint. Whereas OFDMA loading problems are generally non-convex and combinatorial, their optimal solutions can be approximated with a dual decomposition. The dual approach in the per-user minimum-rate case has a K-dimensional Lagrange search space for K users, and as a result is a very difficult problem. We consider two cases of the minimum-rate problem: instantaneous and ergodic allocation, and compare approaches and complexity in obtaining their solutions. We propose a subgradient ergodic allocation approach that is both practical and yields near optimal solutions.