Adaptive power loading based on unequal-BER strategy for OFDM systems
IEEE Communications Letters
Simple bit allocation algorithms with BER-constraint for OFDM-based systems
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Bit rate maximization loading algorithm with mean BER-constraint for linear precoded OFDM
ICT'09 Proceedings of the 16th international conference on Telecommunications
ICT'09 Proceedings of the 16th international conference on Telecommunications
An efficient bit-loading algorithm with peak BER constraint for the band-extended PLC
ICT'09 Proceedings of the 16th international conference on Telecommunications
Mean BER minimization loading algorithm for linear precoded OFDM
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
Optimum power loading with arbitrary square MQAM for OFDM systems
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
IEEE Transactions on Information Theory
Constant-Power Bit Loading for Multicarrier Systems: BER-Allocation
Wireless Personal Communications: An International Journal
Robustness maximization of parallel multichannel systems
Journal of Electrical and Computer Engineering - Special issue on Resource Allocation in Communications and Computing
Data Rate Loss Due to Quantized SNR Estimates in Adaptive Bit Loading Algorithms
Wireless Personal Communications: An International Journal
Wireless Personal Communications: An International Journal
Hi-index | 0.07 |
We present discrete adaptive bit loading algorithms for multicarrier systems with uniform (nonadaptive) power allocation operating in a frequency selective fading environment. The algorithms try to maximize the overall throughput of the system while guaranteeing that the mean bit error rate (BER) remains below a prescribed threshold. We also study the impact of imperfect subcarrier signal-to-noise ratio information on throughput performance. Results show that the proposed algorithms have approximately the same throughput and mean BER as the optimal allocation while having a significantly lower computational complexity relative to other algorithms with near-optimal allocations. Moreover, when compared with algorithms that employ approximations to water filling, the computational complexity is comparable while the overall throughput is closer to the optimum.