基于二进制二次规划全局最优性条件的GSSK 系统的检测算法

摘要

Generalized space shift keying (GSSK),a preferred scheme in the combination of the large-an-tenna technology and the green communication technology,has received a wide range of interests.The main fea-tures 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 subop-timal detection algorithms have been widely studied.A novel GSSK detection algorithm based on global optimal-ity 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 trans-mit 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 computation-al complexity,is better than orthogonal matching pursuit (OMP)and convex superset relaxation (CSR)subop-timal detection algorithms.The proposed method achieves a better tradeoff between the performance and com-plexity.%广义空间位移键控（generalized space shift keying，GSSK）技术作为大天线技术和绿色通信技术相融合的优选方案受到了业界的广泛兴趣，其特点是在每一时刻只激活几根天线发送已知信号，利用激活天线的序号来传递信息。基于最大似然（maximum likelihood，ML）准则的 GSSK 检测器，当天线数较多时，其计算量太大，给实际应用带来困难，为此人们热衷于研究简化的次优检测算法。给出了一种基于二进制二次规划全局最优性条件的 GSSK 系统的检测算法。该算法首先利用最优判决准则判断发送信息，然后根据已判断出的发送信息来确定发送天线的组合，进而得到发送的二进制比特流。仿真结果表明，所提出的新算法在性能上优于已有的正交匹配追踪（orthogonal matching pursuit，OMP）、凸超集松弛（convex superset relaxation，CSR）等次优检测算法，复杂度又低于 ML 算法，在性能和复杂度之间得到较好的折中。