A Low-Complexity Group Detection Algorithm for MIMO systems
Guoquan Li, Xiangyun Zhou, Yanxia Zhao, Yongjun Xu, Yu Pang · 2018
The Multiple-Input Multiple-Out (MIMO) technology can improve system capacity by using multiple antenna transceivers with high decode complexity at the receiver. The Integer-Forcing (IF) linear detection algorithm is used to reduce the complexity of implementation in MIMO system, and its performance is close to the ML detection algorithm. However, the decode complexity of the IF detection will increase with the increase of antenna number. In order to further reduce the decode complexity, we propose a new detection algorithm called Group Integer-Forcing detection algorithm in this paper. In this algorithm, the received symbols are divided into groups, then each group will be decoded by the IF detection respectively to recover transmitted codewords in their own group, and those recovered codewords will be gathered to obtain original transmitted information before grouping. The Group Integer-Forcing detection algorithm reduce the decode complexity via grouping, so it has great advantage on complexity compare with the IF detection. It also has better error performance than the ZF detection algorithm according to simulation results, and the error performance gap is more and more obvious with the increased antenna numbers.