Sum Power Minimization for TDD-Enabled Full-Duplex Bi-Directional MIMO Systems Under Channel Uncertainty

Authors

O. Taghizadeh, A. C. Cirik, R. Mathar, L. Lampe,

Abstract

        In this paper we address a sum power minimization problem for a bi-directional and full-duplex (FD) communication system, where the required rate constraints are imposed on the guaranteed communication rates in each direction. In this regard, the impact of channel-state information (CSI) error, as well as the signal distortion due to hardware impairments are jointly taken into account. In order to ensure backwards compatibility to an equivalent half-duplex setup, we assume a time-division-duplex capable system where the FD communication process takes place in multiple independent time segments. Due to the intractable structure of the resulting optimization problem, a weighted minimum mean squared-error based method is applied to cast the power minimization problem into a separately convex structure, which can be iteratively solved with a guaranteed convergence. The resulting computational complexity of the algorithm is then discussed analytically. Finally, the performance of the proposed algorithm is numerically evaluated over different levels of rate demand, CSI error and transmitter/receiver dynamic range.

BibTEX Reference Entry 

@inproceedings{TaCiMaLa17,
	author = {Omid Taghizadeh and Ali Cagatay Cirik and Rudolf Mathar and Lutz Lampe},
	title = "Sum Power Minimization for TDD-Enabled Full-Duplex Bi-Directional {MIMO} Systems Under Channel Uncertainty",
	pages = "412-417",
	booktitle = "European Wireless 2017 (EW2017)",
	address = {Dresden, Germany},
	month = May,
	year = 2017,
	hsb = RWTH-2017-05807,
	}

Downloads

 Download paper  Download bibtex-file

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights there in are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.