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.
|Publication status||Published - 26 Oct 2009|
|Event||The Third Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA2009) 26-28 October - Amman, Jordan, October 2009|
Duration: 1 Jan 1900 → …
|Conference||The Third Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA2009) 26-28 October|
|City||Amman, Jordan, October 2009|
|Period||1/01/00 → …|
- incremental bit-loading
- power allocation
- waterfilling algorithms
- constrained optimisation
- greedy algorithms
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, .