{'fraction_non_alphanumeric': 0.019038984587488667, 'fraction_numerical': 0.0, 'mean_word_length': 5.5325443786982245, '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 Novel and Low-Complexity Algorithm of EDAS for Spatial Modulation Systems

One of the techniques that helps to reduce the error probability for communication systems is transmit antenna selection (TAS). TAS with maximizing the minimum Euclidean distance, called Euclidean Distance Antenna Selection (EDAS), achieves high transmit diversity for spatial modulation (SM) systems. This letter focuses on a novel, very simple and low complexity antenna selection algorithm for EDAS. The main idea of this work is based on using eigenvectors obtained from the eigendecomposition of the matrix composed from the transmit SM signal difference vector. However, due to the characteristics of the SM, only certain eigenvectors are sufficient to achieve the Euclidean distance instead of all possible combinations of transmitted symbols. In addition, an algorithm is given in this study to find the required eigenvectors without the need for eigendecomposition. Simulation results show that our proposed method exhibits same symbol error rate performance as conventional optimum EDAS, but having lower complexity.