Computer Science – Information Theory
Scientific paper
2011-05-02
Computer Science
Information Theory
13 pages and 14 figures, to appear in IEEE Transactions Signal Processing
Scientific paper
This paper considers the weighted sum rate (WSR) maximized resource allocation (RA) constrained by a system sum power in an orthogonal frequency division multiple access (OFDMA) downlink transmission system assisted by multiple decode-and-forward (DF) relays. In particular, multiple relays may cooperate with the source for every relay-aided transmission. A two-step algorithm is proposed to find the globally optimum RA. In the first step, the optimum source/relay power and assisting relays that maximize the rate is found for every combination of subcarrier and destination, assuming a sum power is allocated to the transmission at that subcarrier to that destination in the relay-aided transmission mode and the direct mode, respectively. In the second step, a convex-optimization based algorithm is designed to find the globally optimum assignment of destination, transmission mode, and sum power for each subcarrier to maximize the WSR. Combining the RAs found in the two steps, the globally optimum RA can be found. In addition, we show that the optimum RA in the second step can readily be derived when the system sum power is very high. The effectiveness of the proposed algorithm is illustrated by numerical experiments.
Vandendorpe Luc
Wang Tao
No associations
LandOfFree
WSR Maximized Resource Allocation in Multiple DF Relays Aided OFDMA Downlink Transmission does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with WSR Maximized Resource Allocation in Multiple DF Relays Aided OFDMA Downlink Transmission, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and WSR Maximized Resource Allocation in Multiple DF Relays Aided OFDMA Downlink Transmission will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-426776