{'fraction_non_alphanumeric': 0.01875, 'fraction_numerical': 0.0, 'mean_word_length': 5.965217391304348, '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}}
Low-Complexity Near-Optimal Iterative Sequential Detection for Uplink Massive MIMO Systems

A novel low-complexity iterative sequential detection algorithm is proposed for near-optimal detection in uplink massive multiple-input multiple-output systems. In every iteration of the proposed algorithm, symbol transmitted from each user is detected sequentially while nulling the interference from all the other users. In contrast with recently proposed methods such as polynomial expansion, dual band Newton iteration, and Jacobi iteration, the proposed algorithm performs superior in terms of precision and computational complexity, and achieves better performance when the number of users increases. Simulation results validate superiority of the proposed algorithm over the recently reported methods.