Picture of UK Houses of Parliament

Leading national thinking on politics, government & public policy through Open Access research

Strathprints makes available scholarly Open Access content by researchers in the School of Government & Public Policy, based within the Faculty of Humanities & Social Sciences.

Research here is 1st in Scotland for research intensity and spans a wide range of domains. The Department of Politics demonstrates expertise in understanding parties, elections and public opinion, with additional emphases on political economy, institutions and international relations. This international angle is reflected in the European Policies Research Centre (EPRC) which conducts comparative research on public policy. Meanwhile, the Centre for Energy Policy provides independent expertise on energy, working across multidisciplinary groups to shape policy for a low carbon economy.

Explore the Open Access research of the School of Government & Public Policy. Or explore all of Strathclyde's Open Access research...

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.

PDF (strathprints027158.pdf)

Download (398kB)| Preview


    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.