By Topic

The Sign-Definiteness Lemma and Its Applications to Robust Transceiver Optimization for Multiuser MIMO Systems

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

2 Author(s)
Gharavol, E.A. ; Electr. Eng. Dept. (ISY), Linkoping Univ., Linkoping, Sweden ; Larsson, E.G.

We formally generalize the sign-definiteness lemma to the case of complex-valued matrices and multiple norm-bounded uncertainties. This lemma has found many applications in the study of the stability of control systems, and in the design and optimization of robust transceivers in communications. We then present three different novel applications of this lemma in the area of multi-user multiple-input multiple-output (MIMO) robust transceiver optimization. Specifically, the scenarios of interest are: (i) robust linear beamforming in an interfering adhoc network, (ii) robust design of a general relay network, including the two-way relay channel as a special case, and (iii) a half-duplex one-way relay system with multiple relays. For these networks, we formulate the design problems of minimizing the (sum) MSE of the symbol detection subject to different average power budget constraints. We show that these design problems are non-convex (with bilinear or trilinear constraints) and semi-infinite in multiple independent uncertainty matrix-valued variables. We propose a two-stage solution where in the first step the semi-infinite constraints are converted to linear matrix inequalities using the generalized sign-definiteness lemma, and in the second step, we use an iterative algorithm based on alternating convex search (ACS). Via simulations we evaluate the performance of the proposed scheme.

Published in:

Signal Processing, IEEE Transactions on  (Volume:61 ,  Issue: 2 )