A 2.69 Mbps/mW 1.09 Mbps/kGE Conjugate Gradient-based MMSE Detector for 64-QAM 128×8 Massive MIMO Systems

Author(s):  
Guiqiang Peng ◽  
Leibo Liu ◽  
Qiushi Wei ◽  
Yao Wang ◽  
Shouyi Yin ◽  
...  
2020 ◽  
Vol 68 ◽  
pp. 573-588 ◽  
Author(s):  
Leibo Liu ◽  
Guiqiang Peng ◽  
Pan Wang ◽  
Sheng Zhou ◽  
Qiushi Wei ◽  
...  

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 54010-54017 ◽  
Author(s):  
Geng Chen ◽  
Qingtian Zeng ◽  
Xiaomei Xue ◽  
ZhengQuan Li

Information ◽  
2019 ◽  
Vol 10 (5) ◽  
pp. 165 ◽  
Author(s):  
Xiaoqing Zhao ◽  
Zhengquan Li ◽  
Song Xing ◽  
Yang Liu ◽  
Qiong Wu ◽  
...  

Massive multiple-input-multiple-output (MIMO) is one of the key technologies in the fifth generation (5G) cellular communication systems. For uplink massive MIMO systems, the typical linear detection such as minimum mean square error (MMSE) presents a near-optimal performance. Due to the required direct matrix inverse, however, the MMSE detection algorithm becomes computationally very expensive, especially when the number of users is large. For achieving the high detection accuracy as well as reducing the computational complexity in massive MIMO systems, we propose an improved Jacobi iterative algorithm by accelerating the convergence rate in the signal detection process.Specifically, the steepest descent (SD) method is utilized to achieve an efficient searching direction. Then, the whole-correction method is applied to update the iterative process. As the result, the fast convergence and the low computationally complexity of the proposed Jacobi-based algorithm are obtained and proved. Simulation results also demonstrate that the proposed algorithm performs better than the conventional algorithms in terms of the bit error rate (BER) and achieves a near-optimal detection accuracy as the typical MMSE detector, but utilizing a small number of iterations.


2019 ◽  
Vol 8 (2S11) ◽  
pp. 2834-2840

This paper deals with various low complexity algorithms for higher order matrix inversion involved in massive MIMO system precoder design. The performance of massive MIMO systems is optimized by the process of precoding which is divided into linear and nonlinear. Nonlinear precoding techniques are most complex precoding techniques irrespective of its performance. Hence, linear precoding is generally preferred in which the complexity is mainly contributed by matrix inversion algorithm. To solve this issue, Krylov subspace algorithm such as Conjugate Gradient (CG) was considered to be the best choice of replacement for exact matrix inversions. But CG enforces a condition that the matrix needs to be Symmetric Positive Definite (SPD). If the matrix to be inverted is asymmetric then CG fails to converge. Hence in this paper, a novel approach for the low complexity inversion of asymmetric matrices is proposed by applying two different versions of CG algorithms- Conjugate Gradient Squared (CGS) and Bi-conjugate Gradient (Bi-CG). The convergence behavior and BER performance of these two algorithms are compared with the existing CG algorithm. The results show that these two algorithms outperform CG in terms of convergence speed and relative residue.


Author(s):  
Carlos Daniel Altamirano ◽  
Juan Minango ◽  
Celso de Almeida ◽  
Nathaly Orozco

Sign in / Sign up

Export Citation Format

Share Document