Abstract

This article deals with inter-relay power allocation for multiple-input multiple-output systems with multiple single-antenna relays. It is difficult to derive an optimal solution in a closed form for the case of multiple multi-antenna relays as well as the case of multiple single-antenna relays. In this article, we propose an approximate solution which is effective only for the case of multiple single-antenna relays. A key contribution of this article is a low complexity inter-relay power allocation method which is based on relay selection. This approach also reduces the feedback information of the gain factors of all the relays. An incremental greedy search algorithm is also proposed to further reduce the complexity of the relay selection process with negligible performance degradation. Simulations indicate that the performance is comparable to the optimal exhaustive search algorithm.

Highlights

  • 1 Introduction The relay channel was first studied by Meulen [1] and Cover and Gamal [2], which ignited research interest on the relay channel

  • We propose a relay selection based approach as an approximation to solve for the power allocation problem

  • 7 Conclusions In this article, we proposed a relay selection based approach for inter-relay power allocation problem

Read more

Summary

Introduction

The relay channel was first studied by Meulen [1] and Cover and Gamal [2], which ignited research interest on the relay channel. Many articles have considered different forwarding schemes at the relay node to use the system resource efficiently [3,4] They are usually classified by regenerative and non-regenerative methods depending on whether or not the source signal is regenerated at the relay node. The most general extension, i.e., a multipleantenna source and a multiple-antenna destination aided by multiple relays with multiple antennas, is considered in [16,17] They computed the precoding matrix which is used for forwarding in the second hop. [20] considered this simple system model, and derive an asymptotical capacity scaling law They did not deal with the relay power allocation problem as in this article. The diagonal matrix G depends on the first hop and the second hop channels, so it is difficult to obtain a closed form solution

Inter-relay power allocation
Uniform
Feedback requirement and computational complexity
Findings
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.