Low-Complexity 2-Coordinates Descent for Near-Optimal MMSE Soft-Output Massive MIMO Uplink Data Detection

Massive multiple-input multiple-output (M-MIMO) is a significant pillar in fifth generation (5G) networks where a large number of antennas is deployed. It provides massive advantages to modern communication systems in data rate, spectral efficiency, number of users serviced simultaneously, energy efficiency, and quality of service (QoS). However, it requires advanced signal processing for data detection. The growing MIMO size leads to complicated scenarios, which makes the detector design a knotty problem. The problem is also becoming more complicated when high-order modulation schemes are exploited and more users are multiplexed. Therefore, it is not practical to employ the maximum likelihood (ML) detector despite the excellent performance. Linear detectors are alternative solutions and relatively simple. Unfortunately, they still need an exact matrix inversion computation, which bears to a significant high complexity. Therefore, several iterative methods are utilized to approximate or evade the matrix inversion rather than computing it. This paper studies the pros and cons of iterative matrix inversion methods where the number of computations and bit-error-rate (BER) are considered to compare between the methods. The comparison is conducted in several scenarios such as different ratio between the number of base station (BS) antennas and user terminal (UT) antennas (β), the number of iterations (n), and the relaxation parameter (ω). This paper also studies the impact of ω in the performance of Richardson (RI) and the successive over-relaxation (SOR) methods. Numerical results show that the conjugate gradient (CG) and optimized coordinate descent (OCD) methods exhibit the lowest complexity with an acceptable performance. In addition, the Gauss-Seidel (GS) method outperforms all other detectors with a trivial complexity increment. It is also noticed that the performance is not improved with every iteration. It is also shown that ω has a great impact and a significant role in achieving a satisfactory performance in both RI and SOR based detectors. From implementation point of view, detectors based on RI, OCD, and CG methods have achieved the highest hardware efficiency (HE) while Jacobi (JA) based detector has obtained the lowest HE. Recent research advances of detection methods are also presented in the open research direction with a potential impact of linear detection methods in initialization and pre-processing.

show abstract

“…This detector refines the estimated signals for each user in a sequential pattern. Therefore, it affords a high latency [71].…”

Section: G Optimized Coordinate Descentmentioning

confidence: 99%

Low Complexity Linear Detectors for Massive MIMO: A Comparative Study

et al. 2021

View full text Add to dashboard Cite

show abstract

A low-complexity orthogonal time frequency space modulation method for underwater acoustic communication

Zhang

Wang

et al. 2021

西北工业大学学报

View full text Add to dashboard Cite

Compared with the orthogonal frequency division multiplexing (OFDM) modulation, the orthogonal time frequency space(OTFS) modulation has a lower peak-to-average power ratio. It can effectively resist the time selective fading caused by the Doppler effect and has significant performance advantages over doubly dispersive channels. However, the conventional OTFS linear minimum mean square error (LMMSE) method has a high complexity and is not easy to process in real time. In order to solve this problem, we propose a low-complexity equalization algorithm with infinite norm constraints based on the optimal coordinate reduction. The equalization algorithm not only obtains the optimal solution through a certain number of iterations and avoids direct matrix inversion but also equalizes infinite norm constraints to improve the symbol detection performance gains. At the same time, the OTFS delay-Doppler channel matrix we utilize is sparse and the two-norm squares of each column vector equally reduces the complexity of optimal coordinate descent. Finally, the simulation in the underwater acoustic communication scenario we designed verify the effectiveness of the proposed equalization algorithm. The simulation results show that the performance of the proposed equalization algorithm is close to that of the LMMSE method, while its low complexity is ensured.

show abstract

Low-Complexity 2-Coordinates Descent for Near-Optimal MMSE Soft-Output Massive MIMO Uplink Data Detection

Cited by 2 publications

References 11 publications

Low Complexity Linear Detectors for Massive MIMO: A Comparative Study

Low Complexity Linear Detectors for Massive MIMO: A Comparative Study

A low-complexity orthogonal time frequency space modulation method for underwater acoustic communication

Contact Info

Product

Resources

About