Low-complexity detection for GSM-MIMO systems via spatial constraint

Abstract

The optimal detection of generalized spatial modulation (GSM) technique is the maximum likelihood (ML) algorithm. However, the computational complexity of ML detection is high and increases dramatically with the increase of the number of transmit antennas and active antennas. To tackle this problem, we propose low-complexity suboptimum detectors by exploiting a special property of GSM-MIMO systems, i.e., the spatial constraint of active antennas. Specifically, the proposed detections are designed based on a greedy algorithm termed Multipath Matching Pursuit (MMP). Using the spatial constraint of active antennas, the proposed detections achieve better performance than that of the original MMP algorithm with lower computational complexity. Moreover, the numerical results are also provided to demonstrate the superiority of the proposed detections.