A New Paradigm of Precoder Design for Finite-Alphabet Inputs Based Communications

This paper proposes a pair of new linear precoder designs to reduce the high computation complexity in the context of multi-input multi-output communications with finite-alphabet inputs. We initially develop a high-performance mutual information maximization scheme using closed cut-off rate expressi...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on vehicular technology Ročník 73; číslo 7; s. 10829 - 10834
Hlavní autori: Xia, Guiyang, Xu, Hao, Zhou, Xiaobo, Shu, Feng, Wang, Jiangzhou
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.07.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Complexity
Computing time
Convex functions
Convexity
Exponential functions
finite-alphabet inputs
Linear programming
Maximization
Mutual information
Optimization
performance-versus-computation tradeoff
Precoder design
Precoding
Symbols
Vectors
ISSN:0018-9545, 1939-9359
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper proposes a pair of new linear precoder designs to reduce the high computation complexity in the context of multi-input multi-output communications with finite-alphabet inputs. We initially develop a high-performance mutual information maximization scheme using closed cut-off rate expression, formulating a standard convex optimization problem for iterative precoder optimization. To address the computational challenges associated with a large number of the possible transmit symbol vectors, we leverage the convexity of the exponential function to simplify the objective function. This approach results in an efficient bound that depends only on the maximum and minimum terms. Consequently, the corresponding optimization problem requires only two auxiliary variables to optimize the precoder, significantly reducing the computational complexity. Finally, numerical simulation verifies the efficiency of our proposed mutual information maximization schemes in terms of performance-versus-computation tradeoff.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2024.3382319