arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2003.00724eess.SP
收藏

具有逐符号检测的极化编码快于奈奎斯特(FTN)信令

Polar Coded Faster-than-Nyquist (FTN) Signaling with Symbol-by-Symbol Detection

Abdulsamet Caglan, Adem Cicek, Enver Cavus, Ebrahim Bedeer, Halim Yanikomeroglu

摘要:

降低复杂度的快于奈奎斯特(FTN)信令系统正获得越来越多的关注,因为它们为可接受水平的检测复杂度提供改进的带宽利用。为了更好地理解降低复杂度的FTN检测技术的性能和复杂度之间的权衡,有必要在存在信道编码的情况下研究这些技术。在本文中,我们研究的性能极化编码的FTN系统,它使用了降低复杂度的FTN检测,即最近提出的连续的符号与回退K序列估计(SSSgbKSE)技术。针对各种符号间干扰(ISI)水平和各种返回K值进行仿真。针对未编码和极化编码系统,研究了Bahl-Cocke-Jelinek-Raviv(BCJR)检测和SSSgbKSE检测技术的误比特率性能。仿真结果表明,极化码可以补偿在降低复杂度的SSSgbKSE技术中引起的一些性能损失,并有助于缩小BCJR和SSSgbKSE检测算法之间的性能差距。

英文摘要:

Reduced complexity faster-than-Nyquist (FTN) signaling systems are gaining increased attention as they provide improved bandwidth utilization for an acceptable level of detection complexity. In order to have a better understanding of the tradeoff between performance and complexity of the reduced complexity FTN detection techniques, it is necessary to study these techniques in the presence of channel coding. In this paper, we investigate the performance a polar coded FTN system which uses a reduced complexity FTN detection, namely, the recently proposed successive symbol-by-symbol with go-backK sequence estimation (SSSgbKSE) technique. Simulations are performed for various intersymbol-interference (ISI) levels and for various go-back-K values. Bit error rate (BER) performance of Bahl-Cocke-Jelinek-Raviv (BCJR) detection and SSSgbKSE detection techniques are studied for both uncoded and polar coded systems. Simulation results reveal that polar codes can compensate some of the performance loss incurred in the reduced complexity SSSgbKSE technique and assist in closing the performance gap between BCJR and SSSgbKSE detection algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑