MMSE-based lattice-reduction-Aided fixed-complexity sphere decoder for low-complexity near-ML MIMO detection

Hyunsub Kim; Hyukyeon Lee; Jaeseok Kim

doi:10.1109/LANMAN.2015.7114716

MMSE-based lattice-reduction-Aided fixed-complexity sphere decoder for low-complexity near-ML MIMO detection

Hyunsub Kim, Hyukyeon Lee, Jaeseok Kim

Department of Electrical and Electronic Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Citations (Scopus)

Abstract

In this paper, we propose a minimum-meansquared-error (MMSE)-based lattice-reduction (LR)-Aided fixedcomplexity sphere decoder (FSD) for low-complexity nearmaximum-likelihood (near-ML) multiple-input multiple-output (MIMO) detection. In order for the FSD to achieve optimal performance, the number of full expansion (FE) stages should be sufficient, which is the major cause of the increase in the computational complexity when either a large signal constellation or a large number of antennas are adopted. However, the proposed algorithm maintains the near-ML performance with the aid of the MMSE-based LR algorithm while reducing the number of FE stages. Although there exists the increase in the computational complexity for the application of the additional processing elements, the decrease in the number of FE stages results in the lower computational complexity of the overall algorithm. The numerical analysis demonstrates that there is a considerable decrease in the computational complexity while the performance degradation is negligible, compared to the optimal FSD.

Original language	English
Title of host publication	2015 IEEE 21st International Workshop on Local and Metropolitan Area Networks, LANMAN 2015
Publisher	IEEE Computer Society
ISBN (Electronic)	9781467367615
DOIs	https://doi.org/10.1109/LANMAN.2015.7114716
Publication status	Published - 2015 May 28
Event	21st IEEE International Workshop on Local and Metropolitan Area Networks, LANMAN 2015 - Tsinghua, Beijing, China Duration: 2015 Apr 22 → 2015 Apr 24

Publication series

Name	IEEE Workshop on Local and Metropolitan Area Networks
Volume	2015-May
ISSN (Print)	1944-0367
ISSN (Electronic)	1944-0375

Other

Other	21st IEEE International Workshop on Local and Metropolitan Area Networks, LANMAN 2015
Country/Territory	China
City	Tsinghua, Beijing
Period	15/4/22 → 15/4/24

Bibliographical note

Publisher Copyright:
© 2015 IEEE.

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Software
Electrical and Electronic Engineering
Communication

Access to Document

10.1109/LANMAN.2015.7114716

Cite this

Kim, H., Lee, H., & Kim, J. (2015). MMSE-based lattice-reduction-Aided fixed-complexity sphere decoder for low-complexity near-ML MIMO detection. In 2015 IEEE 21st International Workshop on Local and Metropolitan Area Networks, LANMAN 2015 [7114716] (IEEE Workshop on Local and Metropolitan Area Networks; Vol. 2015-May). IEEE Computer Society. https://doi.org/10.1109/LANMAN.2015.7114716

@inproceedings{450b174515c4425a8a3f073236a25e1a,

title = "MMSE-based lattice-reduction-Aided fixed-complexity sphere decoder for low-complexity near-ML MIMO detection",

abstract = "In this paper, we propose a minimum-meansquared-error (MMSE)-based lattice-reduction (LR)-Aided fixedcomplexity sphere decoder (FSD) for low-complexity nearmaximum-likelihood (near-ML) multiple-input multiple-output (MIMO) detection. In order for the FSD to achieve optimal performance, the number of full expansion (FE) stages should be sufficient, which is the major cause of the increase in the computational complexity when either a large signal constellation or a large number of antennas are adopted. However, the proposed algorithm maintains the near-ML performance with the aid of the MMSE-based LR algorithm while reducing the number of FE stages. Although there exists the increase in the computational complexity for the application of the additional processing elements, the decrease in the number of FE stages results in the lower computational complexity of the overall algorithm. The numerical analysis demonstrates that there is a considerable decrease in the computational complexity while the performance degradation is negligible, compared to the optimal FSD.",

author = "Hyunsub Kim and Hyukyeon Lee and Jaeseok Kim",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; 21st IEEE International Workshop on Local and Metropolitan Area Networks, LANMAN 2015 ; Conference date: 22-04-2015 Through 24-04-2015",

year = "2015",

month = may,

day = "28",

doi = "10.1109/LANMAN.2015.7114716",

language = "English",

series = "IEEE Workshop on Local and Metropolitan Area Networks",

publisher = "IEEE Computer Society",

booktitle = "2015 IEEE 21st International Workshop on Local and Metropolitan Area Networks, LANMAN 2015",

address = "United States",

}

Kim, H, Lee, H & Kim, J 2015, MMSE-based lattice-reduction-Aided fixed-complexity sphere decoder for low-complexity near-ML MIMO detection. in 2015 IEEE 21st International Workshop on Local and Metropolitan Area Networks, LANMAN 2015., 7114716, IEEE Workshop on Local and Metropolitan Area Networks, vol. 2015-May, IEEE Computer Society, 21st IEEE International Workshop on Local and Metropolitan Area Networks, LANMAN 2015, Tsinghua, Beijing, China, 15/4/22. https://doi.org/10.1109/LANMAN.2015.7114716

MMSE-based lattice-reduction-Aided fixed-complexity sphere decoder for low-complexity near-ML MIMO detection. / Kim, Hyunsub; Lee, Hyukyeon; Kim, Jaeseok.

2015 IEEE 21st International Workshop on Local and Metropolitan Area Networks, LANMAN 2015. IEEE Computer Society, 2015. 7114716 (IEEE Workshop on Local and Metropolitan Area Networks; Vol. 2015-May).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - MMSE-based lattice-reduction-Aided fixed-complexity sphere decoder for low-complexity near-ML MIMO detection

AU - Kim, Hyunsub

AU - Lee, Hyukyeon

AU - Kim, Jaeseok

PY - 2015/5/28

Y1 - 2015/5/28

N2 - In this paper, we propose a minimum-meansquared-error (MMSE)-based lattice-reduction (LR)-Aided fixedcomplexity sphere decoder (FSD) for low-complexity nearmaximum-likelihood (near-ML) multiple-input multiple-output (MIMO) detection. In order for the FSD to achieve optimal performance, the number of full expansion (FE) stages should be sufficient, which is the major cause of the increase in the computational complexity when either a large signal constellation or a large number of antennas are adopted. However, the proposed algorithm maintains the near-ML performance with the aid of the MMSE-based LR algorithm while reducing the number of FE stages. Although there exists the increase in the computational complexity for the application of the additional processing elements, the decrease in the number of FE stages results in the lower computational complexity of the overall algorithm. The numerical analysis demonstrates that there is a considerable decrease in the computational complexity while the performance degradation is negligible, compared to the optimal FSD.

AB - In this paper, we propose a minimum-meansquared-error (MMSE)-based lattice-reduction (LR)-Aided fixedcomplexity sphere decoder (FSD) for low-complexity nearmaximum-likelihood (near-ML) multiple-input multiple-output (MIMO) detection. In order for the FSD to achieve optimal performance, the number of full expansion (FE) stages should be sufficient, which is the major cause of the increase in the computational complexity when either a large signal constellation or a large number of antennas are adopted. However, the proposed algorithm maintains the near-ML performance with the aid of the MMSE-based LR algorithm while reducing the number of FE stages. Although there exists the increase in the computational complexity for the application of the additional processing elements, the decrease in the number of FE stages results in the lower computational complexity of the overall algorithm. The numerical analysis demonstrates that there is a considerable decrease in the computational complexity while the performance degradation is negligible, compared to the optimal FSD.

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

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

U2 - 10.1109/LANMAN.2015.7114716

DO - 10.1109/LANMAN.2015.7114716

M3 - Conference contribution

AN - SCOPUS:84945219128

T3 - IEEE Workshop on Local and Metropolitan Area Networks

BT - 2015 IEEE 21st International Workshop on Local and Metropolitan Area Networks, LANMAN 2015

PB - IEEE Computer Society

T2 - 21st IEEE International Workshop on Local and Metropolitan Area Networks, LANMAN 2015

Y2 - 22 April 2015 through 24 April 2015

ER -

MMSE-based lattice-reduction-Aided fixed-complexity sphere decoder for low-complexity near-ML MIMO detection

Abstract

Publication series

Other

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this