Abstract:

Generalized space shift keying (GSSK), a preferred scheme in the combination of the largeantenna technology and the green communication technology, has received a wide range of interests. The main features of GSSK are that only a few antennas are activated at any time instant and antenna indices are exploited to convey information. The computational complexity of the maximum likelihood (ML) detector is extremely high due to the large transmitantenna which has been the limitation in practical application. Thus, simplified suboptimal detection algorithms have been widely studied. A novel GSSK detection algorithm based on global optimality conditions for binary quadratic programming is proposed. The proposed algorithm uses the optimal decision criterion to judge the transmit information. Subsequently the algorithm can determine the combination of transmit antennas based on the previous transmit information. Thus, the transmit binary bit stream is estimated. The simulation results show that the performance of the proposed algorithm, which exhibits lower computational complexity, is better than orthogonal matching pursuit (OMP) and convex superset relaxation (CSR) suboptimal detection algorithms. The proposed method achieves a better tradeoff between the performance and complexity.