Reduced complexity schemes to greedy power allocation for multicarrier systems

Waleed Al-Hanafy, S. Weiss

Research output: Contribution to conferencePaper

1 Citation (Scopus)
250 Downloads (Pure)

Abstract

Discrete bit loading for multicarrier systems based on the greedy power allocation (GPA) algorithm is considered in this paper. A new suboptimal scheme that independently performs GPA on groups of subcarriers and therefore can significantly reduce complexity compared to the standard GPA is proposed. These groups are formed in an initial step of a uniform power allocation (UPA) algorithm. In order to more efficiently allocate the available transmit power, two power re-distribution algorithms are further introduced by including a transfer of residual power between groups. Simulation results show that the two proposed algorithms can achieve near optimal performance in two separate and distinctive SNR regions. We demonstrate by analysis how these methods can greatly simplify the computational complexity of the GPA algorithm.
Original languageEnglish
Publication statusPublished - 14 Jun 2010
EventThe 18th International Conference on Microwave, Radar and Wireless Communications MIKON-2010 - Vilnius, Lithuania
Duration: 14 Jun 201018 Jun 2010

Conference

ConferenceThe 18th International Conference on Microwave, Radar and Wireless Communications MIKON-2010
CityVilnius, Lithuania
Period14/06/1018/06/10

Keywords

  • complexity schemes
  • multicarrier systems
  • wireless communications
  • radar

Fingerprint Dive into the research topics of 'Reduced complexity schemes to greedy power allocation for multicarrier systems'. Together they form a unique fingerprint.

  • Cite this

    Al-Hanafy, W., & Weiss, S. (2010). Reduced complexity schemes to greedy power allocation for multicarrier systems. Paper presented at The 18th International Conference on Microwave, Radar and Wireless Communications MIKON-2010, Vilnius, Lithuania, .