An Enhanced Jacobi Precoder for Downlink Massive MIMO Systems

Linear precoding methods such as zero-forcing (ZF) are near optimal for downlink massive multi-user multiple input multiple output (MIMO) systems due to their asymptotic channel property. However, as the number of users increases, the computational complexity of obtaining the inverse matrix of the g...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers, materials & continua Ročník 68; číslo 1; s. 137 - 148
Hlavní autoři: Chan-Yeob, Park, Jae, Hyun-Ro, Jang, Jun-Yong, Hyoung-Kyu, Song
Médium: Journal Article
Jazyk:angličtina
Vydáno: Henderson Tech Science Press 01.01.2021
Témata:
Algorithms
Asymptotic properties
Complexity
Downlinking
Errors
Iterative methods
Linear equations
Mathematical analysis
Matrix methods
MIMO (control systems)
Polynomials
Preconditioning
ISSN:1546-2226, 1546-2218, 1546-2226
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Linear precoding methods such as zero-forcing (ZF) are near optimal for downlink massive multi-user multiple input multiple output (MIMO) systems due to their asymptotic channel property. However, as the number of users increases, the computational complexity of obtaining the inverse matrix of the gram matrix increases. For solving the computational complexity problem, this paper proposes an improved Jacobi (JC)-based precoder to improve error performance of the conventional JC in the downlink massive MIMO systems. The conventional JC was studied for solving the high computational complexity of the ZF algorithm and was able to achieve parallel implementation. However, the conventional JC has poor error performance when the number of users increases, which means that the diagonal dominance component of the gram matrix is reduced. In this paper, the preconditioning method is proposed to improve the error performance. Before executing the JC, the condition number of the linear equation and spectrum radius of the iteration matrix are reduced by multiplying the preconditioning matrix of the linear equation. To further reduce the condition number of the linear equation, this paper proposes a polynomial expansion precondition matrix that supplements diagonal components. The results show that the proposed method provides better performance than other iterative methods and has similar performance to the ZF.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1546-2226
1546-2218
1546-2226
DOI:10.32604/cmc.2021.016108