Abstract

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.

Highlights

  • The number of mobile devices and mobile data traffic are tremendously growing year over year

  • They become non-competitive when utilized in Massive multiple-input multiple-output (M-MIMO) systems because a matrix inversion, QR-decomposition, or Choleskey decomposition are required in which the computational complexity is proportional to the number of antenna elements

  • This paper studies the performance-complexity profile of various detectors based on several iterative methods at different MIMO sizes and different iteration levels

Read more

Summary

INTRODUCTION

The number of mobile devices and mobile data traffic are tremendously growing year over year. Expectation propagation detection (EPD) method suffers from a complex low-parallelism iterations Nonlinear detectors such as the successive interference cancellation (SIC), lattice reduction-aided (LRA) algorithms, and SD are utilized in a small scale MIMO. They become non-competitive when utilized in M-MIMO systems because a matrix inversion, QR-decomposition, or Choleskey decomposition are required in which the computational complexity is proportional to the number of antenna elements. The sphere decoding (SD), require additional hardware in order to compute the sub-optimal solution [83], [96], [107] It is not very hardware friendly because of a variable complexity with various signals and channels which leads to a non-fixed detection throughput which is not competent in real time applications [4]. Linear detectors with iterative methods become substantial to defeat the noise enhancement with a low complexity

ITERATIVE METHODS
NEUMANN SERIES
GAUSS-SEIDEL
SUCCESSIVE OVER-RELAXATION
RICHARDSON
COMPLEXITY ANALYSIS AND HARDWARE EFFICIENCY
SIMULATION AND DISCUSSION
Findings
CONCLUSION AND OPEN RESEARCH
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call