IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v11y2020i4d10.1007_s13198-019-00836-3.html
   My bibliography  Save this article

Complexity reduced soft MIMO detetion using single tree search

Author

Listed:
  • Saleem Ahmed

    (Dawood University of Engineering and Technology)

  • D. M. Saqib Bhatti

    (Dawood University of Engineering and Technology)

  • Sooyoung Kim

    (Chonbuk National University)

Abstract

In MIMO systems, soft iterative detection and decoding can produce the near capacity performance. One of the promising detection techniques known as sphere decoder can play an important role in order to meet the requirements of achieving near optimal performance. The single tree search (STS) is based on the sphere decoding which can produce near optimal performance in iterative detection and decoding. The main hindering in STS method is that it is computationally complex. The complexity increases as we increase the iterations. In this paper, we propose to reduce complexity of the STS method by limiting the candidates of calculating soft information to those bits whose a priori information provided by turbo decoder is less reliable. Simulation results show that the proposed method can reduce the complexity with negligible performance degradation compared to the conventional full search and STS methods.

Suggested Citation

  • Saleem Ahmed & D. M. Saqib Bhatti & Sooyoung Kim, 2020. "Complexity reduced soft MIMO detetion using single tree search," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 11(4), pages 774-779, August.
    • Handle: RePEc:spr:ijsaem:v:11:y:2020:i:4:d:10.1007_s13198-019-00836-3
    DOI: 10.1007/s13198-019-00836-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-019-00836-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13198-019-00836-3?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Keywords

    MIMO; STS; Turbo coding;
    All these keywords.

    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:spr:ijsaem:v:11:y:2020:i:4:d:10.1007_s13198-019-00836-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.