论文标题
符号检测的极性编码更快(FTN)信号传导
Polar Coded Faster-than-Nyquist (FTN) Signaling with Symbol-by-Symbol Detection
论文作者
论文摘要
降低的复杂性降低速度高于Nyquist(FTN)信号系统,因为它们提供了可接受的检测复杂性水平,因此增加了注意力的注意力。为了更好地了解降低的复杂性FTN检测技术之间的性能与复杂性之间的权衡,有必要在渠道编码的存在下研究这些技术。在本文中,我们调查了使用降低的复杂性FTN检测的极地编码的FTN系统的性能,即,最近提出的具有Go-Backk序列估计(SSSSGBKSE)技术的连续符号。对各种隔膜界限(ISI)水平和各种回复K值进行了仿真。对于未编码和极地编码系统,研究了Bahl-Cocke-Jelinek-Raviv(BCJR)检测和SSSGBKSE检测技术的位错误率(BER)性能。仿真结果表明,极地代码可以补偿降低的复杂性SSSGBKSE技术中产生的一些性能损失,并有助于缩小BCJR和SSSSGBKSE检测算法之间的性能差距。
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.