Suboptimal greedy power allocation schemes for discrete bit loading

Waleed Eid Abdelrahman Alhanafy, Stephan Weiss

Research output: Contribution to journalArticle

Abstract

In this paper we consider low cost discrete bit loading based on greedy power allocation (GPA) under the constraints of total transmit power budget, target BER, and maximum permissible QAM modulation order. Compared to the standard GPA, which is optimal in terms of maximising the data throughput, three suboptimal schemes are proposed, which perform GPA on subsets of subchannels only. These subsets are created by considering the minimum SNR boundaries of QAM levels for a given target BER. We demonstrate how these schemes can significantly reduce the computational complexity required for power allocation, particularly in the case of a large number of subchannels. Two of the proposed algorithms can achieve near optimal performance 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, while greatly reducing complexity, perform best in two separate and distinct SNR regions.
LanguageEnglish
Article number370261
Number of pages11
JournalScientificWorld Journal
Volume2013
DOIs
Publication statusPublished - 2013

Fingerprint

Quadrature amplitude modulation
Costs and Cost Analysis
Budgets
Costs
Computational complexity
Throughput
Modulation
cost
allocation
simulation

Cite this

@article{1be87b5183544c6287f109cfe4194a07,
title = "Suboptimal greedy power allocation schemes for discrete bit loading",
abstract = "In this paper we consider low cost discrete bit loading based on greedy power allocation (GPA) under the constraints of total transmit power budget, target BER, and maximum permissible QAM modulation order. Compared to the standard GPA, which is optimal in terms of maximising the data throughput, three suboptimal schemes are proposed, which perform GPA on subsets of subchannels only. These subsets are created by considering the minimum SNR boundaries of QAM levels for a given target BER. We demonstrate how these schemes can significantly reduce the computational complexity required for power allocation, particularly in the case of a large number of subchannels. Two of the proposed algorithms can achieve near optimal performance 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, while greatly reducing complexity, perform best in two separate and distinct SNR regions.",
author = "Alhanafy, {Waleed Eid Abdelrahman} and Stephan Weiss",
year = "2013",
doi = "10.1155/2013/370261",
language = "English",
volume = "2013",
journal = "ScientificWorld Journal",
issn = "1537-744X",

}

Suboptimal greedy power allocation schemes for discrete bit loading. / Alhanafy, Waleed Eid Abdelrahman; Weiss, Stephan.

In: ScientificWorld Journal, Vol. 2013, 370261, 2013.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Suboptimal greedy power allocation schemes for discrete bit loading

AU - Alhanafy, Waleed Eid Abdelrahman

AU - Weiss, Stephan

PY - 2013

Y1 - 2013

N2 - In this paper we consider low cost discrete bit loading based on greedy power allocation (GPA) under the constraints of total transmit power budget, target BER, and maximum permissible QAM modulation order. Compared to the standard GPA, which is optimal in terms of maximising the data throughput, three suboptimal schemes are proposed, which perform GPA on subsets of subchannels only. These subsets are created by considering the minimum SNR boundaries of QAM levels for a given target BER. We demonstrate how these schemes can significantly reduce the computational complexity required for power allocation, particularly in the case of a large number of subchannels. Two of the proposed algorithms can achieve near optimal performance 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, while greatly reducing complexity, perform best in two separate and distinct SNR regions.

AB - In this paper we consider low cost discrete bit loading based on greedy power allocation (GPA) under the constraints of total transmit power budget, target BER, and maximum permissible QAM modulation order. Compared to the standard GPA, which is optimal in terms of maximising the data throughput, three suboptimal schemes are proposed, which perform GPA on subsets of subchannels only. These subsets are created by considering the minimum SNR boundaries of QAM levels for a given target BER. We demonstrate how these schemes can significantly reduce the computational complexity required for power allocation, particularly in the case of a large number of subchannels. Two of the proposed algorithms can achieve near optimal performance 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, while greatly reducing complexity, perform best in two separate and distinct SNR regions.

U2 - 10.1155/2013/370261

DO - 10.1155/2013/370261

M3 - Article

VL - 2013

JO - ScientificWorld Journal

T2 - ScientificWorld Journal

JF - ScientificWorld Journal

SN - 1537-744X

M1 - 370261

ER -