Convergence of iterative waterfilling algorithm for Gaussian interference channels

被引:216
作者
Shum, Kenneth W. [1 ]
Leung, Kin-Kwong
Sung, Chi Wan
机构
[1] City Univ Hong Kong, Dept Elect Engn, Kowloon, Hong Kong, Peoples R China
[2] Cluster Technol Ltd, Units 106 108, Shatin, Hong Kong, Peoples R China
关键词
Gaussian interference channel; iterative waterfilling; Nash equilibrium;
D O I
10.1109/JSAC.2007.070804
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Iterative waterfilling power allocation algorithm for Gaussian interference channels is investigated. The system is formulated as a non-cooperative game. Based on the measured interference powers, the users maximize their own throughput by iteratively adjusting their power allocations. The Nash equilibrium in this game is a fixed point of such iterative algorithm. Both synchronous and asynchronous power update are considered. Some sufficient conditions under which the algorithm converges to the Nash equilibrium are derived.
引用
收藏
页码:1091 / 1100
页数:10
相关论文
共 22 条
[1]  
Berge C., 1997, TOPOLOGICAL SPACES
[2]  
Bertsekas Dimitri P., 1989, PARALLEL DISTRIBUTED
[3]   DISTRIBUTED ASYNCHRONOUS COMPUTATION OF FIXED-POINTS [J].
BERTSEKAS, DP .
MATHEMATICAL PROGRAMMING, 1983, 27 (01) :107-120
[4]  
Boyd S., 2003, CONVEX OPTIMIZATION
[5]   Optimal multi-user spectrum management for digital subscriber lines [J].
Cendrillon, R ;
Moonen, M ;
Verliden, J ;
Bostoen, T ;
Yu, W .
2004 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-7, 2004, :1-5
[6]  
Chung ST, 2003, 2003 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, P2753
[7]  
Chung ST, 2003, 2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, P316
[8]  
CHUNG ST, 2003, THESIS STANFORD U
[9]  
Cover TM, 2006, Elements of Information Theory