The Fastest Possible Solution to the Weighted Water-Filling Problems

In this paper, Weighted water-filling problem (WeWF) is solved with lesser computational complexity. Unlike previous algorithms, the proposed algorithm finds initially the lower bound and upper bound for the number of positive powers (L) first and using these bounds, L is computed later. The proposed algorithm calculates these bounds with minute number of noise levels whereas existing algorithms considers all noise levels for computing L. This uniqueness of the proposed algorithm reduces the number of floating point operations. Also, with out computing the water level itself, L powers are computed from one another which again leads to lesser complexity.