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

一种低复杂度的对数域OTFS调制MAP检测器

A Low Complexity MAP Detector for OTFS Modulation in Logarithmic Domain

Haoyan Liu, Yanming Liu, Min Yang

摘要:

正交时频空间(OTFS)已被证实利用全时频分集,以显着改善在高移动性场景中的错误性能。我们发现,提出的消息传递(MP)和变分贝叶斯(VB)检测器可以实现近似的最大后验概率(MAP)检测,干扰不能完全消除在没有噪声的情况下。为了实现接近最优的MAP检测,本文提出了一种新的检测方法,基于和积算法(SPA)的低复杂度。利用巧妙的因式分解后验概率,所获得的成对相互作用可以有效地避免高维变量的枚举,从而使其适用于分数多普勒情况。我们进一步简化了所提出的算法在对数域,使消息传播处理只涉及加法。最后,仿真结果表明,我们提出的算法在高信噪比(SNR)优越的错误性能增益。

英文摘要:

Orthogonal time-frequency space (OTFS) has been confirmed to take advantage of full time-frequency diversity to significantly improve error performance in high-mobility scenarios. We found that the proposed message passing (MP) and variational Bayes (VB) detectors can achieve approximate maximum a posteriori (MAP) detection, the interferences cannot be completely eliminated in the absence of noise. To achieve near-optimal MAP detection, this letter proposes a novel detection method based on sum-product algorithm (SPA) with low complexity. Leveraging subtly factorized posteriori probabilities, the obtained pairwise interactions can effectively avoid enumeration of high-dimensional variables, thereby making it applicable to fractional Doppler cases. We further simplify the proposed algorithm in the logarithmic domain so that the message propagation processing only involves addition. Finally, simulations results demonstrate the superior error performance gains of our proposed algorithm at high signal-to-noise ratios (SNRs).

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

↑