A tight bound on BER of MCIK-OFDM with greedy detection and imperfect CSI

Thien Van Luong; Youngwook Ko

doi:10.1109/LCOMM.2017.2747549

A tight bound on BER of MCIK-OFDM with greedy detection and imperfect CSI

Thien Van Luong, Youngwook Ko^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

Abstract

This letter first investigates bit error rate (BER) of Multi-Carrier Index Keying-Orthogonal Frequency Division Multiplexing 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 analyze impacts of various CSI conditions on the BER. Interestingly, via theoretical 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 language	English
Pages (from-to)	2594-2597
Number of pages	4
Journal	IEEE Communications Letters
Volume	21
Issue number	12
DOIs	https://doi.org/10.1109/LCOMM.2017.2747549
Publication status	Published - 1 Dec 2017

Keywords

Bit error rate
Greedy detector
Imperfect CSI
Index modulation
MICK-OFDM
OFDM-IM

Access to Document

10.1109/LCOMM.2017.2747549

Cite this

@article{dd27d52a877c497fafe47a081250dbf4,

title = "A tight bound on BER of MCIK-OFDM with greedy detection and imperfect CSI",

abstract = "This letter first investigates bit error rate (BER) of Multi-Carrier Index Keying-Orthogonal Frequency Division Multiplexing 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 analyze impacts of various CSI conditions on the BER. Interestingly, via theoretical 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.",

keywords = "Bit error rate, Greedy detector, Imperfect CSI, Index modulation, MICK-OFDM, OFDM-IM",

author = "{Van Luong}, Thien and Youngwook Ko",

year = "2017",

month = dec,

day = "1",

doi = "10.1109/LCOMM.2017.2747549",

language = "English",

volume = "21",

pages = "2594--2597",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "IEEE",

number = "12",

}

TY - JOUR

T1 - A tight bound on BER of MCIK-OFDM with greedy detection and imperfect CSI

AU - Van Luong, Thien

AU - Ko, Youngwook

PY - 2017/12/1

Y1 - 2017/12/1

N2 - This letter first investigates bit error rate (BER) of Multi-Carrier Index Keying-Orthogonal Frequency Division Multiplexing 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 analyze impacts of various CSI conditions on the BER. Interestingly, via theoretical 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.

AB - This letter first investigates bit error rate (BER) of Multi-Carrier Index Keying-Orthogonal Frequency Division Multiplexing 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 analyze impacts of various CSI conditions on the BER. Interestingly, via theoretical 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.

KW - Bit error rate

KW - Greedy detector

KW - Imperfect CSI

KW - Index modulation

KW - MICK-OFDM

KW - OFDM-IM

UR - http://www.scopus.com/inward/record.url?scp=85029159196&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2017.2747549

DO - 10.1109/LCOMM.2017.2747549

M3 - Article

AN - SCOPUS:85029159196

SN - 1089-7798

VL - 21

SP - 2594

EP - 2597

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 12

ER -

A tight bound on BER of MCIK-OFDM with greedy detection and imperfect CSI

Abstract

Keywords

Access to Document

Other files and links

Cite this