Lattice Reduction Aided Precoding Based on Seysen's Algorithm for Multiuser MIMO Systems 


Vol. 34,  No. 9, pp. 915-921, Sep.  2009


PDF
  Abstract

Lenstra-Lenstra-Lovasz (LLL) algorithm, which is one of the lattice reduction (LR) techniques, has been extensively used to obtain better bases 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 bases compared to those 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.5㏈ at target BER of 10-5 is achieved when SA is used instead of LLL or the LR stage.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. An, M. Mohaisen, K. Chang, "Lattice Reduction Aided Precoding Based on Seysen's Algorithm for Multiuser MIMO Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 9, pp. 915-921, 2009. DOI: .

[ACM Style]

HongSun An, Manar Mohaisen, and KyungHi Chang. 2009. Lattice Reduction Aided Precoding Based on Seysen's Algorithm for Multiuser MIMO Systems. The Journal of Korean Institute of Communications and Information Sciences, 34, 9, (2009), 915-921. DOI: .

[KICS Style]

HongSun An, Manar Mohaisen, KyungHi Chang, "Lattice Reduction Aided Precoding Based on Seysen's Algorithm for Multiuser MIMO Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 9, pp. 915-921, 9. 2009.