Iterative uniform-cost search of active antenna group selection for generalised spatial modulation

摘要

In generalised spatial modulation (GenSM) systems, the total number of active antenna groups is always not a power of two, which leaves room for designing an active antenna group (AAG) selection algorithm to achieve the constellation shaping gain and to improve the symbol error rate (SER). In this paper, based on uniform-cost search, a novel iterative AAG selection algorithm for GenSM systems is proposed with channel state information at the transmitter (CSIT). Based on the principle of minimum Euclidean distance maximization, the proposed algorithm reduces the computational complexity while maintaining the global optimality in improving SER comparing with exhaustive search algorithm. Monte Carlo simulations are performed to verify the global optimality in SER performance and favorable reduction in computational complexity striked by the proposed AAG selection algorithm.