• DocumentCode
    1930348
  • Title

    Comparison of performance and implementation complexity of soft-output sphere detectors for MIMO-OFDM systems

  • Author

    Myllylä, Markus

  • Author_Institution
    Renesas Mobile Eur. Ltd., Oulu, Finland
  • fYear
    2011
  • fDate
    6-9 Nov. 2011
  • Firstpage
    909
  • Lastpage
    913
  • Abstract
    A list sphere detector (LSD) is a soft-output enhancement of a sphere detector (SD) that can be used to approximate the optimal MAP detector in the detection of the multiple-input multiple-output (MIMO) signals. The LSDs are based on tree search algorithms and they can be divided into three categories: the breadth-first (BF) search, the depth-first search (DF), and the metric-first (MF) search algorithms. A fair comparison of the feasibility of different search algorithms for MIMO detection requires efficient architecture designs and hardware implementations of the algorithms. In this paper, we compare and analyze the error rate performance, ASIC implementation complexity and detection rate of LSDs based on all three types of search strategies for 4 × 4 MIMO-OFDM systems with 16- and 64-QAM.
  • Keywords
    MIMO communication; OFDM modulation; application specific integrated circuits; maximum likelihood detection; quadrature amplitude modulation; tree searching; 16-QAM; 64-QAM; ASIC implementation; MIMO detection; MIMO-OFDM systems; breadth-first search; depth-first search; error rate performance; implementation complexity; list sphere detector; metric-first search algorithm; multiple-input multiple-output signal; optimal MAP detector; performance comparison; soft output sphere detector; tree search algorithms; Algorithm design and analysis; Approximation algorithms; Complexity theory; Detectors; MIMO; Signal to noise ratio; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signals, Systems and Computers (ASILOMAR), 2011 Conference Record of the Forty Fifth Asilomar Conference on
  • Conference_Location
    Pacific Grove, CA
  • ISSN
    1058-6393
  • Print_ISBN
    978-1-4673-0321-7
  • Type

    conf

  • DOI
    10.1109/ACSSC.2011.6190141
  • Filename
    6190141