{'fraction_non_alphanumeric': 0.01661631419939577, 'fraction_numerical': 0.0, 'mean_word_length': 5.90625, '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}}
Complexity Analysis of an Iterative Radius Sphere Decoding Algorithm for Generalized Spatial Modulation Systems

This paper represents a sphere decoding (SD) algorithm with a novel initial radius for the generalized spatial modulation (GSM) systems. The proposed radius guarantees that, with a remarkable reduction of the complexity in comparison with exhaustive search, the algorithm achieves the ML performance. In addition, an upper bound for the complexity is derived. Simulation results demonstrate that the proposed scheme outperforms the existing methods and requires less computational complexity compared to the recent suggested sphere decoding schemes.