Sum-Rate Maximization in Two-Way AF MIMO Relaying: Polynomial Time Solutions to a Class of DC Programming Problems

Sum-rate maximization in two-way amplify-and-forward (AF) multiple-input multiple-output (MIMO) relaying belongs to the class of difference-of-convex functions (DC) programming problems. DC programming problems occur also in other signal processing applications and are typically solved using differe...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on signal processing Ročník 60; číslo 10; s. 5478 - 5493
Hlavní autoři:	Khabbazibasmenj, A., Roemer, F., Vorobyov, S. A., Haardt, M.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.10.2012 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Applied sciences Complexity Detection, estimation, filtering, equalization, prediction Difference-of-convex functions (DC) programming Direct current Exact sciences and technology Information, signal and communications theory Mathematical models Maximization Noise non-convex programming Optimization Polynomials Programming Relaying Relays semi-definite programming relaxation Signal and communications theory Signal processing Signal processing algorithms Signal, noise sum-rate maximization Telecommunications and information theory two-way relaying Vectors Performance evaluation Relaying Iterative method Polynomial method Convex programming Optimization Call time Relaxation Convex function Routing protocols two-way relaying Linearization MIMO system semi-definite programming relaxation Branch and bound method Eigenvector Transmission protocol Algorithm Computational complexity Polynomial time non-convex programming sum-rate maximization Algorithm performance Signal processing Objective function Time complexity Difference-of-convex functions (DC) programming
ISSN:	1053-587X, 1941-0476
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!