基于简化序列重复节点的极化码快速串行抵消译码算法

doi:10.11959/j.issn.1000-436x.2023088

通信学报 ›› 2023, Vol. 44 ›› Issue (5): 158-168.doi: 10.11959/j.issn.1000-436x.2023088

基于简化序列重复节点的极化码快速串行抵消译码算法

郭锐, 刘洋

杭州电子科技大学通信工程学院，浙江杭州 310018

修回日期:2023-04-10 出版日期:2023-05-25 发布日期:2023-05-01
作者简介:郭锐（1980- ），男，湖北十堰人，博士，杭州电子科技大学副教授、硕士生导师，主要研究方向为认知无线通信、信道编码
刘洋（1997- ），男，河南信阳人，杭州电子科技大学硕士生，主要研究方向为信道编码
基金资助:
浙江省重点研发计划基金资助项目(2023C03014)

Simplified sequence repetition nodes-based fast successive cancellation decoding algorithm for polar code

Rui GUO, Yang LIU

School of Communication Engineering, Hangzhou Dianzi University, Hangzhou 310018, China

Revised:2023-04-10 Online:2023-05-25 Published:2023-05-01
Supported by:
The Key Research and Development Program of Zhejiang Province(2023C03014)

摘要/Abstract

摘要：

为了进一步降低串行抵消（SC）译码算法的译码时延，在序列重复（SR）节点的基础上，根据SR源节点的类型与译码复杂度，对不同类型的拓展类广义奇偶校验（EG-PC）节点进行分解、合并和简化，并使用快速简化串行抵消（Fast-SSC）译码对Rate-C节点进行裁剪处理，提出了基于简化SR节点的极化码快速SC译码算法（SSRFSC）。实验数据表明，在相近的译码性能下（在误帧率为10^-3时，约有0.1 dB的性能损失），与基于SR节点的快速SC（SRFSC）译码算法相比，所提算法的译码时延最多减少了28%；与Fast-SSC译码算法相比，译码时延最多减少了49%。

关键词: 极化码, 快速简化串行抵消, 简化序列重复节点, 译码时延

Abstract:

In order to reduce the decoding latency of the successive cancellation (SC) decoding algorithm further, a kind of fast SC decoding algorithm based on simplified sequence repetition (SR) nodes, namely simplified sequence repetition node-based fast SC (SSRFSC), was proposed to optimize decoding latency issues of SC decoding algorithm.Different types of extended class of generalized parity-check (EG-PC) nodes were decomposed, merged and simplified based on the type of SR source node and decoding complexity, and Rate-C node was trimmed using fast simplified successive cancellation (Fast-SSC) decoding.Experimental results show that the decoding latency of the proposed algorithm can be reduced by up to 28% compared to the latest simplified sequence repetition (SRFSC) decoding algorithm when achieving similar decoding performance (approximately 0.1dB performance loss at frame error rate of 10^-3).Moreover, compared to the Fast-SSC decoding algorithm, the decoding latency of proposed algorithm can be reduced by up to 49%.

Key words: polar code, Fast-SSC, simplified SR node, decoding latency

中图分类号:

TN911.22

郭锐, 刘洋. 基于简化序列重复节点的极化码快速串行抵消译码算法[J]. 通信学报, 2023, 44(5): 158-168.

Rui GUO, Yang LIU. Simplified sequence repetition nodes-based fast successive cancellation decoding algorithm for polar code[J]. Journal on Communications, 2023, 44(5): 158-168.

图/表 14

图1

图2

图3

图4

表1

图5

图6

图7

表2

图8

图9

表3

图10

图11

参考文献 17

[1]	ARIKAN E . Channel polarization:a method for constructing capacity-achieving codes[C]// Proceedings of 2008 IEEE International Symposium on Information Theory. Piscataway:IEEE Press, 2008: 1173-1177.
[2]	3GPP TSG RAN WG1. Chairman's notes of agenda item 7.1.5 channel coding and modulation[EB]. 2016.
[3]	3GPP. 5G;NR;multiplexing and channel coding:TS 38.212[S]. 2018.
[4]	GAMAGE H , RAJATHEVA N , LATVA-AHO M . Channel coding for enhanced mobile broadband communication in 5G systems[C]// Proceedings of 2017 European Conference on Networks and Communications (EuCNC). Piscataway:IEEE Press, 2017: 1-6.
[5]	NIU K , CHEN K , LIN J R ,et al. Polar codes:primary concepts and practical decoding algorithms[J]. IEEE Communications Magazine, 2014,52(7): 192-203.
[6]	ZHANG C , YUAN B , PARHI K K . Reduced-latency SC polar decoder architectures[C]// Proceedings of 2012 IEEE International Conference on Communications (ICC). Piscataway:IEEE Press, 2012: 3471-3475.
[7]	YUAN B , PARHI K K . Low-latency successive-cancellation polar decoder architectures using 2-bit decoding[J]. IEEE Transactions on Circuits and Systems I:Regular Papers, 2014,61(4): 1241-1254.
[8]	YUAN B , PARHI K K . Reduced-latency LLR-based SC list decoder for polar codes[C]// Proceedings of the 25th Great Lakes Symposium on VLSI. New York:ACM Press, 2015: 107-110.
[9]	YUAN B , PARHI K K . Low-latency successive-cancellation list decoders for polar codes with multibit decision[J]. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2015,23(10): 2268-2280.
[10]	HUSMANN C , NIKOLAOU P C , NIKITOPOULOS K . Reduced latency ML polar decoding via multiple sphere-decoding tree searches[J]. IEEE Transactions on Vehicular Technology, 2018,67(2): 1835-1839.
[11]	ALAMDAR-YAZDI A , KSCHISCHANG F R . A simplified succes sive-cancellation decoder for polar codes[J]. IEEE Communications Letters, 2011,15(12): 1378-1380.
[12]	SARKIS G , GIARD P , VARDY A ,et al. Fast polar decoders:algorithm and implementation[J]. IEEE Journal on Selected Areas in Communications, 2014,32(5): 946-957.
[13]	HANIF M , ARDAKANI M . Fast successive-cancellation decoding of polar codes:identification and decoding of new nodes[J]. IEEE Communications Letters, 2017,21(11): 2360-2363.
[14]	CONDO C , BIOGLIO V , LAND I . Generalized fast decoding of polar codes[C]// Proceedings of IEEE Global Communications Conference (GLOBECOM). Piscataway:IEEE Press, 2019: 1-6.
[15]	GAMAGE H , RANASINGHE V , RAJATHEVA N ,et al. Low latency decoder for short blocklength polar codes[C]// Proceedings of 2020 European Conference on Networks and Communications (EuCNC). Piscataway:IEEE Press, 2020: 305-310.
[16]	ZHENG H T , BALATSOUKAS-STIMMING A , CAO Z Z ,et al. Implementation of a high-throughput fast-SSC polar decoder with sequence repetition node[C]// Proceedings of 2020 IEEE Workshop on Signal Processing Systems (SiPS). Piscataway:IEEE Press, 2020: 1-6.
[17]	ZHENG H T , HASHEMI S A , BALATSOUKAS-STIMMING A , ,et al. Threshold-based fast successive-cancellation decoding of polar codes[J]. IEEE Transactions on Communications, 2021,69(6): 3541-3555.

可优化类型	N=256				N=1 024
可优化类型
分解	14.3%	0	6.3%	0	0	6.1%	4.4%	6.8%
合并	0	18.2%	6.3%	16.7%	15.8%	6.1%	8.9%	6.8%
简化	28.6%	36.4%	25%	25%	31.6%	33.1%	31.1%	20.5%
合计	42.9%	54.6%	37.6%	41.7%	47.4%	45.3%	44.4%	34.1%

译码步骤	消耗的时间步数
计算源节点LLR	1
源节点译码	0（Rate-1）
	1或2（SPC）
路径选择	0或2

基于简化序列重复节点的极化码快速串行抵消译码算法

Simplified sequence repetition nodes-based fast successive cancellation decoding algorithm for polar code

在线阅读

PDF下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 14

参考文献 17

相关文章 6

Metrics

推荐阅读 0

N	R	SR						非SR
N	R	\|S\|=1	2	4	8	16	合计	Rate-1	REP	SPC
256		1	1	1	0	0	3	1	2	1
		1	3	0	1	1	5	2	0	4
		2	2	1	1	0	6	3	2	5
		1	2	2	0	0	5	2	0	5
1024		2	3	2	1	1	9	1	3	5
		4	5	5	1	0	15	3	6	9
		5	10	3	2	0	20	7	3	15
		6	6	2	1	0	15	13	4	12

[1]	李君, 周乐佳, 李正权, 吉茹, 诸锦涛, 刘兴鑫, 刘子怡. 基于GRU网络辅助和路径度量交换的极化码SCLF算法[J]. 通信学报, 2023, 44(6): 223-237.
[2]	王垚, 王翔, 杨国东, 黄知涛. 基于编码矩阵结构特征的非删余极化码参数盲识别算法[J]. 通信学报, 2022, 43(2): 22-33.
[3]	牛凯,戴金晟,朴瑨楠. 面向6G的极化码与极化处理[J]. 通信学报, 2020, 41(5): 9-17.
[4]	吴昭军, 钟兆根, 张立民, 但波. 基于软判决下的不删余极化码参数识别[J]. 通信学报, 2020, 41(12): 60-71.
[5]	李晖,叶铭,童强,程杰,王力杰. 系统极化码和非系统极化码的性能比较[J]. 通信学报, 2019, 40(6): 203-209.
[6]	马林华,刘士平,胡星,黄天宇,徐彬. 系统极化码低复杂度编码优化方案[J]. 通信学报, 2018, 39(7): 132-138.