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

W.E.A.E. Alhanafy, S. Weiss

Research output: Contribution to conferencePaper

161 Downloads (Pure)

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.
Original languageEnglish
Publication statusPublished - Oct 2009
EventThe Third Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA2009) 26-28 October - Amman, Jordan, October 2009
Duration: 1 Jan 1900 → …

Conference

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

Keywords

  • adaptive loading
  • discrete bitloading
  • power allocation
  • water-filling algorithms
  • constrained optimisation
  • greedy algorithms

Fingerprint Dive into the research topics of 'A new low-cost discrete bit loading using greedy power allocation'. Together they form a unique fingerprint.

Cite this