Picture map of Europe with pins indicating European capital cities

Open Access research with a European policy impact...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by Strathclyde researchers, including by researchers from the European Policies Research Centre (EPRC).

EPRC is a leading institute in Europe for comparative research on public policy, with a particular focus on regional development policies. Spanning 30 European countries, EPRC research programmes have a strong emphasis on applied research and knowledge exchange, including the provision of policy advice to EU institutions and national and sub-national government authorities throughout Europe.

Explore research outputs by the European Policies Research Centre...

Reduced complexity schemes to greedy power allocation for multicarrier systems

Al-Hanafy, Waleed and Weiss, S. (2010) Reduced complexity schemes to greedy power allocation for multicarrier systems. In: The 18th International Conference on Microwave, Radar and Wireless Communications MIKON-2010, 2010-06-14 - 2010-06-18.

[img]
Preview
PDF (strathprints027158.pdf)
strathprints027158.pdf

Download (398kB) | Preview

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.