• DocumentCode
    2896883
  • Title

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

  • Author

    Fu, Youhua ; Yang, Luxi ; Zhu, Wei-Ping ; Yang, Zhouwang

  • Author_Institution
    Sch. of Inf. Sci. & Eng., Southeast Univ., Nanjing, China
  • fYear
    2010
  • fDate
    23-27 May 2010
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    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.
  • Keywords
    MIMO communication; Monte Carlo methods; optimisation; precoding; Monte-Carlo simulations; amplify-and-forward based MIMO relay networks; convex optimization design; relay precoder; two-hop MIMO relay networks; Communications Society; Constraint optimization; Design engineering; Design optimization; Information science; MIMO; Mutual information; Optimization methods; Power system relaying; Relays;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications (ICC), 2010 IEEE International Conference on
  • Conference_Location
    Cape Town
  • ISSN
    1550-3607
  • Print_ISBN
    978-1-4244-6402-9
  • Type

    conf

  • DOI
    10.1109/ICC.2010.5501764
  • Filename
    5501764