{'fraction_non_alphanumeric': 0.014734144778987828, 'fraction_numerical': 0.0006406149903907751, 'mean_word_length': 4.8943396226415095, '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}}
Squared Norm Based Joint User Scheduling and Antenna Selection in Massive MIMO System

In a general wireless fading environment the multiple-input multiple-output (MIMO) system with an array of antennas both at the Basestation (BS) and user side helps in achieving high spectral density and reliable communication. For high density and huge data challenging network like 5G networks, massive MIMO replaces the conventional MIMO system. In massive MIMO, along with large number of users, a large array of antennas are used at the BS. So user scheduling along with appropriate antenna selection is a challenging task in such networks. In networks where low latency is a major requirement the process of scheduling of the users and selection of antenna should be of significantly low complexity. Here we discuss a very low complex scheme where both the user scheduling and antenna selection are performed simultaneously using the squared norm value of the channel matrix. This algorithm simultaneously generates a group of selected antennas from the BS and a group of scheduled user in an iterative fashion. From the initial set of selected BS antennas and the set of users, in each iteration the least favourable antenna and user are removed to finally produces a set of antennas and users which maximizes the sum-rate capacity of the system. The performance of the scheduling algorithm is compared with the Exhaustive search (ES) method. It is shown that the proposed scheme has the advantage over the the ES scheme in terms of very low computational complexity.