Lattice Reduction Aided MIMO Detection using Seysen’s Algorithm 


Vol. 34,  No. 6, pp. 642-648, Jun.  2009


PDF
  Abstract

In this paper, we use SA (Seysen's Algorithm) instead of LLL (Lenstra-Lenstra-Lovasz) to perform LRA (Lattice Reduction-Aided) detection. By using SA, the complexity of lattice reduction is reduced and the detection performance is improved. Although the performance is improved using SA, there still exists a gap in the performance between SA-LRA and ML detection. To reduce the performance difference, we apply list of candidates scheme to SA-LRA. The list of candidates scheme finds a list of candidates. Then, the candidate with the smallest squared Euclidean distance is considered as the estimate of the transmitted signal. Simulation results show that the SA-LRA detection leads to quasi-ML performance. Moreover, the efficiency of the SA is shown to highly improve the channel matrix conditionality.

  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 MIMO Detection using Seysen’s Algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 6, pp. 642-648, 2009. DOI: .

[ACM Style]

HongSun An, Manar Mohaisen, and KyungHi Chang. 2009. Lattice Reduction Aided MIMO Detection using Seysen’s Algorithm. The Journal of Korean Institute of Communications and Information Sciences, 34, 6, (2009), 642-648. DOI: .

[KICS Style]

HongSun An, Manar Mohaisen, KyungHi Chang, "Lattice Reduction Aided MIMO Detection using Seysen’s Algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 6, pp. 642-648, 6. 2009.