Rapidly Converging Low-Complexity Iterative Transmit Precoders for Massive MIMO Downlink

In this paper, rapidly converging low-complexity iterative transmit precoding (TPC) techniques are proposed for the massive multiple-input multiple-output (MIMO) downlink. First of all, the proposed random block-based iterative TPC (RBI-TPC) algorithm performs its iterations by updating multiple rat...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on communications Ročník 71; číslo 12; s. 1
Hlavní autori: Wang, Zheng, Wang, Jiaheng, Gao, Zhen, Huang, Yongming, Ng, Derrick Wing Kwan, Hanzo, Lajos
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.12.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Complexity
Convergence
Downlink
Downlinking
Iterative algorithms
iterative methods
Jacobian matrices
low-complexity linear transmit precoding
Massive MIMO
Precoding
Random sampling
Symmetric matrices
ISSN:0090-6778, 1558-0857
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, rapidly converging low-complexity iterative transmit precoding (TPC) techniques are proposed for the massive multiple-input multiple-output (MIMO) downlink. First of all, the proposed random block-based iterative TPC (RBI-TPC) algorithm performs its iterations by updating multiple rather than a single component at each instant, where the updating order of each block containing multiple components relies on the samples randomly sampled from a discrete distribution. Based on the analytically derived convergence rate, we demonstrate that improved convergence is achieved by the block-based update mechanism conceived since the correlation between multiple components can be beneficially exploited. Then, the random sampling that determines the updating order is studied. By applying conditional random sampling, the updating order is optimized based on the latest updates for attaining more rapid convergence. We also demonstrate that the associated updating order may become deterministic under specific conditions so that a fixed but optimized updating order can be used for facilitating the practical implementations, which paves the way for conceiving the ordered block-based iterative TPC (OBI-TPC) algorithm. Finally, the concept of successive over-relaxation (SOR) is adopted for further convergence improvement and simulations are presented to illustrate the performance improvements of the proposed RBI and OBI TPC algorithms compared to the existing low-complexity iterative TPC schemes.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2023.3305646