DocumentCode
2060013
Title
Sum rate maximization in multi-operator two-way relay networks with a MIMO AF relay via POTDC
Author
Jianshu Zhang ; Vorobyov, Sergiy A. ; Khabbazibasmenj, Arash ; Haardt, Martin
Author_Institution
Commun. Res. Lab., Ilmenau Univ. of Technol., Ilmenau, Germany
fYear
2013
fDate
9-13 Sept. 2013
Firstpage
1
Lastpage
5
Abstract
We address the beamforming problem for maximizing the sum rate of a multi-operator two-way relay (TWR) network subject to the constraint on the total relay transmit power. This scenario is also known as relay sharing for multi-way relaying or TWR for multiple operators. The relay is assumed to be equipped with multiple antennas, and it uses the amplify-and-forward relaying strategy. It is shown that the corresponding optimization problem can be represented as a difference of convex functions (DC) programming problem which is NP-hard in general. Nevertheless, we develop an efficient polynomial time algorithm to solve the problem approximately. The performance comparison of the proposed polynomial time DC (POTDC) inspired algorithm to the existing state-of-the-art algorithms demonstrate that the proposed algorithm outperforms the existing algorithms especially in the case of non-symmetric networks.
Keywords
MIMO communication; array signal processing; convex programming; relay networks (telecommunication); MIMO AF relay; NP-hard problem; POTDC; amplify and forward relaying; beamforming problem; convex functions programming problem; multioperator two-way relay networks; multiway relaying; optimization problem; polynomial time algorithm; polynomial time difference of convex function; sum rate maximization; Antennas; Approximation algorithms; Complexity theory; Optimization; Polynomials; Relays; Signal processing algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing Conference (EUSIPCO), 2013 Proceedings of the 21st European
Conference_Location
Marrakech
Type
conf
Filename
6811690
Link To Document