Title :
Fast Computation of Generalized Waterfilling Problems
Author :
Kalpana, N. ; Khan, Mohammed Zafar Ali
Author_Institution :
Dept. of Electr. Eng., Indian Inst. of Technol., Hyderabad, Hyderabad, India
Abstract :
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.
Keywords :
MIMO communication; OFDM modulation; cognitive radio; computational complexity; iterative methods; 1-step WFP; GWFP; MIMO-OFDM system; cognitive radio; generalized waterfilling problem; iterative waterfilling algorithm; low complexity algorithm; worst case complexity; Closed-form solutions; Computational complexity; Nickel; Noise level; OFDM; Signal processing algorithms; Fast computation; generalized waterfilling problem; iterative waterfilling algorithm;
Journal_Title :
Signal Processing Letters, IEEE
DOI :
10.1109/LSP.2015.2440653
