Low-Complexity Joint Antenna and User Selection Scheme for the Downlink Multiuser Massive MIMO System with Complexity Reduction Factors

2019 ◽  
Vol E102.B (3) ◽  
pp. 592-602
Author(s):  
Aye Mon HTUN ◽  
Maung SANN MAW ◽  
Iwao SASASE
Keyword(s):  
Massive Mimo ◽  
Mimo System ◽  
Low Complexity ◽  
Complexity Reduction ◽  
User Selection ◽  
Selection Scheme ◽  
Reduction Factors

scholarly journals Low Complexity Hybrid PSO-BB Detection Algorithm for Massive MIMO System

2019 ◽  
Vol 12 (20) ◽  
pp. 1-10
Author(s):  
M. Kasiselvanathan ◽  
N. Sathish Kumar ◽  
◽  
Keyword(s):  
Massive Mimo ◽  
Mimo System ◽  
Low Complexity ◽  
Detection Algorithm

scholarly journals Modified Conjugate Gradient Algorithms for Gram Matrix Inversion of Massive MIMO Downlink Linear Precoding

2019 ◽  
Vol 8 (2S11) ◽  
pp. 2834-2840
Keyword(s):  
Conjugate Gradient ◽  
Massive Mimo ◽  
Mimo Systems ◽  
Mimo System ◽  
Low Complexity ◽  
Matrix Inversion ◽  
Gram Matrix ◽  
Linear Precoding ◽  
Inversion Algorithm ◽  
The Matrix

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.

Low Complexity Iterative-QR (IQR) Precoder Design Based on Structure Blocks for Massive MIMO System

2018 ◽  
Vol 102 (1) ◽  
pp. 19-30 ◽  
Author(s):  
Li Suet Mok ◽  
Nor K. Noordin ◽  
Aduwati Sali ◽  
Fazirulhisyam Hashim ◽  
Chee Kyun Ng
Keyword(s):  
Massive Mimo ◽  
Mimo System ◽  
Low Complexity ◽  
Precoder Design
Sign in / Sign up

Export Citation Format

Share Document