Rate balancing in full-duplex MIMO two-way relay networks

Erfan Khordad, Ata Khalili, Soroush Akhlaghi

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

1 Citation (Scopus)


Maximizing the minimum rate for a full-duplex multiple-input multiple-output (MIMO) wireless network encompassing two sources and a two-way (TW) relay operating in a two-hop manner is investigated. To improve the overall performance, using a zero-forcing approach at the relay to suppress the residual self-interference arising from full-duplex (FD) operation, the underlying max-min problem is cast as an optimization problem which is non-convex. To circumvent this issue, semidefinite relaxation technique is employed, leading to upper and lower bound solutions for the optimization problem. Numerical results verify that the upper and lower bound solutions closely follow each other, showing that the proposed approach results in a close-to-optimal solution. In addition, the impact of residual self-interference upon the overall performance of the network in terms of the minimum rate is illustrated by numerical results, and for low residual self-interference scenarios the superiority of the proposed method compared to an analogous half-duplex (HD) counterpart is shown.

Original languageEnglish
Title of host publication2019 28th Wireless and Optical Communications Conference (WOCC 2019) proceedings
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Number of pages5
ISBN (Electronic)9781728106601
ISBN (Print)9781728106618
Publication statusPublished - 2019
Event28th Wireless and Optical Communications Conference, WOCC 2019 - Beijing, China
Duration: 9 May 201910 May 2019

Publication series

ISSN (Print)2379-1268
ISSN (Electronic)2379-1276


Conference28th Wireless and Optical Communications Conference, WOCC 2019


Dive into the research topics of 'Rate balancing in full-duplex MIMO two-way relay networks'. Together they form a unique fingerprint.

Cite this