Sum-Rate Maximization in Two-Way AF MIMO Relaying: Polynomial Time Solutions to a Class of DC Programming Problems | IEEE Journals & Magazine | IEEE Xplore

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


Abstract:

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) prog...Show More

Abstract:

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 different modifications of the branch-and-bound method which, however, does not have any polynomial time complexity guarantees. In this paper, we develop two efficient polynomial time algorithms for the sum-rate maximization in two-way AF MIMO relaying. The first algorithm guarantees to find at least a Karush-Kuhn-Tucker (KKT) solution. There is a strong evidence, however, that such a solution is actually globally optimal. The second algorithm that is based on the generalized eigenvectors shows the same performance as the first one with reduced computational complexity.
Published in: IEEE Transactions on Signal Processing ( Volume: 60, Issue: 10, October 2012)
Page(s): 5478 - 5493
Date of Publication: 13 July 2012

ISSN Information:


References

References is not available for this document.