By Topic

Iterative and greedy resource allocation in an uplink OFDMA system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Keunyoung Kim ; Sch. of Eng., Information & Commun. Univ., South Korea ; Hoon Kim ; Youngnam Han ; Seong-Lyun Kim

We suggest an iterative power and greedy subcarrier allocation algorithm to improve rate-sum capacity in an uplink OFDMA system. For the downlink, it has been accepted as an optimal solution that each subcarrier is allocated to the user with the best channel condition and power is allocated by water-filling over subcarriers. However, it is not true in an uplink OFDMA system which has distributive power constraints. We formulate the optimization problem having constraints power and subcarriers in uplink, then draw two necessary conditions for optimality. Using the conditions, we propose a greedy subcarrier allocation algorithm based a marginal rate junction and iterative power allocation algorithm based on water-filling. Simulation results show that the enhanced system capacity is achieved by our proposed scheme.

Published in:

Personal, Indoor and Mobile Radio Communications, 2004. PIMRC 2004. 15th IEEE International Symposium on  (Volume:4 )

Date of Conference:

5-8 Sept. 2004