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

具有高阶记忆的极化码

Polar Codes With Higher-Order Memory

Hüseyin Afşer, Hakan Deliç

摘要:

我们介绍了一组代码序列$ \{ {\mathscr C}_{n}^{(m)} : n\geq 1, m \geq 1 \}$的设计,与存储器顺序$m$和代码长度$N=O(ϕ^n)$,其中$ ϕ\in (1,2]$是多项式方程$F(m,ρ)=ρ^m-ρ^{m-1}-1$和$ϕ$的最大实根在$m$减少。$\{ {\mathscr C}_{n}^{(m)}\}$基于信道极化思想,其中$ \{ {\mathscr C}_{n}^{(1)} \}$与Arıkan提出的极化码一致,并且可以以复杂度$O(N \log N)$进行编码和解码。$ \{ {\mathscr C}_{n}^{(m)} \}$实现了任意二进制输入、离散输出无记忆信道$W$的对称容量$I(W)$,对于任何固定的$m$,其编码和解码复杂度随着$m$的增长而降低。我们得到了一个可实现的边界上的概率块解码错误,$P_e$,$\{ {\mathscr C}_{n}^{(m)} \}$,并表明$P_e = O (2^{-N^β} )$是可实现的$β< \frac{ϕ-1}{1+m(ϕ-1)}$。

英文摘要:

We introduce the design of a set of code sequences $ \{ {\mathscr C}_{n}^{(m)} : n\geq 1, m \geq 1 \}$, with memory order $m$ and code-length $N=O(ϕ^n)$, where $ ϕ\in (1,2]$ is the largest real root of the polynomial equation $F(m,ρ)=ρ^m-ρ^{m-1}-1$ and $ϕ$ is decreasing in $m$. $\{ {\mathscr C}_{n}^{(m)}\}$ is based on the channel polarization idea, where $ \{ {\mathscr C}_{n}^{(1)} \}$ coincides with the polar codes presented by Arıkan and can be encoded and decoded with complexity $O(N \log N)$. $ \{ {\mathscr C}_{n}^{(m)} \}$ achieves the symmetric capacity, $I(W)$, of an arbitrary binary-input, discrete-output memoryless channel, $W$, for any fixed $m$ and its encoding and decoding complexities decrease with growing $m$. We obtain an achievable bound on the probability of block-decoding error, $P_e$, of $\{ {\mathscr C}_{n}^{(m)} \}$ and showed that $P_e = O (2^{-N^β} )$ is achievable for $β< \frac{ϕ-1}{1+m(ϕ-1)}$.

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

↑