A Low-Complexity Ordered Sphere Decoding Algorithm for Spatial Modulation

摘要

In this letter, an ordered sphere decoding (OSD) algorithm for spatial modulation (SM) is proposed to reduce receiver complexity. The proposed algorithm relies on a developed matched filter (MF), where the initial solution vector is obtained and the transmit-antenna set is sorted, so as to perform a fast tree search. Furthermore, a threshold parameter is introduced to balance the tradeoff between complexity and performance. Simulation results show that the proposed SM-OSD algorithm achieves considerable complexity reduction compared to the SM-SD, especially in unbalanced multiple-input multiple output (MIMO) channels.