Computer Science – Information Theory
Scientific paper
2008-01-16
Computer Science
Information Theory
Submitted to IEEE Transactions on Information Theory, August 22, 2006. Revised September 25, 2007. Accepted January 14, 2008.
Scientific paper
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.
Barbarossa Sergio
Palomar Daniel P.
Scutari Gesualdo
No associations
LandOfFree
Asynchronous Iterative Waterfilling for Gaussian Frequency-Selective Interference Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Asynchronous Iterative Waterfilling for Gaussian Frequency-Selective Interference Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asynchronous Iterative Waterfilling for Gaussian Frequency-Selective Interference Channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-159839