Reduced complexity and latency for a massive MIMO system using a parallel detection algorithm
Author(s) -
Shoichi Higuchi,
Chang-Jun Ahn
Publication year - 2017
Publication title -
ict express
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.733
H-Index - 22
ISSN - 2405-9595
DOI - 10.1016/j.icte.2017.03.009
Subject(s) - latency (audio) , mimo , computer science , algorithm , parallel computing , telecommunications , channel (broadcasting)
In recent years, massive MIMO systems have been widely researched to realize high-speed data transmission. Since massive MIMO systems use a large number of antennas, these systems require huge complexity to detect the signal. In this paper, we propose a novel detection method for massive MIMO using parallel detection with maximum likelihood detection with QR decomposition and M-algorithm (QRM-MLD) to reduce the complexity and latency. The proposed scheme obtains an R matrix after permutation of an H matrix and QR decomposition. The R matrix is also eliminated using a Gauss–Jordan elimination method. By using a modified R matrix, the proposed method can detect the transmitted signal using parallel detection. From the simulation results, the proposed scheme can achieve a reduced complexity and latency with a little degradation of the bit error rate (BER) performance compared with the conventional method
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom