Low-complexity lattice reduction algorithm for MIMO detectors with tree searching

Abstract

In this paper, we propose a low-complexity lattice reduction (LR) algorithm for multiple-input multiple-output (MIMO) detectors with tree searching. Whereas conventional approaches are based exclusively on channel characteristics, we focus on joint optimisation by employing an early termination criterion in the context of MIMO detection. In this regard, incremental LR (ILR) was previously proposed. However, the ILR is limited to LR-aided successive interference cancellation (SIC) detectors which have considerable bit-error-rate (BER) performance degradation compared to optimal detectors. Hence, in this paper, we extend the conventional ILR to be applicable to the LR-aided detectors with near-optimal performance. Furthermore, we perform the hypothetical analysis and several novel modifications to handle the obstacles for the application of the ILR to LR-aided detectors other than the LR-aided SIC detectors. The simulation results demonstrate that the computational complexity is considerably reduced, with BER performance degradation of 10−5.