Reduced complexity schemes to greedy power allocation for multicarrier systems

Waleed Al-Hanafy, S. Weiss

Research output: Contribution to conferencePaper

1 Citation (Scopus)

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.

Conference

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

Fingerprint

Computational complexity

Keywords

  • complexity schemes
  • multicarrier systems
  • wireless communications
  • radar

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, .
Al-Hanafy, Waleed ; Weiss, S. / 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, .
@conference{c7f9128b3ffc4a61a5827ffe320018dd,
title = "Reduced complexity schemes to greedy power allocation for multicarrier systems",
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.",
keywords = "complexity schemes, multicarrier systems, wireless communications, radar",
author = "Waleed Al-Hanafy and S. Weiss",
year = "2010",
month = "6",
day = "14",
language = "English",
note = "The 18th International Conference on Microwave, Radar and Wireless Communications MIKON-2010 ; Conference date: 14-06-2010 Through 18-06-2010",

}

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, 14/06/10 - 18/06/10, .

Reduced complexity schemes to greedy power allocation for multicarrier systems. / Al-Hanafy, Waleed; Weiss, S.

2010. Paper presented at The 18th International Conference on Microwave, Radar and Wireless Communications MIKON-2010, Vilnius, Lithuania, .

Research output: Contribution to conferencePaper

TY - CONF

T1 - Reduced complexity schemes to greedy power allocation for multicarrier systems

AU - Al-Hanafy, Waleed

AU - Weiss, S.

PY - 2010/6/14

Y1 - 2010/6/14

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

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

KW - complexity schemes

KW - multicarrier systems

KW - wireless communications

KW - radar

UR - http://www.strath.ac.uk/media/departments/eee/cesip/Waleed_Al_Hanafy.pdf

UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5540621

M3 - Paper

ER -

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