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.

[thumbnail of strathprints027152.pdf]
Preview
 PDF. Filename: 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.

ORCID iDs

Alhanafy, W.E.A.E. and Weiss, S. ORCID logoORCID: https://orcid.org/0000-0002-3486-7206;
CORE (COnnecting REpositories)