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.
Track
CCAT: Communications and Computer Applications and Technologies
Conference
3rd Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA 2009)
Congress
2009 Global Congress on Communications, Computers and Applications (GC-CCA 2009), 26-28 October 2009, Amman, Jordan
Pages
1-8
Topics
Signal Processing for Communications MIMO Wireless Communications
ISSN
2227-331X
DOI
BibTeX
@inproceedings{45CCA2009,
title={A New Low-Cost Discrete Bit Loading Using Greedy Power Allocation},
author={Waleed Al-Hanafy, and Stephan Weiss},
booktitle={2009 Global Congress on Communications, Computers and Applications (GC-CCA 2009)},
year={2009},
pages={1-8},
doi={}},
organization={Mosharaka for Research and Studies}
}
