Greedy power allocation for multicarrier systems with reduced complexity

Waleed Al-Hanafy, S. Weiss

Research output: Contribution to conferencePaper

120 Downloads (Pure)

Abstract

In this paper we consider a reduced complexity discrete bit loading for Multicarrier systems based on the greedy power allocation (GPA) under the constraints of 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 subcarriers only. These subsets are created by considering the minimum SNR boundaries of QAM levels for a given BER. 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 groups at the expense of a very small extra cost. It is shown that the two near optimal schemes,while greatly reducing complexity, perform best in two separate and distinct SNR regions.
Original languageEnglish
Publication statusPublished - 16 Mar 2010
EventThe 27th National Radio Science Conference, NRSC 2010 - Menouf, Egypt
Duration: 16 Mar 201018 Mar 2010

Conference

ConferenceThe 27th National Radio Science Conference, NRSC 2010
CityMenouf, Egypt
Period16/03/1018/03/10

Keywords

  • greedy power allocation
  • multicarrier systems
  • r

Fingerprint Dive into the research topics of 'Greedy power allocation for multicarrier systems with reduced complexity'. Together they form a unique fingerprint.

  • Cite this

    Al-Hanafy, W., & Weiss, S. (2010). Greedy power allocation for multicarrier systems with reduced complexity. Paper presented at The 27th National Radio Science Conference, NRSC 2010, Menouf, Egypt, .