New computational complexity reducing IDD scheme designed with optimum parameters

Jehoon Cho, Minsung Kim, Sinsung Jeong, Jung ho Park, Tae Won Oh

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

An Iterative Detection and Decoding (IDD) scheme in a high-order Multiple-Input Multiple-Output (MIMO) wireless communication system requires a heavy computational complexity for an outstanding Bit Error Rate (BER) performance in a given Signal-to-Noise Ratio (SNR) environment. A new computational complexity reducing IDD scheme designed with optimum parameters is proposed in this paper to guarantee Quality of Service (QoS) without the loss of BER performance. There are three parameters to control the trade-off between computational complexity and BER performance of an IDD scheme: a candidate list size of Dynamic List Sphere Detector (D-LSD), a number of intra-iteration of Turbo decoder, and a number of IDD iteration. A complexity reduction of about 70 % is demonstrated in this study, when the target BER is around 1.0×10(-4) at Eb/N0=7dB in the case of a 4 × 4 MIMO system with 16-ary Quadrature Amplitude Modulation (QAM).

Original languageEnglish
Article number6517355
Pages (from-to)1313-1316
Number of pages4
JournalIEEE Communications Letters
Volume17
Issue number7
DOIs
Publication statusPublished - 2013 May 22

    Fingerprint

Keywords

  • Computational complexity
  • Dynamic List Sphere Detector (D-LSD)
  • Extrinsic Information Transfer (EXIT) chart
  • Iterative Detection and Decoding (IDD) receiver
  • Multiple-Input Multiple-Output (MIMO)
  • Quality of Service (QoS)
  • target Bit Error Rate (BER)

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Modelling and Simulation

Cite this