The MIMO Iterative Waterfilling Algorithm
arXiv:0812.2324 · doi:10.1109/TSP.2009.2013894
Abstract
This paper considers the non-cooperative maximization of mutual information in the vector Gaussian interference channel in a fully distributed fashion via game theory. This problem has been widely studied in a number of works during the past decade for frequency-selective channels, and recently for the more general MIMO case, for which the state-of-the art results are valid only for nonsingular square channel matrices. Surprisingly, these results do not hold true when the channel matrices are rectangular and/or rank deficient matrices. The goal of this paper is to provide a complete characterization of the MIMO game for arbitrary channel matrices, in terms of conditions guaranteeing both the uniqueness of the Nash equilibrium and the convergence of asynchronous distributed iterative waterfilling algorithms. Our analysis hinges on new technical intermediate results, such as a new expression for the MIMO waterfilling projection valid (also) for singular matrices, a mean-value theorem for complex matrix-valued functions, and a general contraction theorem for the multiuser MIMO watefilling mapping valid for arbitrary channel matrices. The quite surprising result is that uniqueness/convergence conditions in the case of tall (possibly singular) channel matrices are more restrictive than those required in the case of (full rank) fat channel matrices. We also propose a modified game and algorithm with milder conditions for the uniqueness of the equilibrium and convergence, and virtually the same performance (in terms of Nash equilibria) of the original game.
IEEE Transactions on Signal Processing (accepted)
References in corpus (3)
- Optimal Linear Precoding Strategies for Wideband Non-Cooperative Systems based on Game Theory-Part I: Nash Equilibria
- Competitive Design of Multiuser MIMO Systems based on Game Theory: A Unified View
- Optimal Linear Precoding Strategies for Wideband Non-Cooperative Systems based on Game Theory-Part II: Algorithms
Cited by in corpus (23)
- Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
- Competitive Design of Multiuser MIMO Systems based on Game Theory: A Unified View
- Real and Complex Monotone Communication Games
- Dynamic Power Control for Delay-Aware Device-to-Device Communications
- CellOS: Zero-touch Softwarized Open Cellular Networks
- A Journey from Improper Gaussian Signaling to Asymmetric Signaling
- Parallelized Structures for MIMO FBMC under Strong Channel Frequency Selectivity
- Downlink MIMO-RSMA with Successive Null-Space Precoding
- Alternating Rate Profile Optimization in Single Stream MIMO Interference Channels
- An Achievable Rate Region for the Broadcast Wiretap Channel with Asymmetric Side Information
- Downlink Massive MU-MIMO with Successively-Regularized Zero Forcing Precoding
- Matrix Exponential Learning Schemes with Low Informational Exchange
- Convergence-Optimal Quantizer Design of Distributed Contraction-based Iterative Algorithms with Quantized Message Passing
- Fast Optimization with Zeroth-Order Feedback in Distributed, Multi-User MIMO Systems
- Distributed Variable Sample-Size Gradient-response and Best-response Schemes for Stochastic Nash Equilibrium Problems over Graphs
- Successive Null-Space Precoder Design for Downlink MU-MIMO with Rate Splitting and Single-Stage SIC
- A stochastic approximation algorithm for stochastic semidefinite programming
- R-SFLLM: Jamming Resilient Framework for Split Federated Learning with Large Language Models
- Using Continuous Power Modulation for Exchanging Local Channel State Information
- Distributed Power Control in Multiuser MIMO Networks with Optimal Linear Precoding
- First-order Methods with Convergence Rates for Multi-agent Systems on Semidefinite Matrix Spaces
- Distributed Power Control with Partial Channel State Information: Performance Characterization and Design
- Energy Efficient Competitive Resource Allocation in MIMO networks