{'fraction_non_alphanumeric': 0.017120622568093387, 'fraction_numerical': 0.0, 'mean_word_length': 5.768421052631579, '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}}
Reduced Complexity Sparse Recovery Detectors for Differential Space Shift Keying MIMO System

Differential space shift keying (DSSK) alleviates the need of channel knowledge at the receiver side while retaining all SSK inherent advantages. In DSSK system, the receiver relies on the received blocks at two consecutive time slots to decode the message and arbitrary number of transmit antennas can be deployed that are not necessarily power of two. Besides, at each time instant only single transmit antenna is active to eliminate inter-channel interference (ICI) and facilitates the use of single RF–chain transmitter. Yet, the spectral efficiency of DSSK scheme is lower than its counterpart coherent SSK system and decays further for larger number of transmit antennas. As well, the receiver computational complexity grows exponentially with the transmitted block size and optimum detection gets impractical for large configurations. Hence, this paper aims at proposing reduced complexity, but yet efficient, receivers for DSSK system utilizing the inherent sparsity structure of DSSK. Reported results reveal significant enhancements where massive reduction in computational complexity is attained, especially for large configurations, while maintaining pragmatic error probability.