An Efficient Direct Solution of Cave-Filling Problems

作者：Naidu Kalpana^*; Khan Mohammed Zafar Ali; Hanzo Lajos

来源：IEEE Transactions on Communications, 2016, 64(7): 3064-3077.

DOI：10.1109/TCOMM.2016.2560813

• Weighted waterfilling problem
• Peak power constraint
• less number of flops
• sum-power constraint
• cave waterfilling

Waterfilling problems subjected to peak power constraints are solved, which are known as cave-filling problems (CFP). The proposed algorithm finds both the optimum number of positive powers and the number of resources that are assigned the peak power before finding the specific powers to be assigned. The proposed solution is non-iterative and results in a computational complexity, which is of the order of M, O(M), where M is the total number of resources, which is significantly lower than that of the existing algorithms given by an order of M-2, O(M-2), under the same memory requirement and sorted parameters. The algorithm is then generalized both to weighted CFP (WCFP) and WCFP requiring the minimum power. These extensions also result in a computational complexity of the order of M, O(M). Finally, simulation results corroborating the analysis are presented.

• 出版日期2016-7