{'fraction_non_alphanumeric': 0.03368421052631579, 'fraction_numerical': 0.0, 'mean_word_length': 5.298013245033113, '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 scheduling for massive distributed MIMO downlink

This paper investigates the scheduling problem for a single-cell distributed multiple-input multiple-output (d-MIMO) downlink system with a massive number of remote access units (RAUs), N. We first derive the ergodic rate expressions for both the single RAU transmission (SRT) and the cooperative RAU transmission (CRT) modes as functions of long-term channel state information (CSI). Then, greedy scheduling algorithms aiming for maximizing the ergodic sum rate for the massive d-MIMO system using local long-term CSI are proposed. To mitigate intra-cell interference, a two-stage greedy scheduling algorithm (GSA) is developed to further improve the ergodic sum rate. Asymptotic analysis reveals that with infinite N intra-cell interference can be efficiently mitigated. Simulation results verify the derived expressions and demonstrate that the two-stage GSA exhibits a higher ergodic sum rate.