On constant power water-filling

This paper derives a rigorous performance bound for the constant-power water-filling algorithm for ISI channels with multicarrier modulation and for i.i.d. fading channels with adaptive modulation. Based on the performance bound, a very-low complexity logarithm-free power allocation algorithm is proposed. Theoretical worst-case analysis and simulation show that the approximate water-filling scheme is close to optimal.

[1]  A. Goldsmith,et al.  Variable-rate variable-power MQAM for fading channels , 1996, Proceedings of Vehicular Technology Conference - VTC.

[2]  M. Trott,et al.  Sub-optimal power spectra for colored Gaussian channels , 1997, Proceedings of IEEE International Symposium on Information Theory.

[3]  Pravin Varaiya,et al.  Capacity of fading channels with channel side information , 1997, IEEE Trans. Inf. Theory.