Joint power allocation for MIMO-OFDM full-duplex relaying communications

详细信息    查看全文

• 作者：Hoang D. Tuan ; Duy T. Ngo ; Ho H. M. Tam
• 关键词：Iterative optimization ; MIMO ; OFDM ; Power allocation ; Successive convex programming
• 刊名：EURASIP Journal on Wireless Communications and Networking
• 出版年：2017
• 出版时间：December 2017
• 年：2017
• 卷：2017
• 期：1
• 全文大小：1171KB
• 刊物主题：Signal,Image and Speech Processing; Communications Engineering, Networks; Information Systems Applications (incl.Internet);
• 出版者：Springer International Publishing
• ISSN：1687-1499
• 卷排序：2017

文摘

In this paper, we address the problem of joint power allocation in a two-hop MIMO-OFDM network, where two full-duplex users communicate with each other via an amplify-and-forward relay. We consider a general model in which the full-duplex relay can forward the received message in either one-way or two-way mode. Our aim is to maximize the instantaneous end-to-end total throughput, subject to (i) the separate sum-power constraints at individual nodes or (ii) the joint sum-power constraint of the whole network. The formulated problems are large-scale nonconvex optimization problems, for which efficient and optimal solutions are currently not available. Using the successive convex approximation approach, we develop novel iterative algorithms of extremely low complexity which are especially suitable for large-scale computation. In each iteration, a simple closed-form solution is derived for the approximated convex program. The proposed algorithms guarantee to converge to at least a local optimum of the nonconvex problems. Numerical results verify that the devised solutions converge quickly, and that our optimal power allocation schemes significantly improve the throughput of MIMO-OFDM full-duplex one-way/two-way relaying over the conventional half-duplex relaying strategy.