Design of concatenated Hash-Polar code based on segmented CRC code

Zhengjie LI; Shunlan LIU; Xu ZHANG

doi:10.11959/j.issn.1000-0801.2022168

您当前的位置：

首页 >

文章列表页 >

Design of concatenated Hash-Polar code based on segmented CRC code

Research and Development | 更新时间：2024-06-05

- Design of concatenated Hash-Polar code based on segmented CRC code
- Telecommunications Science Vol. 38, Issue 7, Pages: 96-105(2022)
- 作者机构：
- 作者简介：
- 基金信息：
- DOI：10.11959/j.issn.1000-0801.2022168
  CLC： TN925
- Published Online：2022-07，
  
  Published：20 July 2022
- 稿件说明：
移动端阅览
Zhengjie LI, Shunlan LIU, Xu ZHANG. Design of concatenated Hash-Polar code based on segmented CRC code[J]. Telecommunications science, 2022, 38(7): 96-105.
DOI：

Zhengjie LI, Shunlan LIU, Xu ZHANG. Design of concatenated Hash-Polar code based on segmented CRC code[J]. Telecommunications science, 2022, 38(7): 96-105. DOI： 10.11959/j.issn.1000-0801.2022168.

摘要

极化码作为一种线性分组码，具有较低的编码复杂度和确定的构造，但当其为中短码长时，性能会有所降低。提出一种基于分段循环冗余校验（cyclic redundancy check，CRC）码级联Hash极化码的设计方法，该方法在原有Hash极化码（Hash-Polar）的基础上，采用CRC分段校验进行双校验，分段CRC码在译码过程中能辅助路径度量，即对译码路径进行修饰，以此提高路径选择的可靠性，提高性能；另外，分段校验是将校验码分散地添加到输入的信息序列中，译码时对于CRC不通过的情况，可提前终止译码路径以省去不必要的译码计算量。最后，译码结束时，Hash校验码对修饰后的L条路径进行校验，选出最佳译码路径。仿真结果表明，所提出的设计方法比 CRC 辅助的 Hash 极化码（Hash-CRC-Polar）误码性能更优异。在高斯信道下，当码长为 128 bit、码率为 1/2、误码率为 10

-3

时，所提出的基于分段 CRC 校验码的 Hash 极化码比Hash-CRC-Polar获得了约0.25 dB的增益。

Abstract

As a linear block code

the polarization code has a lower coding complexity and a definite structure

but when it has a short or medium code length

the performance will be reduced.A design method of concatenated HashPolar codes based on segmented cyclic redundancy check (CRC) codes was proposed

which was based on the original Hash-Polar code and used CRC segmented check for double check.The segmented CRC code could assist the path measurement in the decoding process

that was

modify the decoding path

so as to improve

the reliability of path selection and the performance.In addition

the segmented check was to add the check code dispersedly to the input information sequence.If the CRC failed during decoding

the decoding path could be terminated in advance to save unnecessary decoding calculations.Finally

at the end of the decoding

Hash check code verified the modified L paths and selected the best decoding path.The simulation results show that the design method proposed has better bit-error-rate performance than CRC-assisted Hash-Polar (Hash-CRC-Polar).In the Gaussian channel

when the code length is 128 bit

the code rate is 1/2

and the bit error rate is 10

-3

the Hash-Polar code based on the segmented CRC code proposed achieves a gain of about 0.25 dB over Hash-CRC-Polar.

关键词

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 .

3GPP . Mutiplexing and channel coding (Release 15):3GPP TS 38.212 v15.0.0 [R ] . 2017 .

BALATSOUKAS-STIMMING A , PARIZI M B , BURG A . LLR-based successive cancellation list decoding of polar codes [J ] . IEEE Transactions on Signal Processing , 2015 , 63 ( 19 ): 5165 - 5179 .

WANG T , QU D , JIANG T . Parity-check-concatenated polar codes [J ] . IEEE Communications Letters , 2016 , 20 ( 12 ): 2342 - 2345 .

CHEN P Y , XU M Z , BAI B M , et al . Design and performance of polar codes for 5G communication under high mobility scenarios [C ] // Proceedings of 2017 IEEE 85th Vehicular Technology Conference . Piscataway:IEEE Press , 2017 : 1 - 5 .

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

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

NIU K , CHEN K , LIN J R . Beyond turbo codes:rate-compatible punctured polar codes [C ] // Proceedings of 2013 IEEE International Conference on Communications . Piscataway:IEEE Press , 2013 : 3423 - 3427 .

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

ZHANG Y X , ZHANG Q S , PAN X F , et al . A simplified belief propagation decoder for polar codes [C ] // Proceedings of 2014 IEEE International Wireless Symposium . Piscataway:IEEE Press , 2014 : 1 - 4 .

NZU K , CHEN K . Stack decoding of pdar codes [J ] . Electronics Letters , 2012 , 48 ( 12 ): 695 - 687 .

HASHEMI S A , CONDO C , GROSS W J . Fast and flexible successive-cancellation list decoders for polar codes [J ] . IEEE Transactions on Signal Processing , 2017 , 65 ( 21 ): 5756 - 5769 .

JENKINS B . A hash function for hash table lookup [J ] . Dr Dobb's , 1997 .

MORI R , TANAKA T . Performance of polar codes with the construction using density evolution [J ] . IEEE Communications Letters , 2009 , 13 ( 7 ): 519 - 521 .

TRIFONOV P . Efficient design and decoding of polar codes [J ] . IEEE Transactions on Communications , 2012 , 60 ( 11 ): 3221 - 3227 .

NIU K , LI Y . Polar codes for fast fading channel:design based on polar spectrum [J ] . IEEE Transactions on Vehicular Technology , 2020 , 69 ( 9 ): 10103 - 10114 .

HE G N , BELFIORE J C , LAND I , et al . Beta-expansion:a theoretical framework for fast and recursive construction of polar codes [C ] // Proceedings of GLOBECOM 2017 - 2017 IEEE Global Communications Conference . Piscataway:IEEE Press , 2017 : 1 - 6 .

Huawei , HiSilicon . Polar code design and rate matching,3GPP TSG RAN WG1 Meeting 86:3GPP R1-167209 [R ] . 2016 .

Views

240

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

SSCANL decoder based joint iterative detection and decoding algorithm

A novel method for encoding and decoding based on enhanced parity-check-concatenated polar codes

Research on multi-bit decoding algorithms for polar codes

Standardization of 5G new radio technology oriented Polar code

Related Author

Chongyang LIU

Rui GUO

Yan WANG

Zhenzhen XI

Jianrong BAO

Zhouqing SHEN

Junna SHANG

Desheng XIE

Related Institution

No data

⁰