A constant-throughput LLL algorithm with deep insertion for LR-aided MIMO detection

Lattice reduction (LR) has emerged as a popular technique to improve the performance of many low complexity MIMO detectors. Among the existing LR algorithms, the LLL algorithm has been applied to MIMO communications almost exclusively to date. However, the conventional LLL algorithm has variable reduction time, and hence non-constant throughput for the resulting communications system. In order to address this issue, this paper proposed a new variant of the LLL-algorithm (CT-LLL-deep) having constant throughput by introducing the concept of deep insertion into a parallel variant of LLL. Simulation results show that LR-aided detectors using the proposed CT-LLL-deep are capable of achieving lower bit error rate with much less reduction time, comparing to those using other existing LR algorithms.