Lattice reduction aided precoding for multiuser MIMO using Seysen's algorithm

Lenstra-Lenstra-Lovasz (LLL) algorithm, which is one of the lattice reduction (LR) techniques, has been extensively used to obtain better basis of the channel matrix. In this paper, we jointly apply Seysen's lattice reduction algorithm (SA), instead of LLL, with the conventional linear precoding algorithms. Since SA obtains more orthogonal lattice basis compared to that obtained by LLL, lattice reduction aided (LRA) precoding based on SA algorithm outperforms the LRA precoding with LLL. Simulation results demonstrate that a gain of 0.5dB at target BER of 10−5 is achieved when SA is used instead of LLL for the LR stage.

[1]  Jun Niu,et al.  A New Lattice-Reduction-Based Receiver for MIMO Systems , 2007, 2007 41st Annual Conference on Information Sciences and Systems.

[2]  Gregory W. Wornell,et al.  Lattice-reduction-aided detectors for MIMO communication systems , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[3]  S. Haykin,et al.  Modern Wireless Communications , 1939, Nature.

[4]  M. Seysen,et al.  Simultaneous reduction of a lattice basis and its reciprocal basis , 1993, Comb..

[5]  Brian A. LaMacchia.  Basis Reduction Algorithms and Subset Sum Problems , 1991 .

[6]  Robert F. H. Fischer,et al.  Low-complexity near-maximum-likelihood detection and precoding for MIMO systems using lattice reduction , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

[7]  Gerald Matz,et al.  Low-Complexity MIMO Data Detection using Seysen's Lattice Reduction Algorithm , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[8]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[9]  Stephan ten Brink,et al.  A close-to-capacity dirty paper coding scheme , 2004, IEEE Transactions on Information Theory.

[10]  Robert F. H. Fischer,et al.  Lattice-reduction-aided broadcast precoding , 2004, IEEE Transactions on Communications.