极化码并行连续消除列表译码的剪枝算法研究与改进  

Pruning Algorithm of Parallel Successive Cancellation List Decoders for Polar Codes

作　　者：陈珊 曹姗 江立旻 姜之源 

机构地区：[1]上海大学通信与信息工程学院,上海200444

出　　处：《工业控制计算机》2025年第2期38-40,共3页Industrial Control Computer

摘　　要：随着5G及未来6G无线通信系统在自动驾驶和远程医疗等领域的广泛应用,开发高可靠性和低时延的信道编解码技术愈发迫切。相较于传统的连续消除(Successive Cancellation,SC)和连续取消列表(Successive Cancelation List,SCL)译码,极化码的并行连续消除列表(Parallel Successive Cancelation List,PSCL)译码在减少译码延迟的同时可以保持较高的可靠性。然而,随着并行度P的增加,译码器中候选路径排序的复杂度呈指数倍增长,极大地限制了并行度的增长。针对这一问题,提出了一种路径剪枝算法。将关键集合引入PSCL译码,修剪较不可靠的候选路径,从而减少PSCL译码算法的复杂度。With the widespread application of 5G and future 6G wireless communication systems in areas such as autonomous driving and telemedicine,the desire to develop channel coding and decoding techniques with high reliability and low latency has become increasingly urgent.Compared to traditional successive cancellation(SC)and successive cancellation list(SCL)decoding,parallel successive cancellation list(PSCL)decoding of polar codes can maintain high reliability while reducing decoding latency.However,as the parallelism P increases,the complexity of candidate path sorting in the decoder grows exponentially,which severely limits the growth of parallelism.To address this problem,this paper proposes a path pruning algorithm.By introducing a critical set into PSCL decoding,unreliable candidate paths are pruned to ensure high decoding performance.

关 键 词：极化码 译码 剪枝 

分 类 号：TN911.22[电子电信—通信与信息系统] TN929.5[电子电信—信息与通信工程]