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

低复杂度几何整形

Low-Complexity Geometric Shaping

Ali Mirani, Erik Agrell, Magnus Karlsson

AI总结:

本文研究多维欧几里得空间中基于格的几何整形调制格式,提出低复杂度调制解调算法以支持超大规模星座,并在光纤信道中相比4-QAM实现超过38%的传输距离提升。

摘要:

通过几何整形逼近香农容量通常被认为具有挑战性,因为调制和解调复杂度较高,需要查找表来存储星座点和星座比特标签。为了克服这些挑战,本文研究了多维欧几里得空间中基于格的几何整形调制格式。我们描述并评估了快速且低复杂度的调制和解调算法,使这些调制格式具有实用性,即使在星座点数超过$10^{28}$个的极高星座规模下也是如此。在加性高斯白噪声和非线性光纤信道中,将这些星座的未编码误码率性能与常规QAM格式进行了比较。在每符号每偏振2比特的频谱效率下,与4-QAM格式相比,在硬判决前向纠错阈值$2.26\ imes 10^{-4}$处,传输距离提升超过38%。

英文摘要:

Approaching Shannon's capacity via geometric shaping has usually been regarded as challenging due to modulation and demodulation complexity, requiring look-up tables to store the constellation points and constellation bit labeling. To overcome these challenges, in this paper, we study lattice-based geometrically shaped modulation formats in multidimensional Euclidean space. We describe and evaluate fast and low complexity modulation and demodulation algorithms that make these modulation formats practical, even with extremely high constellation sizes with more than $10^{28}$ points. The uncoded bit error rate performance of these constellations is compared with the conventional QAM formats in the additive white Gaussian noise and nonlinear fiber channels. At a spectral efficiency of 2 bits/sym/polarization, compared with 4-QAM format, transmission reach improvement of more than 38% is shown at the hard-decision forward error correction threshold of $2.26\times 10^{-4}$.

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

↑