Low-complexity Seysen´s algorithm based lattice reduction-aided MIMO detection for hardware implementations

Lattice reduction-aided linear detectors for MIMO systems are a promising receiver structure for low-complexity implementations. In this paper we present a lattice reduction-aided MIMO data detection architecture based on Seysen´s algorithm, where the algorithm is carried out exclusively on the Gram matrix of the channel and its inverse. Furthermore, we describe and evaluate several modification of Seysen´s algorithm tailored to reduce the total complexity with respect to hardware implementation. By means of complexity-performance trade-offs we demonstrate the potential benefit of the various algorithmic modifications. First, novel schemes to identify the update steps in each iteration of Seysen´s algorithm are presented. Second, we show that further complexity reduction of Seysen´s algorithm can be obtained by severely constraining the update coefficients. Eventually, methods are devised that terminate Seysen´s algorithm prematurely and thus result in a reduction of the average complexity.