{'fraction_non_alphanumeric': 0.027548209366391185, 'fraction_numerical': 0.0, 'mean_word_length': 5.37719298245614, '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}}
A Near-ML Decoding with Improved Complexity over Wider Ranges of SNR and System Dimension in MIMO Systems

In this letter, we aim to present a near-maximum-likelihood (ML) decoding algorithm with low-complexity for wider ranges of SNR and system dimension in multiple-input-multiple-output (MIMO) systems. Based on the proposed radius design criterion, we introduce the effective radius (ER) which is determined using the statistics of path metric under correct and incorrect decoding cases. Since the constraint established by the ER maintains tightness during most search procedure, the proposed scheme further improves the complexity, and its performance loss is still negligible by properly selecting design probabilities.