Concatenations of polar codes with outer BCH codes and convolutional codes
Concatenations of polar codes with outer BCH codes and convolutional codes
复制标题
DOI：
10.1109/allerton.2014.7028538
复制
发表时间：
2014-09
期刊：
影响因子：
--
通讯作者：
Y. Wang;K. Narayanan
中科院分区：
文献类型：
--
作者：
Y. Wang;K. Narayanan
分析了极码与外二进制BCH码和卷积码的串接方案。我们证明了BCH-polar和卷积-polar （convpolar）码的帧错误率都可以随着帧长度呈指数衰减，这比独立的polar码有了很大的改进。随着极化后信道截止率的增加，具有顺序译码的长约束长度卷积码足以实现帧错误率随帧长呈指数衰减，而平均译码复杂度较低。数值结果表明，在一定长度和译码算法的选择上，BCH-polar码和convo -polar码都优于独立的polar码。对于加性高斯白噪声信道，通过仔细选择内码和外码的长度，反极码实质上优于串联里德所罗门极码。
We analyze concatenation schemes of polar codes with outer binary BCH codes and convolutional codes. We show that both BCH-polar and Convolutional-polar (Conv-polar) codes can have frame error rate that decays exponentially with the frame length, which is a substantial improvement over standalone polar codes. With the increase in the cutoff rate of the channel after polarization, long constraint-length convolutional codes with sequential decoding suffice to achieve a frame error rate that decays exponentially with the frame length, whereas the average decoding complexity is low. Numerical results show that both BCH-polar codes and Conv-polar codes can outperform stand-alone polar codes for some lengths and choice of decoding algorithms used to decode the outer codes. For the additive white Gaussian noise channel, Conv-polar codes substantially outperform concatenated Reed Solomon-polar codes with a careful choice of the lengths of inner and outer codes.