The Fastest possible solution to the Weighted Water-Filling Problems

被引:0
作者
Naidu, Kalpana [1 ,2 ]
Kumar, Aytha Ramesh
Vikas, Vinjamoori
机构
[1] IIIT Kota, Dept ECE, Jaipur, Rajasthan, India
[2] VNR VJIET, Dept ECE, Hyderabad, Andhra Pradesh, India
来源
2017 7TH IEEE INTERNATIONAL ADVANCE COMPUTING CONFERENCE (IACC) | 2017年
关键词
Weighted water filling problem; computational complexity; less number of flops;
D O I
10.1109/IACC.2017.121
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:614 / 618
页数:5
相关论文
共 8 条
  • [1] Closed form solutions for water-filling problems in optimization and game frameworks
    Altman, Eitan
    Avrachenkov, Konstantin
    Garnaev, Andrey
    [J]. TELECOMMUNICATION SYSTEMS, 2011, 47 (1-2) : 153 - 164
  • [2] He P., 2013, IEEE T WIRELESS COMM, V12
  • [3] Fast Computation of Generalized Waterfilling Problems
    Kalpana, N.
    Khan, Mohammed Zafar Ali
    [J]. IEEE SIGNAL PROCESSING LETTERS, 2015, 22 (11) : 1884 - 1887
  • [4] An Efficient Direct Solution of Cave-Filling Problems
    Naidu, Kalpana
    Khan, Mohammed Zafar Ali
    Hanzo, Lajos
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2016, 64 (07) : 3064 - 3077
  • [5] Practical algorithms for a family of waterfilling solutions
    Palomar, DP
    Fonollosa, JR
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2005, 53 (02) : 686 - 695
  • [6] YU W, 2002, IEEE J SEL AREAS COM, V20
  • [7] Cognitive Multiple Access Channels: Optimal Power Allocation for Weighted Sum Rate Maximization
    Zhang, Lan
    Xin, Yan
    Liang, Ying-Chang
    Poor, H. Vincent
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2009, 57 (09) : 2754 - 2762
  • [8] Zhang X., 2008, IEEE T SIGNAL PROCES, V56