A Tight Bound on BER of MCIK-OFDM with Greedy Detection and Imperfect CSI

T V Luong, Youngwook Ko

Research output: Contribution to journalArticlepeer-review

33 Citations (Scopus)
319 Downloads (Pure)


This letter first investigates bit error rate (BER) of Multi-Carrier Index Keying - Orthogonal Frequency Division Multiplexing (MCIK-OFDM) using a low-complexity greedy detector (GD). We derive a tight, closed-form expression for the BER of the GD in the presence of channel state information(CSI) uncertainty. Particularly, exploiting the fact that the GD detects the active indices first, and then detects the data symbols,we divide the BER into two terms: the index BER and the symbol BER. The asymptotic analysis is also provided to analyzeimpacts of various CSI conditions on the BER. Interestingly, viatheoretical and simulation results, we discover that the GD is not only less sensitive to imperfect CSI, but also better than the maximum likelihood detector under certain CSI conditions. In addition, the derived expression is accurate in a wide range of signal-to-noise ratio regions.
Original languageEnglish
Number of pages4
JournalIEEE Communications Letters
Early online date31 Aug 2017
Publication statusEarly online date - 31 Aug 2017


  • Index modulation
  • bit error probability


Dive into the research topics of 'A Tight Bound on BER of MCIK-OFDM with Greedy Detection and Imperfect CSI'. Together they form a unique fingerprint.

Cite this