Complexity Reduction for the Optimization of Linear Precoders Over Random MIMO Channels

Precoder optimization with full channel state information for finite alphabet signals over multiple-input multiple-output random channels is investigated in this paper. The precoder is represented by a product of power allocation matrix and constellation-forming matrix. There was an optimal algorith...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on communications Jg. 65; H. 10; S. 4205 - 4217
Hauptverfasser:	Nhat-Quang Nhan, Rostaing, Philippe, Amis, Karine, Collin, Ludovic, Radoi, Emanuel
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.10.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers
Schlagworte:	Algorithms Channels Codes Complexity Complexity theory Computation Computer simulation Constellations Data transmission Engineering Sciences Euclidean geometry EXIT chart Iterative algorithms Iterative methods Linear MIMO precoder Mapping MIMO Mutual information Optimization Power management Precoding Resource management Signal and Image processing Signal to noise ratio symbol mapping turbo detection EXIT charts MIMO Iterative receiver Linear precoding Mutual information
ISSN:	0090-6778, 1558-0857
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!