Picture of person typing on laptop with programming code visible on the laptop screen

World class computing and information science research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by researchers from the Department of Computer & Information Sciences involved in mathematically structured programming, similarity and metric search, computer security, software systems, combinatronics and digital health.

The Department also includes the iSchool Research Group, which performs leading research into socio-technical phenomena and topics such as information retrieval and information seeking behaviour.

Explore

Sum-rate maximisation comparison using incremental approaches with different constraints

Al-Hanafy, Waleed and Weiss, S. (2009) Sum-rate maximisation comparison using incremental approaches with different constraints. In: The Third Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA2009) 26-28 October, 1900-01-01.

[img]
Preview
PDF (strathprints027155.pdf)
strathprints027155.pdf

Download (259kB) | Preview

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.