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

郭锐; 刘洋

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

您当前的位置：

首页 >

文章列表页 >

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

学术论文 | 更新时间：2024-06-06

- 基于简化序列重复节点的极化码快速串行抵消译码算法
- Simplified sequence repetition nodes-based fast successive cancellation decoding algorithm for polar code
- 通信学报 2023年44卷第5期页码：158-168
- 作者机构：
  
  杭州电子科技大学通信工程学院，浙江杭州 310018
- 作者简介：
  
  [ "郭锐（1980- ），男，湖北十堰人，博士，杭州电子科技大学副教授、硕士生导师，主要研究方向为认知无线通信、信道编码" ]
  [ "刘洋（1997- ），男，河南信阳人，杭州电子科技大学硕士生，主要研究方向为信道编码" ]
- 基金信息：
  
  浙江省重点研发计划基金资助项目(2023C03014)
- DOI：10.11959/j.issn.1000-436x.2023088
  中图分类号： TN911.22
- 网络出版日期：2023-05，
  
  纸质出版日期：2023-05-25
- 稿件说明：
移动端阅览
郭锐, 刘洋. 基于简化序列重复节点的极化码快速串行抵消译码算法[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.
郭锐, 刘洋. 基于简化序列重复节点的极化码快速串行抵消译码算法[J]. 通信学报, 2023,44(5):158-168. DOI： 10.11959/j.issn.1000-436x.2023088.

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. DOI： 10.11959/j.issn.1000-436x.2023088.

摘要

为了进一步降低串行抵消（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 th

e 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%.

关键词

Keywords

references

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 .

3GPP TSG RAN WG1 . Chairman's notes of agenda item 7.1.5 channel coding and modulation [EB ] . 2016 .

3GPP . 5G;NR;multiplexing and channel coding:TS 38.212 [S ] . 2018 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

ALAMDAR-YAZDI A , KSCHISCHANG F R . A simplified succes sive-cancellation decoder for polar codes [J ] . IEEE Communications Letters , 2011 , 15 ( 12 ): 1378 - 1380 .

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 .

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 .

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 .

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 .

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 .

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 .

浏览量

529

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

基于关键简化集合的极化码SSRFSC翻转译码算法

基于GRU网络辅助和路径度量交换的极化码SCLF算法

基于软判决下的不删余极化码参数识别

系统极化码低复杂度编码优化方案