A Tight Bound on BER of MCIK-OFDM With Greedy Detection and Imperfect CSI
A Tight Bound on BER of MCIK-OFDM With Greedy Detection and Imperfect CSI
复制标题
DOI：
10.1109/lcomm.2017.2747549
复制
发表时间：
2017-08
期刊：
影响因子：
--
通讯作者：
Thien van Luong;Y. Ko
中科院分区：
文献类型：
--
作者：
Thien van Luong;Y. Ko
本文首先研究了采用低复杂度贪婪检测器的多载波索引键控-正交频分复用系统的误码率。我们推导了在存在信道状态信息(CSI)不确定性的情况下，GD的误码率的紧致、闭合形式的表达式。特别地，利用GD先检测活动索引，再检测数据符号的特点，将误码率分为两个项：索引误码率和符号误码率。通过渐近分析，分析了不同CSI条件对误码率的影响。有趣的是，通过理论和仿真结果，我们发现GD不仅对不理想的CSI不那么敏感，而且在一定的CSI条件下优于最大似然检测器。此外，推导出的表达式在很大范围的信噪比区域内都是准确的。
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.