Sum-rate maximisation comparison using incremental approaches with different constraints

Waleed Al-Hanafy, S. Weiss

Research output: Contribution to conferencePaper

Abstract

In this work, the problem of rate maximisation of multichannel systems is considered. Two greedy allocation approaches using power (GPA) and bit (GBA) loading schemes with a slight difference in design constraints that aiming to maximise the overall system throughput are compared. Both algorithms use incremental bit loading whereby, the GPA is designed with main interest of efficient power utilisation. Whereas, the GBA sacrifices power utilisation to another design issue of achieving an average bit error ratio (BER) less than the target BER. Simulation results shows that with GPA algorithm better throughput is gained over the GBA algorithm while the latter guaranteed less BER.

Conference

ConferenceThe Third Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA2009) 26-28 October
CityAmman, Jordan, October 2009
Period1/01/00 → …

Fingerprint

Electric power utilization
Throughput

Keywords

  • incremental bit-loading
  • power allocation
  • waterfilling algorithms
  • constrained optimisation
  • greedy algorithms

Cite this

Al-Hanafy, W., & Weiss, S. (2009). Sum-rate maximisation comparison using incremental approaches with different constraints. Paper presented at The Third Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA2009) 26-28 October, Amman, Jordan, October 2009, .
Al-Hanafy, Waleed ; Weiss, S. / Sum-rate maximisation comparison using incremental approaches with different constraints. Paper presented at The Third Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA2009) 26-28 October, Amman, Jordan, October 2009, .
@conference{09e36aa271294e2caaae09f043da08c2,
title = "Sum-rate maximisation comparison using incremental approaches with different constraints",
abstract = "In this work, the problem of rate maximisation of multichannel systems is considered. Two greedy allocation approaches using power (GPA) and bit (GBA) loading schemes with a slight difference in design constraints that aiming to maximise the overall system throughput are compared. Both algorithms use incremental bit loading whereby, the GPA is designed with main interest of efficient power utilisation. Whereas, the GBA sacrifices power utilisation to another design issue of achieving an average bit error ratio (BER) less than the target BER. Simulation results shows that with GPA algorithm better throughput is gained over the GBA algorithm while the latter guaranteed less BER.",
keywords = "incremental bit-loading, power allocation, waterfilling algorithms, constrained optimisation, greedy algorithms",
author = "Waleed Al-Hanafy and S. Weiss",
year = "2009",
month = "10",
day = "26",
language = "English",
note = "The Third Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA2009) 26-28 October ; Conference date: 01-01-1900",

}

Al-Hanafy, W & Weiss, S 2009, 'Sum-rate maximisation comparison using incremental approaches with different constraints' Paper presented at The Third Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA2009) 26-28 October, Amman, Jordan, October 2009, 1/01/00, .

Sum-rate maximisation comparison using incremental approaches with different constraints. / Al-Hanafy, Waleed; Weiss, S.

2009. Paper presented at The Third Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA2009) 26-28 October, Amman, Jordan, October 2009, .

Research output: Contribution to conferencePaper

TY - CONF

T1 - Sum-rate maximisation comparison using incremental approaches with different constraints

AU - Al-Hanafy, Waleed

AU - Weiss, S.

PY - 2009/10/26

Y1 - 2009/10/26

N2 - In this work, the problem of rate maximisation of multichannel systems is considered. Two greedy allocation approaches using power (GPA) and bit (GBA) loading schemes with a slight difference in design constraints that aiming to maximise the overall system throughput are compared. Both algorithms use incremental bit loading whereby, the GPA is designed with main interest of efficient power utilisation. Whereas, the GBA sacrifices power utilisation to another design issue of achieving an average bit error ratio (BER) less than the target BER. Simulation results shows that with GPA algorithm better throughput is gained over the GBA algorithm while the latter guaranteed less BER.

AB - In this work, the problem of rate maximisation of multichannel systems is considered. Two greedy allocation approaches using power (GPA) and bit (GBA) loading schemes with a slight difference in design constraints that aiming to maximise the overall system throughput are compared. Both algorithms use incremental bit loading whereby, the GPA is designed with main interest of efficient power utilisation. Whereas, the GBA sacrifices power utilisation to another design issue of achieving an average bit error ratio (BER) less than the target BER. Simulation results shows that with GPA algorithm better throughput is gained over the GBA algorithm while the latter guaranteed less BER.

KW - incremental bit-loading

KW - power allocation

KW - waterfilling algorithms

KW - constrained optimisation

KW - greedy algorithms

M3 - Paper

ER -

Al-Hanafy W, Weiss S. Sum-rate maximisation comparison using incremental approaches with different constraints. 2009. Paper presented at The Third Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA2009) 26-28 October, Amman, Jordan, October 2009, .