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

极化码:指数、边界和构造的表征

Polar Codes: Characterization of Exponent, Bounds, and Constructions

Satish Babu Korada, Eren Sasoglu, Rudiger Urbanke

摘要:

最近,Arıkan引入了Polar码。它们在低复杂度的逐次相消译码策略下实现了任意对称二进制输入离散无记忆信道的容量。原始极化码构造与Reed-Muller码的递归构造密切相关,并且基于$2 \times 2$矩阵$\bigl[ 1 &0 1& 1 \bigr]$。Arıkan和Telatar表明,这种构造实现了$\frac12$的误差指数,即,对于足够大的块长度,错误概率以长度的平方根指数衰减。Arıkan已经提到,原则上可以使用更大的矩阵来构造极化码。一个基本的问题是看是否存在指数超过$\frac12$的矩阵。我们首先表明,任何$\ell \times \ell$矩阵的列排列都不是上三角极化对称通道。然后,我们刻画了一个给定的方阵的指数,并推导出上界和下界可实现的指数。使用这些界限,我们表明,没有矩阵的大小小于15的指数超过$\frac12$。此外,我们给出了一个一般的建设BCH码的基础上,大$n$实现指数任意接近1,超过$\frac12$的大小为16。

英文摘要:

Polar codes were recently introduced by Arıkan. They achieve the capacity of arbitrary symmetric binary-input discrete memoryless channels under a low complexity successive cancellation decoding strategy. The original polar code construction is closely related to the recursive construction of Reed-Muller codes and is based on the $2 \times 2$ matrix $\bigl[ 1 &0 1& 1 \bigr]$. It was shown by Arıkan and Telatar that this construction achieves an error exponent of $\frac12$, i.e., that for sufficiently large blocklengths the error probability decays exponentially in the square root of the length. It was already mentioned by Arıkan that in principle larger matrices can be used to construct polar codes. A fundamental question then is to see whether there exist matrices with exponent exceeding $\frac12$. We first show that any $\ell \times \ell$ matrix none of whose column permutations is upper triangular polarizes symmetric channels. We then characterize the exponent of a given square matrix and derive upper and lower bounds on achievable exponents. Using these bounds we show that there are no matrices of size less than 15 with exponents exceeding $\frac12$. Further, we give a general construction based on BCH codes which for large $n$ achieves exponents arbitrarily close to 1 and which exceeds $\frac12$ for size 16.

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

↑