Low-Complexity MIMO Data Detection using Seysen's Lattice Reduction Algorithm

Lattice reduction (LR) is a powerful technique for improving the performance of suboptimum MIMO data detection methods. For LR-assisted data detection, the LLL algorithm has been considered almost exclusively so far. In this paper, we propose and develop the application of Seysen's algorithm (SA) to LR-assisted MIMO detection, and we show that the SA is a promising alternative to the LLL algorithm. Specifically, the SA outperforms the LLL algorithm in that it finds better lattice bases for MIMO systems of practical interest, which is reflected by an improved performance of SA-assisted detectors relative to their LLL-assisted counterparts. We present an efficient implementation of the SA whose per-iteration complexity is linear in the number of antennas, and we demonstrate that the SA requires significantly fewer iterations than the LLL algorithm.