Abstract
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. © 2007 IEEE.
| Original language | English |
|---|---|
| Pages (from-to) | 1091-1100 |
| Journal | IEEE Journal on Selected Areas in Communications |
| Volume | 25 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - Aug 2007 |
Research Keywords
- Gaussian interference channel
- Iterative water-filling
- Nash equilibrium
Fingerprint
Dive into the research topics of 'Convergence of iterative waterfilling algorithm for Gaussian interference channels'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver