Maximum Likelihood and Soft Input Soft Output MIMO Detection at a Reduced Complexity

Abstract

This paper proposes an efficient pruning algorithm for MIMO detector, which not only achieves the same performance of the maximum likelihood (ML) decoder, but also massively reduces the number of visiting nodes. The proposed algorithm applies correct sorting order so that it achieves the same performance of the ML decoder. Thanks to the use of the correct ordering, both child and sibling nodes can be pruned efficiently. As a result, the number of visiting nodes is significantly reduced. To acquire properly sorted order, we propose fast sorting algorithms that generate the exact sorted sequence. Furthermore, the proposed schemes can be applied in SISO MIMO detector. The advantages of the proposed sphere decoder become more pronounced in high-order modulation schemes.