{'fraction_non_alphanumeric': 0.02127659574468085, 'fraction_numerical': 0.0, 'mean_word_length': 5.431654676258993, '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}}
Near-optimal signal detection with low complexity based on Gauss-Seidel method for uplink large-scale MIMO systems

Minimum mean square error (MMSE) algorithm is near-optimal for uplink large-scale MIMO systems, but involves high-complexity matrix inversion. In this paper, based on a special property of uplink large-scale MIMO systems that the filtering matrix of the MMSE algorithm is symmetric positive definite as we will prove, we propose to exploit the Gauss-Seidel method to iteratively realize the MMSE algorithm without the complicated matrix inversion. The proposed signal detection algorithm can reduce the complexity by one order of magnitude. Simulation results verify that the proposed algorithm outperforms the recently proposed Neumann series approximation algorithm, and achieves the near-optimal performance of the classical MMSE algorithm with a small number of iterations.