Alhanafy, W.E.A.E. and Weiss, S. (2009) A new low-cost discrete bit loading using greedy power allocation. In: The Third Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA2009) 26-28 October, 1900-01-01.
Download (277kB) | Preview
In this paper we consider a low cost bit loading based on the greedy power allocation (GPA). Compared to the standard GPA, which is optimal in terms of maximising the data throughput, three suboptimal schemes are suggested, which perform GPA on subsets of subchannels only. 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 subsets at the expense of a very small extra cost. By simulations, we show that the two near optimal schemes perform best in two separate and distinct SNR regions.
|Item type:||Conference or Workshop Item (Paper)|
|Keywords:||adaptive loading, discrete bitloading, power allocation, water-filling algorithms, constrained optimisation, greedy algorithms, Electrical engineering. Electronics Nuclear engineering|
|Subjects:||Technology > Electrical engineering. Electronics Nuclear engineering|
|Department:||Faculty of Engineering > Electronic and Electrical Engineering|
|Depositing user:||Strathprints Administrator|
|Date Deposited:||18 Apr 2011 15:52|
|Last modified:||23 Nov 2016 21:28|