On constant power water-filling

Abstract

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.