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

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

Research output: Contribution to conferencePaper

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.

Conference

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

Fingerprint

Throughput
Costs

Keywords

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

Cite this

Alhanafy, W. E. A. E., & Weiss, S. (2009). A new low-cost discrete bit loading using greedy power allocation. Paper presented at The Third Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA2009) 26-28 October, Amman, Jordan, October 2009, .
Alhanafy, W.E.A.E. ; Weiss, S. / A new low-cost discrete bit loading using greedy power allocation. Paper presented at The Third Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA2009) 26-28 October, Amman, Jordan, October 2009, .
@conference{353c1c9cc51e4394ae0c39e603b0de95,
title = "A new low-cost discrete bit loading using greedy power allocation",
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.",
keywords = "adaptive loading, discrete bitloading, power allocation, water-filling algorithms, constrained optimisation, greedy algorithms",
author = "W.E.A.E. Alhanafy and S. Weiss",
year = "2009",
month = "10",
language = "English",
note = "The Third Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA2009) 26-28 October ; Conference date: 01-01-1900",

}

Alhanafy, WEAE & Weiss, S 2009, 'A new low-cost discrete bit loading using greedy power allocation' Paper presented at The Third Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA2009) 26-28 October, Amman, Jordan, October 2009, 1/01/00, .

A new low-cost discrete bit loading using greedy power allocation. / Alhanafy, W.E.A.E.; Weiss, S.

2009. Paper presented at The Third Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA2009) 26-28 October, Amman, Jordan, October 2009, .

Research output: Contribution to conferencePaper

TY - CONF

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

AU - Alhanafy, W.E.A.E.

AU - Weiss, S.

PY - 2009/10

Y1 - 2009/10

N2 - 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.

AB - 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.

KW - adaptive loading

KW - discrete bitloading

KW - power allocation

KW - water-filling algorithms

KW - constrained optimisation

KW - greedy algorithms

M3 - Paper

ER -

Alhanafy WEAE, Weiss S. A new low-cost discrete bit loading using greedy power allocation. 2009. Paper presented at The Third Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA2009) 26-28 October, Amman, Jordan, October 2009, .