摘要
列表连续消除(successive cancellation list,SCL)译码算法是实现极化码译码的方法之一,其可以通过调整列表大小在纠错性能和复杂度之间提供良好的折衷.针对传统的SCL译码算法路径度量值(path metric,PM)计算存在冗余的问题,在简化的SCL(simplified SCL,SSCL)算法基础上提出了一种综合校验的简化算法(syndrome check-SSCL,SC-SSCL).SC-SSCL利用综合校验的方法,判断PM计算过程是否冗余,通过除去冗余计算降低译码复杂度.证明了简化的译码算法在保证译码性能不变的前提下,降低了译码算法的计算复杂度和时延.仿真结果表明,SC-SSCL较SCL译码和SSCL译码算法复杂度分别降低了约68%和13%,且在信道状态好的情况下SC-SSCL复杂度会进一步降低.
The successive cancellation list(SCL)decoding algorithm is one of the most promising approaches towards prac tical polar code decoding.It is able to provide a good tradeoff between the error correction performance and the complexity by adjusting the size of the list.Due to the redundant calculation of the path metric(PM)of the traditional SCL decoding algorithm a syndrome check pruning simplified algorithm based on the simplified SCL(SSCL)decoding algorithm is pro posed in this paper.The proposed algorithm uses a syndrome check method to determine whether the PM calculation is re dundant and simplify SCL by removing these redundant calculations.This paper proves that the simplified decoding algo rithm can reduce the complexity and latency while maintaining the original error rate performance.The simulation results show that compared with SCL and SSCL decoding the proposed algorithm can reduce complexity by 68%and 13%respec tively and under the better channel circumstance the complexity of the target algorithm can be further reduced.
作者
王丹
李孟杰
陈洋
WANG Dan;LI Mengjie;CHEN Yang(School of Communication and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,P.R.China)
出处
《重庆邮电大学学报（自然科学版）》
CSCD
北大核心
2019年第6期760-766,共7页
Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)
基金
国家自然科学基金(61701063)~~
关键词
极化码
列表连续消除译码
综合校验
低时延
Polar code
successive cancellation list algorithm
Syndrome check
low latency
