Fast and Efficient Transmit Antenna Selection Algorithms in Spatial Multiplexing Systems

In this paper we investigate fast and efficient transmit antenna selection algorithms for wireless spatial multiplexing (SM) systems. Fast antenna selection is practical important for adapting to changing environments. The conventional fast antenna selection algorithms such as incremental and decremental algorithms rely on different antenna configurations so as to reduce complexity. Motivated by finding a good submatrix, a fast and efficient transmit antenna selection algorithm is developed based on maximum-volume submatrix based search algorithm. The proposed algorithm essentially maximizes the channel capacity. Complexity analysis and simulation results show that our algorithm with lower complexity performs better than or equivalent to the suboptimal incremental and decremental algorithms for any scenarios.