A novel bitwise factor graph belief propagation detection algorithm for massive MIMO system

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

As a low computational complexity detection algorithm for Massive Multi-Input-Multi-Output (MIMO) system, the well known factor graph belief propagation (BP) detection algorithm is effective for binary phase shift keying (BPSK) signal, but not appropriate for quadrature amplitude modulation (QAM) signal. In this paper, the complex transmitted signal vector modulated by QAM is transformed into the real valued bitwise vector which can be viewed as a transmitting signal vector modulated by BPSK. With the real valued bitwise vector and transformed channel gain matrix, an improved bitwise factor graph (BFG) graphic model is developed, and a BFG-BP algorithm is proposed to detect QAM signals in Massive MIMO system. Over a finite time of polynomial computational complexity of O(NT) per symbol, where NT denotes the number of transmitted antennas, the proposed BFG-BP detection algorithm obtains the approximate optimum BER performance of maximum likelihood detection algorithm with rapid convergence rate, and also achieves the theoretical spectral efficiency at medium high average received signal-to-noise ratio. Simulation results prove the effeteness of the proposed BFG-BP for detecting QAM signals in Massive MIMO system.

Cite

CITATION STYLE

APA

Li, L., & Meng, W. (2018). A novel bitwise factor graph belief propagation detection algorithm for massive MIMO system. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST (Vol. 209, pp. 453–462). Springer Verlag. https://doi.org/10.1007/978-3-319-66625-9_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free