By Topic

Pareto Region Characterization for Rate Control in MIMO Interference Systems and Nash Bargaining

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Zengmao Chen ; EECE, Joint Res. Inst. for Signal & Image Process., Heriot-Watt Univ., Edinburgh, UK ; Vorobyov, S.A. ; Cheng-Xiang Wang ; Thompson, J.

In this note, the problem of rate control in multiuser multiple-input multiple-output (MIMO) interference systems is formulated as a multicriteria optimization (MCO) problem. The Pareto rate region of the MCO problem is first characterized by giving a sufficient condition for the convexity of the Pareto rate region. Second, various rate region convexification approaches including a multistage interference cancellation and a full projection (FP)-based interference avoidance scheme are analyzed. An achievable rate region based on FP is also given for MIMO interference systems. Third, Nash bargaining (NB) is applied to transform the MCO problem into a single-objective problem. The characteristics of the NB over MIMO interference systems such as the uniqueness and optimality of different type NB solutions are investigated. A method to determine the optimality of FP- and time-division multiplexing-based NB solutions is presented as well. Finally, the convexity of the rate region and the existence of the FP-based NB solution for MIMO interference systems are examined numerically.

Published in:

Automatic Control, IEEE Transactions on  (Volume:57 ,  Issue: 12 )