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

如何制作Polar Codes

How to Construct Polar Codes

Ido Tal, Alexander Vardy

摘要:

提出并分析了一种高效构造极化码的方法。虽然明确定义了极化码,但由于所得到的极化比特信道具有随码长呈指数增长的输出字母表,因此直接构造是难以处理的。因此,需要解决的核心问题是,通过具有可管理的字母表大小的另一个信道来忠实地近似具有难以处理的大字母表的比特信道。我们设计了两种近似方法,“三明治”的原始位通道之间的降级和升级版本。这两种近似都可以有效地计算,并且在实践中非常接近。我们还提供了我们的构造算法的理论分析,证明了对于任何固定的$ε> 0$和所有足够大的码长$n$,极化码的速率是在$ε$的信道容量可以被构造在时间和空间都是线性的$n$。

英文摘要:

A method for efficiently constructing polar codes is presented and analyzed. Although polar codes are explicitly defined, straightforward construction is intractable since the resulting polar bit-channels have an output alphabet that grows exponentially with he code length. Thus the core problem that needs to be solved is that of faithfully approximating a bit-channel with an intractably large alphabet by another channel having a manageable alphabet size. We devise two approximation methods which "sandwich" the original bit-channel between a degraded and an upgraded version thereof. Both approximations can be efficiently computed, and turn out to be extremely close in practice. We also provide theoretical analysis of our construction algorithms, proving that for any fixed $ε> 0$ and all sufficiently large code lengths $n$, polar codes whose rate is within $ε$ of channel capacity can be constructed in time and space that are both linear in $n$.

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

↑