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 quasi-convex. 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.
| Original language | English |
|---|---|
| Article number | 4686849 |
| Pages (from-to) | 4681-4691 |
| Number of pages | 11 |
| Journal | IEEE Transactions on Wireless Communications |
| Volume | 7 |
| Issue number | 11 |
| DOIs | |
| State | Published - Nov 2008 |
| Externally published | Yes |
Bibliographical note
Funding Information:Manuscript received July 9, 2007; revised January 5, 2008; accepted June 14, 2008. The associate editor coordinating the review of this paper and approving it for publication was M. Uysal. This work was supported in part by a Premier’s Research Excellence Award from the Government of Ontario. The work of the second author is also supported in part by the Canada Research Chairs program. Preliminary versions of portions of this work appear in Proc. 2008 IEEE Wireless Commun. Networking Conf. and in Proc. 2008 IEEE Int. Conf. Acoust., Speech, Signal Processing.
Keywords
- Achievable rate region
- Amplify-and-forward relaying
- Cooperative multiple access
- Quasi-convexity
ASJC Scopus subject areas
- Computer Science Applications
- Electrical and Electronic Engineering
- Applied Mathematics