Near-optimal MIMO detection algorithm with low and fixed complexity

Hyunsub Kim, Jaeseok Kim

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

2 Citations (Scopus)

Abstract

In this paper, we propose a near-optimal multiple-input multiple-output (MIMO) detection algorithm with low and fixed complexity, which is based on the fixed-complexity sphere decoder (FSD). By employing the lattice reduction (LR) to the FSD, the computational complexity is reduced considerably while maintaining the near-optimal bit-error-rate (BER) performance. Although the application of LR to the FSD is not straightforward, an efficient solution is proposed in this paper. The numerical results demonstrate that the computational complexity of the proposed algorithm is reduced by about 43.02% and 76.49% for 64-QAM and 256-QAM compared to the optimal FSD while the performance degradation is negligible.

Original languageEnglish
Title of host publication2015 International Symposium on Consumer Electronics, ISCE 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781467373654
DOIs
Publication statusPublished - 2015 Aug 4
EventIEEE International Symposium on Consumer Electronics, ISCE 2015 - Madrid, Spain
Duration: 2015 Jun 242015 Jun 26

Publication series

NameProceedings of the International Symposium on Consumer Electronics, ISCE
Volume2015-August

Other

OtherIEEE International Symposium on Consumer Electronics, ISCE 2015
Country/TerritorySpain
CityMadrid
Period15/6/2415/6/26

Bibliographical note

Publisher Copyright:
© 2015 IEEE.

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint

Dive into the research topics of 'Near-optimal MIMO detection algorithm with low and fixed complexity'. Together they form a unique fingerprint.

Cite this