Fast Algorithm for Solving Cave-filling Problems

Naidu, Kalpana and Khan, Mohammed Zafar Ali (2016) Fast Algorithm for Solving Cave-filling Problems. In: 84th IEEE Vehicular Technology Conference (VTC-Fall), SEP 18-21, 2016, Montreal, CANADA.

Full text not available from this repository. (Request a copy)

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.

[error in script]

IITH Creators:	IITH Creators ORCiD Khan, Mohammed Zafar Ali UNSPECIFIED
Item Type:	Conference or Workshop Item (Paper)
Uncontrolled Keywords:	Peak power constraint; Cave-filling; Water-Filling; Iterative; fast
Subjects:	Electrical Engineering
Divisions:	Department of Electrical Engineering
Depositing User:	Team Library
Date Deposited:	30 Jun 2017 11:56
Last Modified:	26 Sep 2017 04:49
URI:	http://raiithold.iith.ac.in/id/eprint/3321
Publisher URL:	https://doi.org/10.1109/VTCFall.2016.7881014
Related URLs:	Google Scholar

Actions (login required)

View Item

Statistics for this ePrint Item