Approximate Matrix Inversion Methods for Massive MIMO Detectors

Building a practical detector to achieve the attractive merits of large-scale multiple-input multiple-output (MIMO) is not a trivial task. However, low-complexity linear detectors could achieve a satisfactory performance for uplink massive MIMO, but such detectors involve unfavorable matrix inversio...

Full description

Saved in:
Bibliographic Details
Main Author: Albreem, Mahmoud A. M.
Format: Conference Proceeding
Language:English
Subjects:
approximate matrix inversion
detection
Massive MIMO
MMSE
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Building a practical detector to achieve the attractive merits of large-scale multiple-input multiple-output (MIMO) is not a trivial task. However, low-complexity linear detectors could achieve a satisfactory performance for uplink massive MIMO, but such detectors involve unfavorable matrix inversions, whose not a hardware friendly. This paper considers several approximate matrix inversion methods to avoid a direct matrix inversion, namely, the Neumann method, the Gauss-Seidel (GS), the successive over-relaxation (SOR), the Jacobi method, the Richardson method, the optimized coordinate descent (OCD), and the conjugate gradients (CG) method. This paper shows that the MMSE detector based on the SOR and GS methods outperform the other detectors when the ratio between the number of BS antennas and user terminal antennas (ß) varies from small to large values. It also investigates the selection of ω for both Richardson and SOR methods. The optimum performance can be achieved when ω = [2/(λ)] in the Richardson method. This paper shows that not every iteration has a positive impact on the performance.
ISSN:2159-1423
DOI:10.1109/ISCE.2019.8901015