Low complexity MIMO detection by using overlapped cluster search

In this paper, a low complexity overlapped cluster search algorithm which is employed in MIMO detection is proposed. The proposed algorithm allows more than one clusters possess the same candidate constellation points to decrease the possibility of choosing the wrong cluster while picking candidates. The proposed algorithm can maintain performance within 0.57dB such that the method is suitable for practical 4T4R 64QAM MIMO system. The algorithm complexity is reduce 27.29% to 56.25% in average case and 39.06% to 57.25% in worst case. Through simulation in IEEE 802.11n platform with TGN channel E, it indicates the complexity of proposed algorithm is less than the K-best SD with the same performance. Hence, the proposed algorithm provides a near-optimal solution with low computation complexity design for wireless MIMO system.