{'fraction_non_alphanumeric': 0.014234875444839857, 'fraction_numerical': 0.0, 'mean_word_length': 5.901840490797546, '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}}
Fast Recursive Algorithm for Efficient Transmit Antenna Selection in Spatial Multiplexing Systems

In this paper we propose fast and efficient transmit antenna selection algorithms for wireless spatial multiplexing (SM) systems with linear receivers. Motivated by matrix inverse properties, a recursive matrix inverse calculation is developed for fast transmit antenna selection. Two selection criteria are proposed based on the recursive matrix inverse updating: one is the minimum mean square error (MMSE) and another is the maximum signal to interference noise ratio (SINR). Different from the conventional optimal antenna selection algorithms, the proposed algorithms are capable of computing matrix inverse and selection criteria from the previous computational results via a simple recursive procedure, so that the algorithmic complexity is reduced significantly. Simulation results show that our algorithms perform very close to the optimal exhaustive search algorithms in terms of bit error rate and capacity in both uncorrelated and highly correlated MIMO channels, while the computational complexity is much lower.