A Low Complexity Data Detection Algorithm for Uplink Multiuser Massive MIMO Systems

A major challenge for uplink multiuser massive multiple-input and multiple-output (MIMO) systems is the data detection problem at the receiver due to the substantial increase in the dimensions of MIMO systems. The optimal maximum likelihood detector is impractical for such large wireless systems, be...

Full description

Saved in:
Bibliographic Details
Published inIEEE journal on selected areas in communications Vol. 35; no. 8; pp. 1701 - 1714
Main Author Chen, Jung-Chieh
Format Journal Article
LanguageEnglish
Published New York IEEE 01.08.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN0733-8716
1558-0008
DOI10.1109/JSAC.2017.2710878

Cover

More Information
Summary:A major challenge for uplink multiuser massive multiple-input and multiple-output (MIMO) systems is the data detection problem at the receiver due to the substantial increase in the dimensions of MIMO systems. The optimal maximum likelihood detector is impractical for such large wireless systems, because it suffers from exponential complexity in terms of the number of users. Therefore, suboptimal alternatives with reduced complexity, such as the linear minimum mean square error (LMMSE) detector, are necessary. However, the LMMSE detector still introduces high computational complexity, mainly caused by the computation of the Gram matrix and matrix inversion. To reduce the computational complexity of data detection while achieving satisfactory bit error rate (BER) performance, we initially proposed an iterative data detection algorithm that exploits the coordinate descent method (CDM)-based algorithmic framework for uplink multiuser massive MIMO systems. We then developed a reduced-complexity hardware implementation algorithm by leveraging the "one-at-a-time" update property of the CDM-based algorithmic framework. Simulation results revealed that the proposed CDM-based detector provides the same or improved BER performance than the classical LMMSE algorithm at a lower complexity for different test scenarios.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0733-8716
1558-0008
DOI:10.1109/JSAC.2017.2710878