IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v70y2019i1d10.1007_s11235-018-0467-8.html
   My bibliography  Save this article

Low complexity maximum-likelihood detector for DSTTD architecture based on the QRD-M algorithm

Author

Listed:
  • Joaquín Cortez

    (Instituto Tecnológico de Sonora)

  • Miguel Bazdresch

    (Rochester Institute of Technology)

  • Julio Ramírez

    (Universidad del Caribe)

  • Ramón Palacio

    (Instituto Tecnológico de Sonora)

  • Erica Ruiz

    (Instituto Tecnológico de Sonora)

Abstract

This paper presents a new decoder algorithm for the double space–time transmit diversity (DSTTD) system. The decoder is based on the QRD-M algorithm, which performs a breadth-first search of possible solutions tree. The search is simplified by skipping unlikely candidates, and it is stopped when no promising candidates are left. Furthermore, the search is divided into three concurrent iterations, making possible a fast, parallel implementation either in hardware or software. After presenting an analysis of the capacity and diversity of DSTTD, we present performance results showing that the proposed decoder is capable of achieving near maximum likelihood performance. We also show that the proposed algorithm exhibits lower computational complexity than other existing maximum likelihood detectors.

Suggested Citation

  • Joaquín Cortez & Miguel Bazdresch & Julio Ramírez & Ramón Palacio & Erica Ruiz, 2019. "Low complexity maximum-likelihood detector for DSTTD architecture based on the QRD-M algorithm," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 70(1), pages 55-66, January.
    • Handle: RePEc:spr:telsys:v:70:y:2019:i:1:d:10.1007_s11235-018-0467-8
    DOI: 10.1007/s11235-018-0467-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-018-0467-8
    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/s11235-018-0467-8?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.

    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:telsys:v:70:y:2019:i:1:d:10.1007_s11235-018-0467-8. 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.