Multi-convex optimization for sum rate maximization in multiuser relay networks
Multi-convex optimization for sum rate maximization in multiuser relay networks
复制标题
DOI：
10.1109/pimrc.2013.6666345
复制
发表时间：
2013-12
期刊：
影响因子：
--
通讯作者：
Hussein Al-Shatri;Xiang Li;R. S. Ganesan;A. Klein;T. Weber
中科院分区：
文献类型：
--
作者：
Hussein Al-Shatri;Xiang Li;R. S. Ganesan;A. Klein;T. Weber
考虑了由多个单天线源-目的节点对通过多个单天线中继通信组成的场景。考虑了一种双时隙传输方案。在第一个时隙中，源节点同时向中继和目的节点发送数据。源节点和中继都在第二个时隙中重传到目标节点。由于中继器无法对接收到的信号进行译码，因此采用放大转发中继策略。本文主要研究和速率最大化问题。由于源节点有两次发送，目的节点有两次接收，因此存在时域发送和接收滤波器，可以与中继的系数一起优化，以使和速率最大化。通过部分调整滤波器和引入两组比例因子，将求和速率最大化问题重新表述为一个三凸优化问题。提出了一种使和速率最大化并保证局部最优的迭代算法。结果表明，该算法在所有信噪比下都优于先前提出的干扰对准方案。
A scenario consisting of several single antenna source-destination node pairs communicating through multiple single antenna relays is considered. A two time-slot transmission scheme is considered. In the first time-slot, the source nodes transmit to both the relays and the destination nodes. Both the source nodes and the relays retransmit to the destination nodes in the second time-slot. As the relays cannot decode the received signals, an amplify and forward relaying strategy is assumed. In the present paper, the sum rate maximization problem is tackled. Due to the two transmissions of the source nodes and the two receptions of the destination nodes, there are temporal transmit and receive filters which can be optimized together with the relays' coefficients aiming at maximizing the sum rate. By partially adapting the filters and by introducing two sets of scaling factors, the sum rate maximization problem is reformulated as a tri-convex optimization problem. An iterative algorithm is proposed which maximizes the sum rate and guarantees a local optimum achievement. The results show that the proposed algorithm outperforms the previously proposed interference alignment scheme in all SNRs.