{'fraction_non_alphanumeric': 0.024691358024691357, 'fraction_numerical': 0.0, 'mean_word_length': 4.7976190476190474, '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}}
Fair channel-dependent scheduling in CDMA systems

In this study a scheduling algorithm for CDMA systems is presented which is a trade-off between two extreme ways of scheduling: C/I based and Round-Robin scheduling. The simulation results indeed display that the advantages of both these extremes have been combined in the new algorithm: a good fairness, comparable to that of the Round-Robin scheduling, together with almost the same power gain as reached in the C/I based scheduling.