On decreasing the complexity of Lattice-Reduction-Aided K-Best MIMO detectors

The application of Lattice Reduction techniques over the MIMO channel matrix is known to improve the performance of MIMO detectors. Several authors have proposed Lattice-Reduction-Aided K-Best detectors for improving the performance of conventional K-Best algorithms. In this paper, efficient ways of decreasing the computational complexity of previously proposed schemes are presented. The knowledge about how the Lattice Reduction stage affects the transmitted symbols is exploited in order to significantly decrease the complexity without performance loss.