Picture of a sphere with binary code

Making Strathclyde research discoverable to the world...

The Strathprints institutional repository is a digital archive of University of Strathclyde research outputs. It exposes Strathclyde's world leading Open Access research to many of the world's leading resource discovery tools, and from there onto the screens of researchers around the world.

Explore Strathclyde Open Access research content

A new low-cost discrete bit loading using greedy power allocation

Alhanafy, W.E.A.E. and Weiss, S. (2009) A new low-cost discrete bit loading using greedy power allocation. In: The Third Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA2009) 26-28 October, 1900-01-01.

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

Download (277kB) | Preview

Abstract

In this paper we consider a low cost bit loading based on the greedy power allocation (GPA). Compared to the standard GPA, which is optimal in terms of maximising the data throughput, three suboptimal schemes are suggested, which perform GPA on subsets of subchannels only. We demonstrate how these schemes can reduce complexity. Two of the proposed algorithms can achieve near optimal performance by including a transfer of residual power between subsets at the expense of a very small extra cost. By simulations, we show that the two near optimal schemes perform best in two separate and distinct SNR regions.