Iterative D.C. Optimization of Precoding in Wireless MIMO Relaying

Optimizations of precoding matrices in precode-and-forward (PF) MIMO relaying are nonconvex programs in precoding matrix variables. The semidefinite relaxation (SDR) technique, which relaxes the concerned nonconvex quadratic constraints by (convex) semi-definite ones, can locate the optimal solution...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on wireless communications Jg. 12; H. 4; S. 1617 - 1627
Hauptverfasser: Phan, A. H., Tuan, H. D., Kha, H. H., Nguyen, Ha H.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.04.2013
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Antennas
Applied sciences
Coding, codes
Computation
d.c. (difference of convex functions) programming
Exact sciences and technology
Information, signal and communications theory
Interference
Linear programming
Mathematical analysis
Mathematical models
Matrices
Matrix methods
MIMO
MIMO relay
Optimization
precode-and-forward (PF) relaying
Radiocommunication specific techniques
Radiocommunications
Relaying
Relays
semidefinite programming
Signal and communications theory
Signal to noise ratio
Studies
Telecommunications
Telecommunications and information theory
Vectors
MIMO system
Relaying
Dimensionality
Relay
Wireless telecommunication
Iterative method
Computational complexity
Convex programming
Optimization
semidefinite programming
Relaxation
precode-and-forward (PF) relaying
Simulation
Coding
Optimal solution
d.c
(difference of convex functions) programming
Convex function
Pretreatment
MIMO relay
Antenna
Software radio
ISSN:1536-1276, 1558-2248
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Optimizations of precoding matrices in precode-and-forward (PF) MIMO relaying are nonconvex programs in precoding matrix variables. The semidefinite relaxation (SDR) technique, which relaxes the concerned nonconvex quadratic constraints by (convex) semi-definite ones, can locate the optimal solutions, provided that the numbers of relaying antennas and users are very small. The computational complexity of the SDR grows explosively even with a very moderate increase in the numbers of relaying antennas and/or users, making the existing semidefinite programming (SDP) solvers incapable. In this paper, much more efficient problem formulations of precoding matrix design that exploit the spectral matrix optimization are developed. Such formulations have a low dimensionality and are computationally-tractable nonconvex matrix programs. Furthermore, by exploiting their partial convex structures in the d.c. (difference of two convex functions) framework, new effective iterative solutions are obtained. Extensive simulation results are presented to support the computational advantage of the proposed approach and show that the proposed approach can effectively handle all three considered optimization problems of precoding matrices in MIMO PF relaying, while the SDR approach either is computationally impractical or fails.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2013.021213.120380