A fast convergence LLL algorithm with fixed-complexity for SIC-based MIMO detection

Hyukyeon Lee, Hyunsub Kim, Minjoon Kim, Jaeseok Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, we propose a fixed-complexity variant of LLL (Lenstra-Lenstra-Lovasz) algorithm. LLL algorithm is widely used in MIMO signal processing to obtain full diversity gain with low complexity increase. However, because of its non-deterministic nature with varying complexity and high worst-case costs, the real implementation of original LLL algorithm is difficult. Although some fixed-complexity variants of LLL algorithm has been proposed, but still their complexity in large MIMO system is high. The proposed algorithm uses column selection method based on threshold which leads to the fast convergence in fewer iterations. Simulation result shows that the proposed algorithm converges faster than other fixed-complexity variants of LLL algorithms while it saves about 30% complexity in 8 × 8 MIMO system compared to existing fixed-complexity LLL (fc-LLL) algorithm.

Original languageEnglish
Title of host publication30th International Conference on Information Networking, ICOIN 2016
PublisherIEEE Computer Society
Pages439-441
Number of pages3
ISBN (Electronic)9781509017249
DOIs
Publication statusPublished - 2016 Mar 7
Event30th International Conference on Information Networking, ICOIN 2016 - Kota Kinabalu, Malaysia
Duration: 2016 Jan 132016 Jan 15

Publication series

NameInternational Conference on Information Networking
Volume2016-March
ISSN (Print)1976-7684

Other

Other30th International Conference on Information Networking, ICOIN 2016
CountryMalaysia
CityKota Kinabalu
Period16/1/1316/1/15

Fingerprint

MIMO systems
Signal processing
Costs

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Information Systems

Cite this

Lee, H., Kim, H., Kim, M., & Kim, J. (2016). A fast convergence LLL algorithm with fixed-complexity for SIC-based MIMO detection. In 30th International Conference on Information Networking, ICOIN 2016 (pp. 439-441). [7427154] (International Conference on Information Networking; Vol. 2016-March). IEEE Computer Society. https://doi.org/10.1109/ICOIN.2016.7427154
Lee, Hyukyeon ; Kim, Hyunsub ; Kim, Minjoon ; Kim, Jaeseok. / A fast convergence LLL algorithm with fixed-complexity for SIC-based MIMO detection. 30th International Conference on Information Networking, ICOIN 2016. IEEE Computer Society, 2016. pp. 439-441 (International Conference on Information Networking).
@inproceedings{673c20b22aff45ada752c2c8fcb578db,
title = "A fast convergence LLL algorithm with fixed-complexity for SIC-based MIMO detection",
abstract = "In this paper, we propose a fixed-complexity variant of LLL (Lenstra-Lenstra-Lovasz) algorithm. LLL algorithm is widely used in MIMO signal processing to obtain full diversity gain with low complexity increase. However, because of its non-deterministic nature with varying complexity and high worst-case costs, the real implementation of original LLL algorithm is difficult. Although some fixed-complexity variants of LLL algorithm has been proposed, but still their complexity in large MIMO system is high. The proposed algorithm uses column selection method based on threshold which leads to the fast convergence in fewer iterations. Simulation result shows that the proposed algorithm converges faster than other fixed-complexity variants of LLL algorithms while it saves about 30{\%} complexity in 8 × 8 MIMO system compared to existing fixed-complexity LLL (fc-LLL) algorithm.",
author = "Hyukyeon Lee and Hyunsub Kim and Minjoon Kim and Jaeseok Kim",
year = "2016",
month = "3",
day = "7",
doi = "10.1109/ICOIN.2016.7427154",
language = "English",
series = "International Conference on Information Networking",
publisher = "IEEE Computer Society",
pages = "439--441",
booktitle = "30th International Conference on Information Networking, ICOIN 2016",
address = "United States",

}

Lee, H, Kim, H, Kim, M & Kim, J 2016, A fast convergence LLL algorithm with fixed-complexity for SIC-based MIMO detection. in 30th International Conference on Information Networking, ICOIN 2016., 7427154, International Conference on Information Networking, vol. 2016-March, IEEE Computer Society, pp. 439-441, 30th International Conference on Information Networking, ICOIN 2016, Kota Kinabalu, Malaysia, 16/1/13. https://doi.org/10.1109/ICOIN.2016.7427154

A fast convergence LLL algorithm with fixed-complexity for SIC-based MIMO detection. / Lee, Hyukyeon; Kim, Hyunsub; Kim, Minjoon; Kim, Jaeseok.

30th International Conference on Information Networking, ICOIN 2016. IEEE Computer Society, 2016. p. 439-441 7427154 (International Conference on Information Networking; Vol. 2016-March).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - A fast convergence LLL algorithm with fixed-complexity for SIC-based MIMO detection

AU - Lee, Hyukyeon

AU - Kim, Hyunsub

AU - Kim, Minjoon

AU - Kim, Jaeseok

PY - 2016/3/7

Y1 - 2016/3/7

N2 - In this paper, we propose a fixed-complexity variant of LLL (Lenstra-Lenstra-Lovasz) algorithm. LLL algorithm is widely used in MIMO signal processing to obtain full diversity gain with low complexity increase. However, because of its non-deterministic nature with varying complexity and high worst-case costs, the real implementation of original LLL algorithm is difficult. Although some fixed-complexity variants of LLL algorithm has been proposed, but still their complexity in large MIMO system is high. The proposed algorithm uses column selection method based on threshold which leads to the fast convergence in fewer iterations. Simulation result shows that the proposed algorithm converges faster than other fixed-complexity variants of LLL algorithms while it saves about 30% complexity in 8 × 8 MIMO system compared to existing fixed-complexity LLL (fc-LLL) algorithm.

AB - In this paper, we propose a fixed-complexity variant of LLL (Lenstra-Lenstra-Lovasz) algorithm. LLL algorithm is widely used in MIMO signal processing to obtain full diversity gain with low complexity increase. However, because of its non-deterministic nature with varying complexity and high worst-case costs, the real implementation of original LLL algorithm is difficult. Although some fixed-complexity variants of LLL algorithm has been proposed, but still their complexity in large MIMO system is high. The proposed algorithm uses column selection method based on threshold which leads to the fast convergence in fewer iterations. Simulation result shows that the proposed algorithm converges faster than other fixed-complexity variants of LLL algorithms while it saves about 30% complexity in 8 × 8 MIMO system compared to existing fixed-complexity LLL (fc-LLL) algorithm.

UR - http://www.scopus.com/inward/record.url?scp=84963946910&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84963946910&partnerID=8YFLogxK

U2 - 10.1109/ICOIN.2016.7427154

DO - 10.1109/ICOIN.2016.7427154

M3 - Conference contribution

T3 - International Conference on Information Networking

SP - 439

EP - 441

BT - 30th International Conference on Information Networking, ICOIN 2016

PB - IEEE Computer Society

ER -

Lee H, Kim H, Kim M, Kim J. A fast convergence LLL algorithm with fixed-complexity for SIC-based MIMO detection. In 30th International Conference on Information Networking, ICOIN 2016. IEEE Computer Society. 2016. p. 439-441. 7427154. (International Conference on Information Networking). https://doi.org/10.1109/ICOIN.2016.7427154