Fast Algorithm for Solving Cave-Filling Problems

In this paper, a novel approach for solving the `Water- filling problem with peak power constraints for individual resources' also known as Cave-Filling Problem (CFP) is proposed. The proposed algorithm calculates a lower bound for the number of resources that are assigned positive powers, K, and then calculates the K powers only once. This lowers the total computational cost of the proposed algorithm significantly. Simulation results validate the proposed algorithm.