Stack decoding of polar codes
Stack decoding of polar codes
复制标题
Polar码的堆栈解码
DOI：
10.1049/el.2012.1459
复制
发表时间：
2012-06-07
影响因子：
1.1
通讯作者：
Chen, K.
中科院分区：
文献类型：
--
作者：
Niu, K.;Chen, K.
提出了连续的取消堆栈（SCS）解码算法，以提高极地代码的性能。与传统的连续取消解码器不同，该解码器通过本地最佳策略连续地确定位，SCS算法将许多候选部分路径存储在有序的堆栈中，并试图通过沿堆栈中最佳路径搜索搜索来查找全球最佳估计。模拟导致二进制输入添加剂白色高斯噪声通道表明，SCS算法具有与连续的取消列表（SCL）算法相同的性能，并且可以接近最大似然算法的性能。此外，SCS解码器的时间复杂性远低于SCL的时间复杂性，并且可以非常接近SC的高SNR策略。
A successive cancellation stack (SCS) decoding algorithm is proposed to improve the performance of polar codes. Unlike the conventional successive cancellation decoder which determines the bits successively with a local optimal strategy, the SCS algorithm stores a number of candidate partial paths in an ordered stack and tries to find the global optimal estimation by searching along the best path in the stack. Simulation results in the binary-input additive white Gaussian noise channel show that the SCS algorithm has the same performance as the successive cancellation list (SCL) algorithm and can approach that of the maximum likelihood algorithm. Moreover, the time complexity of the SCS decoder is much lower than that of the SCL and can be very close to that of the SC in the high SNR regime.