Abstract
To deal with the rapid growth of wireless data traffic, we propose the detector design in generalized space shift keying (GSSK)-MIMO systems. With the advantage of low complexity, orthogonal matching pursuit (OMP) is widely adopted. Nevertheless, failure may occur in the identification of antenna index under a large mutual coherence of the channel. Thus, lots of studies and research have been conducted to further improve the performance of standard OMP. Most of the previous works focus on minimizing mutual coherence and designing additional equalizer at the receiver, which leads to high complexity in the end. On the other hand, the algorithm we propose achieves better performance than those from the previous works with lower complexity. Meanwhile, the proposed algorithm is adjustable by simply increasing the amount of candidates in each iteration, depending on the requirements of the systems. Consequently, the proposed detector is capable of achieving the same performance as maximum likelihood. Simulation results and comprehensive survey of the complexity are given to demonstrate the superior performance among other methods.