Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

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, Amman, Jordan, October 2009.

[img]
Preview
PDF (strathprints027152.pdf)
Download (270Kb) | 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.

    Item type: Conference or Workshop Item (Paper)
    ID code: 14948
    Keywords: adaptive loading, discrete bitloading, power allocation, water-filling algorithms, constrained optimisation, greedy algorithms, Electrical engineering. Electronics Nuclear engineering
    Subjects: Technology > Electrical engineering. Electronics Nuclear engineering
    Department: Faculty of Engineering > Electronic and Electrical Engineering
    Related URLs:
      Depositing user: Strathprints Administrator
      Date Deposited: 18 Apr 2011 16:52
      Last modified: 06 Oct 2012 08:28
      URI: http://strathprints.strath.ac.uk/id/eprint/14948

      Actions (login required)

      View Item

      Fulltext Downloads: