{'fraction_non_alphanumeric': 0.023001095290251915, 'fraction_numerical': 0.0, 'mean_word_length': 5.217687074829932, '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}}
User scheduling in massive MIMO systems with a large number of devices

In this work, we consider a joint grouping and scheduling algorithm for fair user scheduling in massive multiple-input multiple-output (MIMO) systems that support Internet of Things (IoT) application scenarios. Our proposed method serves the users consecutively in groups, where the group sizes are derived from the optimal number of active users in the zero-forcing downlink channel. To select the best group members we adopt a version of the popular semi-orthogonal user selection (SUS) algorithm. Specifically, we identify the drawbacks of the original SUS algorithm when operating in a massive MIMO system and present a modified SUS strategy (SUS-M) for user selection. Simulation results demonstrate that our proposed method outperforms the conventional SUS strategy and provides improved fairness in terms of the individual user rates.