Computationally Efficient Data Detection Algorithm for Massive MU-MIMO Systems Using PSK Modulations

• Published in: IEEE communications letters Vol. 23; no. 6; pp. 983 - 986
• Main Author: Chen, Jung-Chieh
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.06.2019; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Antennas; Bit error rate; Complexity; Computational complexity; Computational efficiency; Computer simulation; Computing time; Data detection; Detection algorithms; Detectors; Error detection; LMMSE; low complexity; massive multiuser MIMO; MIMO (control systems); Optimization; Phase shift keying; projected gradient descent; Radio frequency; Riemann manifold; Run time (computers); Sensors
• ISSN: 1089-7798; 1558-2558
• DOI: 10.1109/LCOMM.2019.2914684

This letter considers the data detection problem in symmetric massive multiuser multiple-input-multiple-output (MU-MIMO) uplink systems, in which the number of base station (BS) antennas is equal to the number of single-antenna users. However, under uplink-heavy traffic, the conventional linear minimum mean-square-error (LMMSE)-based detectors suffer significant performance loss and thus cannot be applied. Although a detector based on Riemannian manifold optimization (RMO) provides excellent bit error rate (BER) performance that remarkably outperforms the LMMSE detector, it incurs high time complexity. Moreover, the computational complexity remains high. Thus, a simple yet computationally efficient detector based on the projected gradient descent algorithm is proposed in this letter to reduce the computational time and complexity of the detection algorithm while achieving the same BER performance as the RMO-based detector. Simulation results demonstrate that the proposed algorithm nearly yields the same performance as the RMO at low computational complexity, but the run-time complexity is considerably reduced.