A Low Complexity Expectation Propagation Detection for Massive MIMO System

This paper proposes a low-complexity expectation propagation (EP) algorithm for massive multiple-input multiple-output (MIMO) detections. The original EP detection algorithm shows a near-optimal performance but suffers from the unaffordable computational complexity. In this paper, we use an iterativ...

Full description

Saved in:
Bibliographic Details
Published in2018 IEEE Global Communications Conference (GLOBECOM) pp. 1 - 6
Main Authors Guoqiang Yao, Guiwu Yang, Jianhao Hu, Chao Fei
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2018
Subjects
Computational complexity
Convergence
Detectors
Gaussian distribution
MIMO communication
Random variables
Online AccessGet full text

Cover

More Information
Summary:This paper proposes a low-complexity expectation propagation (EP) algorithm for massive multiple-input multiple-output (MIMO) detections. The original EP detection algorithm shows a near-optimal performance but suffers from the unaffordable computational complexity. In this paper, we use an iterative successive updating scheme to reduce the complexity caused by the exact matrix inversion in each iteration and ameliorate the efficiency and accuracy of messages updating to accelerate the convergence, which leads to a low-complexity high-performance massive MIMO detector. Numerical analysis shows the proposed algorithm can outperform 0.2 dB in bit error rate (BER) with a huge of computational complexity saved compared with the previous EP detector.
ISSN:2576-6813
DOI:10.1109/GLOCOM.2018.8647172