Low Complexity Resource Allocation for QF VMIMO Receivers with a Shared Backhaul


Tim Rüegg, Yahia Hassan, and Armin Wittneben


IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), Montréal, Canada, Oct. 2017, to appear.

[BibTeX, LaTeX, and HTML Reference]


In this paper, we consider the resource allo- cation problem of a quantize-and-forward virtual MIMO receive cooperation scheme, where N sources simultaneously communicate over N relays to a destination. Different to previous work, the second hop links are considered to be non-orthogonal (i.e. a shared backhaul) but with individual rate constraints. This requires a careful resource allocation, leading to an involved non-convex optimization problem. The goal of this paper is to provide and evaluate computationally simple and robust resource allocation algorithms. In this context, we devise two low complexity schemes which simply select a subset of relays and assign equal resources to them. In thorough numerical simulations we then demonstrate that for moderate backhaul rates (as to be expected in wireless virtual MIMO), it is beneficial to serve only a subset of the relays. Furthermore, while large gains are achievable by selecting the optimal relays and assigning equal resources to them, only minor additional gains can be achieved by further optimizing the resource allocation among them, e.g., with a gradient search. Hence, the proposed relay selection schemes lead to very good performance and are a reasonable alternative to costly optimization techniques if low complexity is required.

Download this document:


Copyright Notice: © 2017 T. Rüegg, Y. Hassan, and A. Wittneben.

This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein 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.