Hybrid Hughes-Hartogs power allocation algorithms for OFDMA systems

Hybrid Hughes-Hartogs power allocation algorithms for OFDMA systems

For access to this article, please select a purchase option:

Buy eFirst article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Signal Processing — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

This work analyses the discrete solution of Hughes-Hartogs (HH) for the transmission rate maximisation problem with power constraint in the orthogonal frequency division multiplexing access (OFDMA) systems and explores mechanisms to reduce the computational complexity of greedy algorithms. In addition to the solution characterisation, a computational complexity analysis is developed, considering the number of executed operations for running time purpose. Moreover, the authors have compared the system capacity via the throughput obtained with the HH solution, and its variants combined with three complexity reduction mechanisms. These tools consist of an initial allocation bit vector calculated by rounding the results of the water-filling (WF) solution, the multiple subchannels per iteration updating and the adoption of a subchannel grouping procedure. Their findings indicate that the update of multiple subchannels and the subcarriers grouping techniques reduce the number of iterations required for convergence of the original HH, with some throughput degradation. Also, the bit-allocation mechanism based on the WF is deployed as an alternative to overcome the HH solution, increasing the computational complexity.

Related content

This is a required field
Please enter a valid email address