Header menu link for other important links
X
Fast algorithm for solving cave-filling problems
Published in Institute of Electrical and Electronics Engineers Inc.
2016
Volume: 0
   
Abstract
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. © 2016 IEEE.
About the journal
JournalData powered by TypesetIEEE Vehicular Technology Conference
PublisherData powered by TypesetInstitute of Electrical and Electronics Engineers Inc.
ISSN15502252