Asynchronous Iterative Water-Filling for Gaussian Frequency-Selective Interference Channels

DOI10.1109/TIT.2008.924723zbMATH Open1323.94088arXiv0801.2480OpenAlexW2167032653WikidataQ59010682 ScholiaQ59010682MaRDI QIDQ3604471FDOQ3604471

Gesualdo Scutari, Sergio Barbarossa, D. P. Palomar

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: This paper considers the maximization of information rates for the Gaussian frequency-selective interference channel, subject to power and spectral mask constraints on each link. To derive decentralized solutions that do not require any cooperation among the users, the optimization problem is formulated as a static noncooperative game of complete information. To achieve the so-called Nash equilibria of the game, we propose a new distributed algorithm called asynchronous iterative waterfilling algorithm. In this algorithm, the users update their power spectral density in a completely distributed and asynchronous way: some users may update their power allocation more frequently than others and they may even use outdated measurements of the received interference. The proposed algorithm represents a unified framework that encompasses and generalizes all known iterative waterfilling algorithms, e.g., sequential and simultaneous versions. The main result of the paper consists of a unified set of conditions that guarantee the global converge of the proposed algorithm to the (unique) Nash equilibrium of the game.

Full work available at URL: https://arxiv.org/abs/0801.2480

Recommendations

• Distributed Power Allocation With Rate Constraints in Gaussian Parallel Interference Channels
• Spectrum allocation for decentralized transmission strategies: properties of Nash equilibria
• Price-based interference avoidance game in the Gaussian interference channel
• Analysis of iterative waterfilling algorithm for multiuser power control in digital subscriber lines
• Shannon rate-efficient power allocation games

Mathematics Subject Classification ID

Cooperative games (91A12) Applications of game theory (91A80) Channel models (including quantum) in information and communication theory (94A40)

Cited In (14)

• Spectrum allocation for decentralized transmission strategies: properties of Nash equilibria
• Learning Equilibria of a Stochastic Game on Gaussian Interference Channels with Incomplete Information
• Three modeling paradigms in mathematical programming
• Network Games with Strategic Machine Learning
• A STOCHASTIC APPROXIMATION ALGORITHM FOR STOCHASTIC SEMIDEFINITE PROGRAMMING
• Correction of Convergence Proof for Iterative Water-Filling in Gaussian MIMO Broadcast Channels
• Chip-Asynchronous Version of Welch Bound: Gaussian Pulse Improves BER Performance
• Games with coupled propagated constraints in optical networks with multi-link topologies
• Label Correlation Propagation for Semi-supervised Multi-label Learning
• The Water-Filling Game in Fading Multiple-Access Channels
• VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks
• Analysis of iterative waterfilling algorithm for multiuser power control in digital subscriber lines
• Derivative-free optimization over multi-user MIMO networks
• Distributed Power Allocation With Rate Constraints in Gaussian Parallel Interference Channels

This page was built for publication: Asynchronous Iterative Water-Filling for Gaussian Frequency-Selective Interference Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604471)