Low Complexity Greedy Power Allocation Algorithm for Proportional Resource Allocation in Multi-User OFDM Systems

Authors

  • Moawad I. Dessouky
  • Waleed E. Al-Hanafy
  • Najib A. Odhah
  • Fathi E. Abd El-Samie

DOI:

https://doi.org/10.26636/jtit.2012.4.1290

Keywords:

GPA, MU-OFDM, proportional resource allocation, sum-rate capacity

Abstract

Multi-User Orthogonal Frequency Division Multiplexing (MU-OFDM) is an efficient technique for achieving high downlink capacity in high-speed communication systems. A key issue in MU-OFDM is the allocation of the OFDM subcarriers and power to users sharing the channel. In this paper a proportional rate-adaptive resource allocation algorithm for MU-OFDM is presented. Subcarrier and power allocation are carried out sequentially to reduce the complexity. The low complexity proportional subcarriers allocation is followed by Greedy Power Allocation (GPA) to solve the rate-adaptive resource allocation problem with proportional rate constraints for MU-OFDM systems. It improves the work of Wong et al. in this area by introducing an optimal GPA that achieves approximate rate proportionality, while maximizing the total sum-rate capacity of MU-OFDM. It is shown through simulation that the proposed GPA algorithm performs better than the algorithm of Wong et al., by achieving higher total capacities with the same computational complexity, especially, at larger number of users and roughly satisfying user rate proportionality.

Downloads

Download data is not yet available.

Downloads

Published

2012-12-30

Issue

Section

ARTICLES FROM THIS ISSUE

How to Cite

[1]
M. I. Dessouky, W. E. Al-Hanafy, N. A. Odhah, and F. E. A. El-Samie, “Low Complexity Greedy Power Allocation Algorithm for Proportional Resource Allocation in Multi-User OFDM Systems”, JTIT, vol. 50, no. 4, pp. 38–45, Dec. 2012, doi: 10.26636/jtit.2012.4.1290.

Most read articles by the same author(s)