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

预编码卫星系统中帧头非相干检测的码设计

Code Design for Non-Coherent Detection of Frame Headers in Precoded Satellite Systems

Farbod Kayhan, Guido Montorsi

摘要:

在本文中,我们提出了一种简单的方法,用于产生短长度的速率兼容码的$\mathbb{Z}_M$,是强大的非相干检测的$M$ -PSK星座。首先,一个贪心算法被用来构造一个家庭的旋转不变码的星座。然后,通过适当地修改这样的代码,我们得到的代码是强大的非相干检测。我们简要地讨论了BPSK和QPSK星座的特殊情况下构造的代码的最优性。我们的方法提供了一个上限的最佳码的长度与给定的期望的非相干距离。我们还推导出一个简单的渐近上界帧出错率(FER),这样的代码,并提供一组选定的建议代码的模拟结果。最后,我们简要地讨论了QPSK星座的二进制码的设计问题,这些码对非相干检测是鲁棒的。

英文摘要:

In this paper we propose a simple method for generating short-length rate-compatible codes over $\mathbb{Z}_M$ that are robust to non-coherent detection for $M$-PSK constellations. First, a greedy algorithm is used to construct a family of rotationally invariant codes for a given constellation. Then, by properly modifying such codes we obtain codes that are robust to non-coherent detection. We briefly discuss the optimality of the constructed codes for special cases of BPSK and QPSK constellations. Our method provides an upper bound for the length of optimal codes with a given desired non-coherent distance. We also derive a simple asymptotic upper bound on the frame error rate (FER) of such codes and provide the simulation results for a selected set of proposed codes. Finally, we briefly discuss the problem of designing binary codes that are robust to non-coherent detection for QPSK constellation.

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

↑