arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1701.04746cs.ITmath.IT
收藏

极化码的删余策略研究

On Puncturing Strategies for Polar Codes

Ludovic Chandesris, Valentin Savin, David Declercq

摘要:

本文介绍了一类特殊的穿孔模式,称为对称穿孔模式,它可以从生成矩阵$G_N$的行中表征和生成。首先证明了它们是不等价的,然后提出了一种低复杂度的生成对称穿孔模式的方法,该方法在$G_N$的行上执行具有有限深度的搜索树算法。对称模式进一步优化密度演化,并显示出更好的性能比国家的最先进的速率兼容的代码结构,依赖于打孔或缩短技术。

英文摘要:

This paper introduces a class of specific puncturing patterns, called symmetric puncturing patterns, which can be characterized and generated from the rows of the generator matrix $G_N$. They are first shown to be non-equivalent, then a low-complexity method to generate symmetric puncturing patterns is proposed, which performs a search tree algorithm with limited depth, over the rows of $G_N$. Symmetric patterns are further optimized by density evolution, and shown to yield better performance than state-of-the-art rate compatible code constructions, relying on either puncturing or shortening techniques.

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

↑