A novel SC decoding method of polar codes is proposed in $d$-deletion channels, where a new pruning strategy is designed to reduce decoding complexity. Considering the difference of the scenario weight distributions, pruning thresholds for each node are designed separately according to a uniform constraint on the pruning error probability, which further reduce the number of scenarios that need to be calculated during the decoding procedure. In addition, by exploiting the properties of the joint weight distribution, a simplified calculation method of thresholds is proposed. Using this simplified calculation method, the number of scenarios that required to be calculated is reduced from $(d+1)(d+2)/2$ to $d+1$.

翻译：本文针对d-删除信道提出了一种新型极化码连续删除译码方法，其中通过设计新的剪枝策略来降低译码复杂度。考虑场景权重分布的差异性，根据剪枝错误概率的均匀约束条件，为每个节点分别设计剪枝阈值，从而进一步减少译码过程中需要计算的场景数量。此外，利用联合权重分布的统计特性，提出了一种简化的阈值计算方法。采用该简化计算方法后，所需计算的场景数量从(d+1)(d+2)/2降低至d+1。