On constant power water-filling

Author

Yu, Wei ; Cioffi, John M.

Author_Institution

Dept. of Electr. Eng., Stanford Univ., CA, USA

Volume

6

fYear

2001

fDate

2001

Firstpage

1665

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

Keywords

Rayleigh channels; adaptive modulation; approximation theory; computational complexity; intersymbol interference; ISI; ISI channels; Rayleigh channel; adaptive modulation; approximate power adaptation algorithms; approximate water-filling scheme; constant-power water-filling algorithm; i.i.d. fading channels; intersymbol interference; logarithm-free power allocation algorithm; multicarrier modulation; performance bound; simulation; very-low complexity power allocation algorithm; worst-case analysis; Analytical models; Channel estimation; Communication channels; Discrete Fourier transforms; Fading; Intersymbol interference; Signal to noise ratio; State feedback; Statistics; Transmitters;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 2001. ICC 2001. IEEE International Conference on

Conference_Location

Helsinki

Print_ISBN

0-7803-7097-1

Type

conf

DOI

10.1109/ICC.2001.937077

Filename

937077