Further Complexity Reduction for Antenna Selection in Spatial Modulation Systems

Abstract

In this letter, the transmit antenna selection in the spatial modulation system is studied. First, the computational complexity of the transmit antenna selection algorithm previously proposed elsewhere is reduced through an alternative computation of the singular value. Second, the minimum distance ascent (MDA) search is proposed to reduce the search complexity, where the initial antenna subset is acquired through the greedy incremental algorithm. Simulation results show that, compared with the exhaustive search, the proposed MDA search reduces the search complexity enormously with only slight performance loss.