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

郭锐; 刘洋; 何美霖; 刘兆霆; 赵宜楠

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

您当前的位置：

首页 >

文章列表页 >

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

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

- 基于关键简化集合的极化码SSRFSC翻转译码算法
- SSRFSC flipping decoding algorithm based on critical simplification set for polar codes
- 通信学报 2024年45卷第10期页码：95-106
- 作者机构：
  
  杭州电子科技大学通信工程学院，浙江杭州 310018
- 作者简介：
  
  [ "郭锐（1980- ），男，湖北十堰人，博士，杭州电子科技大学副教授、硕士生导师，主要研究方向为无线通信、信道编码。" ]
  [ "刘洋（1997- ），男，河南信阳人，杭州电子科技大学硕士生，主要研究方向为信道编码。" ]
  [ "何美霖（1986- ），女，湖南衡阳人，博士，杭州电子科技大学讲师、硕士生导师，主要研究方向为认知无线通信、无线通信、多码率编码。" ]
  [ "刘兆霆（1975- ），男，江西广丰人，博士，杭州电子科技大学副教授、硕士生导师，主要研究方向为无信通信、雷达信号处理。" ]
  [ "赵宜楠（1977- ），男，黑龙江哈尔滨人，博士，杭州电子科技大学教授、博士生导师，主要研究方向为认知无线通信、信号处理。" ]
- 基金信息：
  
  国家自然科学基金资助项目(62371174)
- DOI：10.11959/j.issn.1000-436x.2024171
  中图分类号： TN92
- 收稿日期：2024-05-10，
  
  修回日期：2024-08-28，
  
  纸质出版日期：2024-10-25
- 稿件说明：
移动端阅览
郭锐,刘洋,何美霖等.基于关键简化集合的极化码SSRFSC翻转译码算法[J].通信学报,2024,45(10):95-106.

GUO Rui,LIU Yang,HE Meilin,et al.SSRFSC flipping decoding algorithm based on critical simplification set for polar codes[J].Journal on Communications,2024,45(10):95-106.
郭锐,刘洋,何美霖等.基于关键简化集合的极化码SSRFSC翻转译码算法[J].通信学报,2024,45(10):95-106. DOI： 10.11959/j.issn.1000-436x.2024171.

GUO Rui,LIU Yang,HE Meilin,et al.SSRFSC flipping decoding algorithm based on critical simplification set for polar codes[J].Journal on Communications,2024,45(10):95-106. DOI： 10.11959/j.issn.1000-436x.2024171.

摘要

为提高基于简化序列重复节点的快速串行抵消（SSRFSC）译码算法的译码性能，提出了基于关键简化集合（CSS）和简化序列重复（SSR）节点的CSS-SSR-Flip译码算法。所提算法首先选取SSR中最长重复（REP）节点的信息位作为候选比特（CB），从而构造了基于SSR的CSS；然后针对SSR节点的译码特点设计了相应的翻转度量和翻转准则，通过考虑SSR节点中重复序列和源节点对译码的影响来度量CB可靠性，在特定CB翻转时选择次优的重复序列完成SSR节点翻转操作。实验数据表明，当误帧率

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=69022726&type=

2.53999996

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=69022738&type=

15.15533447

时，所提出的CSS-SSR-Flip译码算法与传统的快速简化串行抵消翻转（Fast-SSC-Flip）译码算法相比能够获得超过0.1 dB的性能增益，且具有与新型Fast-SSC-Flip（New-Fast-SSC-Flip）译码算法相同的译码性能；与传统翻转集合大小

相比，CSS大小缩减最多达79.5%，与关键集合（CS）相比集合大小最多可缩减23.1%。

Abstract

To improve the decoding performance of the simplified sequence repetition node-based fast successive cancellation (SSRFSC) decoding algorithm

a decoding algorithm (CSS-SSR-Flip) based on critical simplified set (CSS) and simplified sequence repetition (SSR) nodes was designed. Firstly

the information bit of the longest repetition (REP) node in SSR was selected as candidate bit (CB)

thus constructing a CSS based on SSR. Corresponding flip metrics and flip criterion were designed according to the

decoding characteristics of SSR nodes. Secondly

the CB reliability was measured by considering the influence of repetition sequences and the source of SSR nodes on decoding

and suboptimal repetition sequences were selected to complete SSR node flip operations during specific CB flips. Experimental data shows that at frame error rates of

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=69022740&type=

2.53999996

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=69022741&type=

5.41866684

CSS-SSR-Flip decoding algorithm is able to obtain more than 0.1 dB performance gain compared to the traditional fast simplified successive cancellation filp (Fast-SSC-Flip) decoding algorithm

and has the same decoding performance as the new Fast-SSC-Flip (New-Fast-SSC-Flip) decoding algorithm. However

compared to the traditional flip set size

the CSS size of the proposed algorithm is reduced by up to 79.5%

and compared to the critical set (CS)

the set size can be reduced by up to 23.1%.

关键词

Keywords

references

ARIKAN E . Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels [J ] . IEEE Transactions on Information Theory , 2009 , 55 ( 7 ): 3051 - 3073 .

TAL I , VARDY A . List decoding of polar codes [J ] . IEEE Transactions on Information Theory , 2015 , 61 ( 5 ): 2213 - 2226 .

NIU K , CHEN K . CRC-aided decoding of polar codes [J ] . IEEE Communications Letters , 2012 , 16 ( 10 ): 1668 - 1671 .

LI B , SHEN H , TSE D . An adaptive successive cancellation list decoder for polar codes with cyclic redundancy check [J ] . IEEE Communications Letters , 2012 , 16 ( 12 ): 2044 - 2047 .

AFISIADIS O , BALATSOUKAS-STIMMING A , BURG A . A low-complexity improved successive cancellation decoder for polar codes [C ] // Proceedings of the 2014 48th Asilomar Conference on Signals, Systems and Computers . Piscataway : IEEE Press , 2014 : 2116 - 2120 .

CONDO C , ERCAN F , GROSS W J . Improved successive cancellation flip decoding of polar codes based on error distribution [C ] // Proceedings of the 2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW) . Piscataway : IEEE Press , 2018 : 19 - 24 .

CHANDESRIS L , SAVIN V , DECLERCQ D . Dynamic-SCFlip decoding of polar codes [J ] . IEEE Transactions on Communications , 2018 , 66 ( 6 ): 2333 - 2345 .

ERCAN F , TONNELLIER T , DOAN N , et al . Simplified dynamic SC-flip polar decoding [C ] // Proceedings of the ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) . Piscataway : IEEE Press , 2020 : 1733 - 1737 .

ZHANG X T , LIU Y Z , CHEN S P . BER evaluation based SCFlip algorithm for polar codes decoding [J ] . IEEE Access , 2003 , 8 : 3042 - 3054 .

GIARD P , BURG A . Fast-SSC-Flip decoding of polar codes [J ] . arXiv Preprint , arXiv: 1712.00256 , 2017 .

ZHOU Y C , LIN J , WANG Z F . A new Fast-SSC-Flip decoding of polar codes [C ] // Proceedings of the ICC 2019 - 2019 IEEE International Conference on Communications (ICC) . Piscataway : IEEE Press , 2019 : 1 - 6 .

ZHANG Z Y , QIN K J , ZHANG L , et al . Progressive bit-flipping decoding of polar codes: a critical-set based tree search approach [J ] . IEEE Access , 2018 , 6 : 57738 - 57750 .

ERCAN F , GROSS W J . Fast thresholded SC-Flip decoding of polar codes [C ] // Proceedings of the ICC 2020 - 2020 IEEE International Conference on Communications (ICC) . Piscataway : IEEE Press , 2020 : 1 - 7 .

ZHENG H T , ALI HASHEMI S , BALATSOUKAS-STIMMING A , et al . Threshold-based fast successive-cancellation decoding of polar codes [J ] . IEEE Transactions on Communications , 2021 , 69 ( 6 ): 3541 - 3555 .

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

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

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 the 2020 IEEE Workshop on Signal Processing Systems (SiPS) . Piscataway : IEEE Press , 2020 : 1 - 6 .

浏览量

下载量

CSCD

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

提交

工具集

关联资源

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

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

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

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