Low-complexity lattice reduction algorithm for MIMO detectors with tree searching

Hyunsub Kim, Hyukyeon Lee, Jihye Koo, Jaeseok Kim

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

In this paper, we propose a low-complexity lattice reduction (LR) algorithm for multiple-input multiple-output (MIMO) detectors with tree searching. Whereas conventional approaches are based exclusively on channel characteristics, we focus on joint optimisation by employing an early termination criterion in the context of MIMO detection. In this regard, incremental LR (ILR) was previously proposed. However, the ILR is limited to LR-aided successive interference cancellation (SIC) detectors which have considerable bit-error-rate (BER) performance degradation compared to optimal detectors. Hence, in this paper, we extend the conventional ILR to be applicable to the LR-aided detectors with near-optimal performance. Furthermore, we perform the hypothetical analysis and several novel modifications to handle the obstacles for the application of the ILR to LR-aided detectors other than the LR-aided SIC detectors. The simulation results demonstrate that the computational complexity is considerably reduced, with BER performance degradation of 10−5.

Original languageEnglish
Article number17
JournalEurasip Journal on Wireless Communications and Networking
Volume2017
Issue number1
DOIs
Publication statusPublished - 2017 Dec 1

Fingerprint

Detectors
Bit error rate
Degradation
Computational complexity

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

@article{5883342035d74c24bc51a1cfb0689014,
title = "Low-complexity lattice reduction algorithm for MIMO detectors with tree searching",
abstract = "In this paper, we propose a low-complexity lattice reduction (LR) algorithm for multiple-input multiple-output (MIMO) detectors with tree searching. Whereas conventional approaches are based exclusively on channel characteristics, we focus on joint optimisation by employing an early termination criterion in the context of MIMO detection. In this regard, incremental LR (ILR) was previously proposed. However, the ILR is limited to LR-aided successive interference cancellation (SIC) detectors which have considerable bit-error-rate (BER) performance degradation compared to optimal detectors. Hence, in this paper, we extend the conventional ILR to be applicable to the LR-aided detectors with near-optimal performance. Furthermore, we perform the hypothetical analysis and several novel modifications to handle the obstacles for the application of the ILR to LR-aided detectors other than the LR-aided SIC detectors. The simulation results demonstrate that the computational complexity is considerably reduced, with BER performance degradation of 10−5.",
author = "Hyunsub Kim and Hyukyeon Lee and Jihye Koo and Jaeseok Kim",
year = "2017",
month = "12",
day = "1",
doi = "10.1186/s13638-016-0756-4",
language = "English",
volume = "2017",
journal = "Eurasip Journal on Wireless Communications and Networking",
issn = "1687-1472",
publisher = "Springer Publishing Company",
number = "1",

}

Low-complexity lattice reduction algorithm for MIMO detectors with tree searching. / Kim, Hyunsub; Lee, Hyukyeon; Koo, Jihye; Kim, Jaeseok.

In: Eurasip Journal on Wireless Communications and Networking, Vol. 2017, No. 1, 17, 01.12.2017.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Low-complexity lattice reduction algorithm for MIMO detectors with tree searching

AU - Kim, Hyunsub

AU - Lee, Hyukyeon

AU - Koo, Jihye

AU - Kim, Jaeseok

PY - 2017/12/1

Y1 - 2017/12/1

N2 - In this paper, we propose a low-complexity lattice reduction (LR) algorithm for multiple-input multiple-output (MIMO) detectors with tree searching. Whereas conventional approaches are based exclusively on channel characteristics, we focus on joint optimisation by employing an early termination criterion in the context of MIMO detection. In this regard, incremental LR (ILR) was previously proposed. However, the ILR is limited to LR-aided successive interference cancellation (SIC) detectors which have considerable bit-error-rate (BER) performance degradation compared to optimal detectors. Hence, in this paper, we extend the conventional ILR to be applicable to the LR-aided detectors with near-optimal performance. Furthermore, we perform the hypothetical analysis and several novel modifications to handle the obstacles for the application of the ILR to LR-aided detectors other than the LR-aided SIC detectors. The simulation results demonstrate that the computational complexity is considerably reduced, with BER performance degradation of 10−5.

AB - In this paper, we propose a low-complexity lattice reduction (LR) algorithm for multiple-input multiple-output (MIMO) detectors with tree searching. Whereas conventional approaches are based exclusively on channel characteristics, we focus on joint optimisation by employing an early termination criterion in the context of MIMO detection. In this regard, incremental LR (ILR) was previously proposed. However, the ILR is limited to LR-aided successive interference cancellation (SIC) detectors which have considerable bit-error-rate (BER) performance degradation compared to optimal detectors. Hence, in this paper, we extend the conventional ILR to be applicable to the LR-aided detectors with near-optimal performance. Furthermore, we perform the hypothetical analysis and several novel modifications to handle the obstacles for the application of the ILR to LR-aided detectors other than the LR-aided SIC detectors. The simulation results demonstrate that the computational complexity is considerably reduced, with BER performance degradation of 10−5.

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

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

U2 - 10.1186/s13638-016-0756-4

DO - 10.1186/s13638-016-0756-4

M3 - Article

VL - 2017

JO - Eurasip Journal on Wireless Communications and Networking

JF - Eurasip Journal on Wireless Communications and Networking

SN - 1687-1472

IS - 1

M1 - 17

ER -