当前位置: X-MOL 学术IEEE Commun. Lett. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Low-Complexity Detection for Faster-than-Nyquist Signaling based on Probabilistic Data Association
IEEE Communications Letters ( IF 4.1 ) Pub Date : 2020-04-01 , DOI: 10.1109/lcomm.2019.2962022
Michel Kulhandjian , Ebrahim Bedeer , Hovannes Kulhandjian , Claude D'Amours , Halim Yanikomeroglu

In this letter, we investigate the sequence estimation problem of faster-than-Nyquist (FTN) signaling as a promising approach for increasing spectral efficiency (SE) in future communication systems. In doing so, we exploit the concept of Gaussian separability and propose two probabilistic data association (PDA) algorithms with polynomial time complexity to detect binary phase-shift keying (BPSK) FTN signaling. Simulation results show that the proposed PDA algorithm outperforms the recently proposed SSSSE and SSSgb $K$ SE algorithms for all SE values with a modest increase in complexity. The PDA algorithm approaches the performance of the semidefinite relaxation (SDRSE) algorithm for SE values of 0.96 bits/sec/Hz, and it is within the 0.5 dB signal-to-noise ratio (SNR) penalty at SE values of 1.10 bits/sec/Hz for the fixed values of $\beta = 0.3$ .

中文翻译:

基于概率数据关联的快于奈奎斯特信令的低复杂度检测

在这封信中,我们研究了快于奈奎斯特 (FTN) 信令的序列估计问题,作为在未来通信系统中提高频谱效率 (SE) 的一种有前途的方法。为此,我们利用高斯可分性的概念并提出了两种具有多项式时间复杂度的概率数据关联 (PDA) 算法来检测二进制相移键控 (BPSK) FTN 信令。仿真结果表明,提出的PDA算法优于最近提出的SSSSE和SSSgb $K$ 适用于所有 SE 值的 SE 算法,复杂度略有增加。PDA 算法在 SE 值为 0.96 位/秒/Hz 时接近半定松弛 (SDRSE) 算法的性能,并且在 SE 值为 1.10 位/秒时,它在 0.5 dB 信噪比 (SNR) 损失范围内/Hz 为固定值 $\beta = 0.3$ .
更新日期:2020-04-01
down
wechat
bug