Abstract

We consider the jointly optimal allocation of the radio resources for a two-user orthogonal amplify-and-forward (AF) cooperation scheme. In particular, we derive a simple efficient algorithm for determining the power and channel resource allocations required to operate at any point on the boundary of the achievable rate region. The algorithm is based on two results derived herein: a closed-form solution for the optimal power allocation for a given channel resource allocation; and the fact that the channel resource allocation problem is quasiconvex. The structure of the optimal power allocation reveals that at optimality at most one user acts as a relay, and hence a fraction of the channel resource will be idle. We propose a modified orthogonal AF cooperation scheme that uses the channel resources more efficiently and hence provides a larger achievable rate region.

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.