CaltechAUTHORS
  A Caltech Library Service

Robust noncooperative rate-maximization game for MIMO Gaussian interference channels under bounded channel uncertainty

Anandkumar, Amod J. G. and Anandkumar, Animashree and Lambotharan, Sangarapillai and Chambers, Jonathon (2013) Robust noncooperative rate-maximization game for MIMO Gaussian interference channels under bounded channel uncertainty. In: 2013 IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE , Piscataway, NJ, pp. 4819-4823. ISBN 978-1-4799-0356-6. https://resolver.caltech.edu/CaltechAUTHORS:20170925-100945197

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20170925-100945197

Abstract

We propose a robust formulation for the noncooperative rate-maximization game in MIMO Gaussian interference channels under bounded channel uncertainty. The proposed robust game needs little additional computation and requires no additional information exchange among users when compared to the nominal game and thus maintains the low-complexity and distributed nature of the MIMO waterfilling algorithm. The robust rate-maximization game is shown to be equivalent to the nominal game with modified direct-channel matrices. The equilibrium solution of the robust rate-maximization game and the required iterative algorithm to obtain the solution are presented. Sufficient conditions for the uniqueness of the equilibrium and the convergence of the algorithm are also presented. Simulation results indicate that the robust solution in the presence of channel uncertainty performs better than the nominal solution with zero uncertainty, due to the users being more conservative in their power allocation when there is channel uncertainty.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/ICASSP.2013.6638576DOIArticle
http://ieeexplore.ieee.org/document/6638576PublisherArticle
Additional Information:© 2013 IEEE. This work was supported by the Engineering and Physical Sciences Research Council, U.K. under Grants EP/F065477/1 and EP/J020389/1.
Funders:
Funding AgencyGrant Number
Engineering and Physical Sciences Research Council (EPSRC)EP/F065477/1
Engineering and Physical Sciences Research Council (EPSRC)EP/J020389/1
Subject Keywords:Game theory, resource allocation, MIMO systems, Nash equilibrium, waterfilling, robustness
Record Number:CaltechAUTHORS:20170925-100945197
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20170925-100945197
Official Citation:A. J. G. Anandkumar, A. Anandkumar, S. Lambotharan and J. Chambers, "Robust noncooperative rate-maximization game for MIMO Gaussian interference channels under bounded channel uncertainty," 2013 IEEE International Conference on Acoustics, Speech and Signal Processing, Vancouver, BC, 2013, pp. 4819-4823. doi: 10.1109/ICASSP.2013.6638576 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6638576&isnumber=6637585
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:81804
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:25 Sep 2017 17:18
Last Modified:03 Oct 2019 18:47

Repository Staff Only: item control page