• DocumentCode
    1765815
  • Title

    A Modified Levenberg–Marquardt Method for the Bidirectional Relay Channel

  • Author

    Dartmann, Guido ; Zandi, Ehsan ; Ascheid, Gerd

  • Author_Institution
    Inst. for Commun. Technol. & Embedded Syst., RWTH Aachen Univ., Aachen, Germany
  • Volume
    63
  • Issue
    8
  • fYear
    2014
  • fDate
    Oct. 2014
  • Firstpage
    4096
  • Lastpage
    4101
  • Abstract
    This paper presents an optimization approach for a system consisting of multiple bidirectional links over a two-way amplify-and-forward relay. Improvement to the fairness of the system is desired. All user pairs exchange information over one relay station (RS) with multiple antennas. Due to the joint transmission to all users, the users are subject to mutual interference. A mitigation of the interference can be achieved by max-min fair precoding optimization where the relay is subject to a sum power constraint. The resulting optimization problem is nonconvex. This paper proposes a novel iterative low-complexity approach based on a modified Levenberg-Marquardt (LM) method to find near optimal solutions. The presented method finds solutions close to the standard convex-solver-based relaxation approach.
  • Keywords
    amplify and forward communication; antennas; concave programming; convex programming; interference suppression; precoding; radio links; relay networks (telecommunication); wireless channels; LM method; Levenberg-Marquardt method; RS; bidirectional relay channel; convex-solver-based relaxation approach; interference mitigation; iterative low-complexity approach; multiple antennas; multiple bidirectional links; mutual interference; nonconvex problem; optimization approach; precoding optimization; relay station; two-way amplify-and- forward relay; Antennas; Interference; Optimization; Relays; Signal to noise ratio; Upper bound; Vectors; Low complexity; max??min beamforming; two-way relays;
  • fLanguage
    English
  • Journal_Title
    Vehicular Technology, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9545
  • Type

    jour

  • DOI
    10.1109/TVT.2014.2306204
  • Filename
    6740082