Fast Computation of Generalized Waterfilling Problems

Naidu, Kalpana and Khan, Mohammed Zafar Ali (2015) Fast Computation of Generalized Waterfilling Problems. IEEE Signal Processing Letters, 22 (11). pp. 1884-1887. ISSN 1070-9908

Full text not available from this repository. (Request a copy)


In this letter, we present a novel method of solving the Generalized Waterfilling problem (GWFP) using equivalence with a waterfilling problem (WFP) which has a closed form solution. Consequentially, a class of WFPs with only one-step called `1-step' WFP is used to derive a low complexity algorithm which has the smallest worst case complexity reported. The proposed algorithm is verified by simulations.

[error in script]
IITH Creators:
IITH CreatorsORCiD
Khan, Mohammed Zafar AliUNSPECIFIED
Item Type: Article
Uncontrolled Keywords: Closed-form solutions, Computational complexity, Nickel, Noise level, OFDM, Signal processing algorithms, Fast computation, generalized waterfilling problem, iterative waterfilling algorithm,
Subjects: Others > Electricity
Divisions: Department of Electrical Engineering
Depositing User: Team Library
Date Deposited: 30 Jul 2015 06:13
Last Modified: 26 Sep 2017 04:46
Publisher URL:
OA policy:
Related URLs:

Actions (login required)

View Item View Item
Statistics for RAIITH ePrint 1712 Statistics for this ePrint Item