{'fraction_non_alphanumeric': 0.01643489254108723, 'fraction_numerical': 0.007585335018963337, 'mean_word_length': 5.2362204724409445, '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 Detection Based on Belief Propagation in a Massive MIMO System

A very large MIMO system has a potential to achieve extremely-high system throughput. In general, however, algorithms detecting spatially-multiplexed signals require the complexity proportional to the cubed number of antenna elements in the least case. Thus, the implementation of an antenna array with an order of 100 elements becomes very difficult. In this paper, we focus on the algorithm which is based on belief propagation and implementable with the second-order calculations. The simulation results show that the algorithm provides very good BER performance in MIMO spatial multiplexing when the number of antenna elements is 100 and reasonably low complexity in comparison to the MMSE spatial filtering.