Improved K-best algorithm for low-complexity MIMO detector

In this paper, an improved K-best algorithm, which is suitable for low-complexity MIMO detector implementation is proposed. In order to balance the detector´s bit-error-rate (BER) performance and computation complexity, several techniques, such as empirical path expansion and relaxed sorting have been proposed. Simulation results have shown that the proposed algorithm can achieve better computation efficiency while keep similar BER performance compared to the state-of-the-art ones. Furthermore, the corresponding detector MIMO architecture is also proposed.