By Topic

A Convex Optimization Design of Relay Precoder for Two-Hop Mimo Relay Networks

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
$33 $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)
Youhua Fu ; Sch. of Inf. Sci. & Eng., Southeast Univ., Nanjing, China ; Luxi Yang ; Wei-ping Zhu ; Zhouwang Yang

This paper presents an optimal relay precoding scheme for two-hop amplify-and-forward based MIMO relay networks with one source, one destination and multiple relays. A constrained optimization problem for relay precoder is formulated by using the mutual information criterion along with a total relay transmitting power constraint. It is shown that due to the block-diagonal structure of the precoding matrix, the optimization problem can not be solved directly by the existing methods. We then simplify it into an equivalent problem involving scalar optimization variables only. Through an in-depth study of the problem formulation, it is revealed that the objective function is convex only when the relay power is larger than a certain threshold, which can be determined mainly by the system configurations and the channel condition. Finally, under the convex condition, the simplified problem is solved by a convex optimization method. The effectiveness of the proposed precoder is validated by Monte-Carlo simulations with comparison to some of the existing methods.

Published in:

Communications (ICC), 2010 IEEE International Conference on

Date of Conference:

23-27 May 2010