IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v11y2015i6p615202.html
   My bibliography  Save this article

A Low-Complexity Block Diagonalization Algorithm for MU-MIMO Two-Way Relay Systems with Complex Lattice Reduction

Author

Listed:
  • Lin Xiao
  • Shengen Liu
  • Dingcheng Yang

Abstract

We design a scheme of precoding matrices for two-way multiuser relay systems, where a multiantenna relay station (RS) operating in an amplify-and-forward model simultaneously receives information from all multiple-antenna users. Considering the feasibility in mathematical analysis, users are distributed in two symmetrical groups. To reduce the complexity of proposed precoding scheme, we employ the QR decomposition and complex lattice reduction (CLR) transform to replace the two times singular value decomposition (SVD) of conventional BD-based precoding algorithm by introducing a combined channel inversion to eliminate the multiple users interference (MUI). Simulation and performance analysis demonstrate that the proposed LR-MMSE algorithm has not only a better bit error rate (BER) performance, a higher sum-rate, and simple architecture, but also 89.8% and 35.5% less complexity compared to BD- and MMSE-based scheme.

Suggested Citation

  • Lin Xiao & Shengen Liu & Dingcheng Yang, 2015. "A Low-Complexity Block Diagonalization Algorithm for MU-MIMO Two-Way Relay Systems with Complex Lattice Reduction," International Journal of Distributed Sensor Networks, , vol. 11(6), pages 615202-6152, June.
    • Handle: RePEc:sae:intdis:v:11:y:2015:i:6:p:615202
    DOI: 10.1155/2015/615202
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/615202
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/615202?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:11:y:2015:i:6:p:615202. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.