Header menu link for other important links
X
Fast Computation of Generalized Waterfilling Problems
Published in Institute of Electrical and Electronics Engineers Inc.
2015
Volume: 22
   
Issue: 11
Pages: 1884 - 1887
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. © 1994-2012 IEEE.
About the journal
JournalData powered by TypesetIEEE Signal Processing Letters
PublisherData powered by TypesetInstitute of Electrical and Electronics Engineers Inc.
ISSN10709908