Low-Complexity WSRMax Precoder Design Using the Dual Coordinate Ascent Method

We propose a low-complexity precoder design for weighted sum rate maximization (WSRMax) in multiuser multiple-input-multiple-output systems with per-antenna power constraints (PAPCs). The proposed design is based on the alternating optimization framework and a fast dual coordinate ascent method in t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE wireless communications letters Jg. 12; H. 2; S. 1
Hauptverfasser: Hu, Xianzhi, Dai, Xuchu
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Piscataway IEEE 01.02.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Ascent
Complexity
Convergence
Covariance matrices
Design optimization
dual coordinate ascent
Gradient methods
Linear programming
MIMO communication
Multiuser MIMO
Optimization
per-antenna power constraints
Precoding
Transmitting antennas
weighted sum rate maximization
ISSN:2162-2337, 2162-2345
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We propose a low-complexity precoder design for weighted sum rate maximization (WSRMax) in multiuser multiple-input-multiple-output systems with per-antenna power constraints (PAPCs). The proposed design is based on the alternating optimization framework and a fast dual coordinate ascent method in the inner loop. Specifically, the original nonconvex WSRMax problem is first approximated as a sequence of convex quadratic optimization problems subject to PAPCs by adopting alternating optimization. Then, each convex quadratic problem is solved by a dual coordinate ascent method. The proposed dual coordinate ascent method includes no turning parameters, such as the step size in the projected gradient method, which offers both stability and fast convergence. Simulation results show that the dual coordinate ascent method converges faster than existing methods, which significantly improves the total computational efficiency of alternating optimization.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2162-2337
2162-2345
DOI:10.1109/LWC.2022.3227058