点击次数：

论文类型： 期刊论文

发表时间： 2018-01-01

发表刊物： IEEE COMMUNICATIONS LETTERS

收录刊物： SCIE、EI、Scopus

卷号： 22

期号： 1

页面范围： 53-56

ISSN号： 1089-7798

关键字： Massive MIMO; generalized space shift keying; quadratic programming; necessary global optimality condition

摘要： In this letter, we present a low-complexity detection algorithm for generalized space shift keying MIMO systems. First, the maximum likelihood detection is posed as a binary quadratic programming (BQP) problem. Then, we derive an optimal decision rule based on the necessary global optimality condition of BQP. Using this rule, most entries of solution can be determined optimally with only O(3N(t)) per-bit complexity. Furthermore, taking advantage of the determined entries, the original programming can be reduced to a smaller-scale one only including the undetermined entries. Finally, we can use some conventional detectors to solve the remained small-scale problem with a lower complexity. Simulation results substantiate the performance of the proposed detector.