Improved segmented CRC assisted puncturing Polar decoding

Yanhong NI; Xiangxiong LOU; Jianrong BAO

doi:10.11959/j.issn.1000-0801.2019007

您当前的位置：

首页 >

文章列表页 >

Improved segmented CRC assisted puncturing Polar decoding

research and development | 更新时间：2024-06-05

- Improved segmented CRC assisted puncturing Polar decoding
- Telecommunications Science Vol. 35, Issue 3, Pages: 91-98(2019)
- 作者机构：
- 作者简介：
- 基金信息：
- DOI：10.11959/j.issn.1000-0801.2019007
  CLC： TN911
- Published Online：2019-03，
  
  Published：20 March 2019
- 稿件说明：
移动端阅览
Yanhong NI, Xiangxiong LOU, Jianrong BAO. Improved segmented CRC assisted puncturing Polar decoding[J]. Telecommunications science, 2019, 35(3): 91-98.
DOI：

Yanhong NI, Xiangxiong LOU, Jianrong BAO. Improved segmented CRC assisted puncturing Polar decoding[J]. Telecommunications science, 2019, 35(3): 91-98. DOI： 10.11959/j.issn.1000-0801.2019007.

摘要

提出了一种分段循环冗余校验（CRC）辅助的删余译码算法。该方法利用BP译码的大并行度和CRC校验的高可靠性，将CRC校验比特均匀或按比例分散插入原信息比特中。仿真表明：当码长N为1 024、信噪比为3.5 dB时，分段CRC（2

16×2）和CRC（2

24+8）相比基于G矩阵检测译码平均迭代次数分别少2.7次和2.8次；当码长M为896时，误码率为10

-5

的两种分段CRC相比无CRC辅助BP删余译码，均获得约0.7 dB增益。

Abstract

A segmented cyclic redundancy check (CRC) assisted decoding algorithm was proposed.This method makes use of the high parallelism of BP decoding and the high reliability of CRC verification

and uniformly or proportionally disperses CRC verification bits into the original information bits.Simulation results show that when the code length N is 1 024 and the SNR is 3.5 dB

the average iterations of segmented CRC（2

16×2）and CRC (2

24+8) are 2.7 and 2.8 times less than those of G matrix based decoding.When the code length M is 896

the two segmented methods with a bit error rate of 10

-5

obtained about 0.7 dB gain compared with the non-CRC assisted BP puncturing decoding.

关键词

Keywords

references

SHANNON C E . A mathematical theory of communication [J ] . ACM SIGMOBILE Mobile Computing and Communications Review , 2001 , 5 ( 1 ): 3 - 55 .

ARIKAN E . A performance comparison of polar codes and Reed-Muller codes [J ] . IEEE Communications Letters , 2008 , 12 ( 6 ).

YANG J , ZHANG C , ZHOU H , et al . Pipelined belief propagation Polar decoders [C ] // 2016 IEEE International Symposium on Circuits and Systems (ISCAS),May 22-25,2016,Montreal,QC,Canada . Piscataway:IEEE Press , 2016 : 413 - 416 .

ZHANG Y , LIU A , PAN X , et al . A modified belief propagation Polar decoder [J ] . IEEE Communications Letters , 2014 , 18 ( 7 ): 1091 - 1094 .

YUAN B , PARHI K K . Early stopping criteria for energy-efficient low-latency belief-propagation polar code decoders [J ] . IEEE Transactions on Signal Processing , 2014 , 62 ( 24 ): 6496 - 6506 .

3GPP.Multiplexing and channel coding (FDD):TS25.212 [S ] . 2009 .

KWON Y H , OH M K , PARK D J . A new LDPC decoding algorithm aided by segmented cyclic redundancy checks for magnetic recording channels [J ] . IEEE Transactions on Magnetics , 2005 , 41 ( 7 ): 2318 - 2320 .

KOOPMAN P , CHAKRAVARTY T . Cyclic redundancy code (CRC) polynomial selection for embedded networks [C ] // 2004 International Conference on Dependable Systems and Networks,June 28-July 1,2004,Florence,Italy . Washington DC:IEEE Computer Society , 2004 : 145 - 154 .

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 .

SARKIS G , GIARD P , VARDY A , et al . Fast list decoders for polar codes [J ] . IEEE Journal on Selected Areas in Communications , 2016 , 34 ( 2 ): 318 - 328 .

HAGENAUER J . Rate-compatible punctured convolutional codes (RCPC codes) and their applications [J ] . IEEE Transactions on Communications , 1988 , 36 ( 4 ): 389 - 400 .

WANG R , LIU R . A novel puncturing scheme for Polar Codes [J ] . IEEE Communications Letters , 2014 , 18 ( 12 ): 2081 - 2084 .

BIOGLIO V , GABRY F , LAND I . Low-complexity puncturing and shortening of Polar codes [C ] // Wireless Communications and Networking Conference Workshops (WCNCW),March 19-22,2017,San Francisco,CA,USA . Piscataway:IEEE Press , 2017 : 1 - 6 .

HANIF M A , VAFI S . An efficient puncturing method for the short and long length polar codes [C ] // 2017 11th International Conference on Signal Processing and Communication Systems (ICSPCS),Dec 13-15,2017,Surfers Paradise,QLD,Australia . Piscataway:IEEE Press , 2017 : 1 - 5 .

FORNEY G D . Codes on graphs:normal realizations [J ] . IEEE Transactions on Information Theory , 2001 , 47 ( 2 ): 520 - 548 .

ESLAMI A , PISHRO-NIK H . A practical approach to polar codes [C ] // 2011 IEEE International Symposium on Information Theory (ISIT),July 31-Aug 5,2011,St.Petersburg,Russia . Piscataway:IEEE Press , 2011 : 16 - 20 .

翟平衡 , 沈斌松 , 梁进波 . Polar 码在分集接收系统中的性能 [J ] . 电信科学 , 2018 , 34 ( 2 ): 32 - 38 .

ZHAI P H , SHEN B S , LIANG J B . Performance of Polar code in diversity reception system [J ] . Telecommunications Science , 2018 , 34 ( 2 ): 32 - 38 .

YUAN B , PARHI K K . Early stopping criteria for energy-efficient low-latency belief-propagation polar code decoders [J ] . IEEE Transactions on Signal Processing , 2014 , 62 ( 24 ): 6496 - 6506 .

赵生妹 , 邵珠要 , 陈汉武 . 基于译码可靠性的系统 Polar 码删余方法 [J ] . 东南大学学报(自然科学版) , 2017 , 47 ( 1 ): 23 - 27 .

ZHAO S M , SHAO Z Y , CHEN H W . Puncturing method for systematic Polar code based on decoding reliability [J ] . Journal of Southeast University (Natural Science Edition) , 2017 , 47 ( 1 ): 23 - 27 .

Views

578

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰