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

对称凸序:一种新的B-DMC偏序对极化码信息集的排序

The Symmetric Convex Ordering: A Novel Partial Order for B-DMCs Ordering the Information Sets of Polar Codes

Mine Alsan

摘要:

在本文中,我们提出了一个新的偏序二进制离散无记忆信道,我们称之为对称凸序。我们证明了Arıkan的极坐标变换保持了“对称凸序”。此外,我们表明,虽然对于对称信道,这种排序原来是等价的随机退化排序已经知道的顺序极化码的信息集,一个严格较弱的偏序时,至少有一个信道是不对称的。在此之间,我们还讨论了两个工具,这可能是有用的验证这种秩序:一个标准被称为切割标准和通道对称化。最后,我们讨论了潜在的应用结果,极化编码在非平稳信道。

英文摘要:

In this paper, we propose a novel partial order for binary discrete memoryless channels that we call the symmetric convex ordering. We show that Arıkan's polar transform preserves 'symmetric convex orders'. Furthermore, we show that while for symmetric channels this ordering turns out to be equivalent to the stochastic degradation ordering already known to order the information sets of polar codes, a strictly weaker partial order is obtained when at least one of the channels is asymmetric. In between, we also discuss two tools which can be useful for verifying this ordering: a criterion known as the cut criterion and channel symmetrization. Finally, we discuss potential applications of the results to polar coding over non-stationary channels.

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

↑