C32. Greedy power allocation algorithm for proportional resource allocation in multi-user OFDM systems
Najib A. Odhah, Moawad Ibrahim Dessouky, Waleed E. Al-Hanafy, Fathi E. Abd El‐Samie
Abstract
Najib A. Odhah, Moawad Ibrahim Dessouky, Waleed E. Al-Hanafy, Fathi E. Abd El‐Samie
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 on the work of Wong et al. in this area by introducing 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 higher number of users.
OpenAlex reports 15 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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 on the work of Wong et al. in this area by introducing 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 higher number of users.
Key concepts: Orthogonal frequency-division multiplexing, Subcarrier, Resource allocation, Computer science, Telecommunications link, Computational complexity theory, Greedy algorithm, Max-min fairness