A1 João Henrique Inacio de Souza

A1 Taufik Abrão

PB iet

T1 Hybrid Hughes-Hartogs power allocation algorithms for OFDMA systems

JN IET Signal Processing

VO 12

IS 9

SP 1185

OP 1192

AB 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.

K1 multiple subchannels

K1 hybrid Hughes-Hartogs power allocation algorithms

K1 bit-allocation mechanism

K1 transmission rate maximisation problem

K1 power constraint

K1 OFDMA systems

K1 discrete solution

K1 iteration updating

K1 computational complexity analysis

K1 greedy algorithms

K1 initial allocation bit vector

K1 water-filling solution

K1 solution characterisation

K1 complexity reduction mechanisms

K1 HH solution

K1 subchannel grouping procedure

K1 system capacity

DO https://doi.org/10.1049/iet-spr.2018.5080

UL https://digital-library.theiet.org/;jsessionid=35cmjheutt33k.x-iet-live-01content/journals/10.1049/iet-spr.2018.5080

LA English

SN 1751-9675

YR 2018

OL EN