Integer-Forcing Detection of Generalized Spatial Modulation

Generalized spatial modulation (GSM) activates more transmit antennas than spatial modulation to increase the spectral efficiency. Although the maximum likelihood (ML) detector is able to achieve the optimal performance, its exhaustive search leads to intractable computational complexity. In this paper, we design a detection scheme based on Integer-Forcing (IF) algorithm, which utilize IF receiver to decode the transmitted symbols for all possible antenna combinations, and then compare the Euclidean distances between the detected symbols and the received signals. Finally, the symbol vector with minimum Euclidean distance and the corresponding antenna combination are detected as the decided symbols and transmit antenna combination. Simulation results shows that the designed detection scheme achieves obviously better performance than the ZF and the MMSE detection with relatively lower complexity.