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

Hyunsub Kim; Hyukyeon Lee; Jihye Koo; Jaeseok Kim

doi:10.1186/s13638-016-0756-4

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

Hyunsub Kim, Hyukyeon Lee, Jihye Koo, Jaeseok Kim

Department of Electrical and Electronic Engineering

Research output: Contribution to journal › Article › peer-review

7 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⁻⁵.

Original language	English
Article number	17
Journal	Eurasip Journal on Wireless Communications and Networking
Volume	2017
Issue number	1
DOIs	https://doi.org/10.1186/s13638-016-0756-4
Publication status	Published - 2017 Dec 1

Bibliographical note

Funding Information:
This work was supported by the National Research Foundation of Korea(NRF) grant funded by the Korea government(MSIP) (No. NRF-2015R1A2A2A01004883).

Publisher Copyright:
© 2016, The Author(s).

All Science Journal Classification (ASJC) codes

Signal Processing
Computer Science Applications
Computer Networks and Communications

Access to Document

10.1186/s13638-016-0756-4

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",

note = "Funding Information: This work was supported by the National Research Foundation of Korea(NRF) grant funded by the Korea government(MSIP) (No. NRF-2015R1A2A2A01004883). Publisher Copyright: {\textcopyright} 2016, The Author(s).",

year = "2017",

month = dec,

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",

}

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

N1 - Funding Information: This work was supported by the National Research Foundation of Korea(NRF) grant funded by the Korea government(MSIP) (No. NRF-2015R1A2A2A01004883). Publisher Copyright: © 2016, The Author(s).

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

AN - SCOPUS:85010060549

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 -

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

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this