Computer Science – Information Theory
Scientific paper
2007-02-28
Computer Science
Information Theory
Paper submitted to IEEE Transactions on Information Theory, February 17, 2007. Revised January 11, 2008
Scientific paper
This paper considers the minimization of transmit power in Gaussian parallel interference channels, subject to a rate constraint for each user. To derive decentralized solutions that do not require any cooperation among the users, we formulate this power control problem as a (generalized) Nash equilibrium game. We obtain sufficient conditions that guarantee the existence and nonemptiness of the solution set to our problem. Then, to compute the solutions of the game, we propose two distributed algorithms based on the single user waterfilling solution: The \emph{sequential} and the \emph{simultaneous} iterative waterfilling algorithms, wherein the users update their own strategies sequentially and simultaneously, respectively. We derive a unified set of sufficient conditions that guarantee the uniqueness of the solution and global convergence of both algorithms. Our results are applicable to all practical distributed multipoint-to-multipoint interference systems, either wired or wireless, where a quality of service in terms of information rate must be guaranteed for each link.
Facchinei Francisco
Pang Jong-Shi
Scutari Gesualdo
Wang Chaoxiong
No associations
LandOfFree
Distributed Power Allocation with Rate Constraints in Gaussian Parallel 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 Distributed Power Allocation with Rate Constraints in Gaussian Parallel Interference Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed Power Allocation with Rate Constraints in Gaussian Parallel Interference Channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-524622