{'fraction_non_alphanumeric': 0.018666666666666668, 'fraction_numerical': 0.0, 'mean_word_length': 5.474137931034483, '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}}
Novel reduced complexity algorithm based on group detection in multiple antenna systems

Group detection (GD), the combination of maximum likelihood (ML) decoding and linear processing for multiple antenna systems, has been shown to attain reasonable performance and practical complexity. However, the diversity gain of conventional GD degrades since the degrees of freedom at the receive antennas are exploited for the linear processing before the local ML search. This paper proposes a novel GD with overlapped grouping. The proposed GD employs selection diversity within the overlapped signals by using the likelihood value, after the local ML search. Therefore, the proposed GD can achieve higher diversity gain compared with the conventional GD.