一种提升最小距离的CRC-Polar码设计方法

doi:10.19665/j.issn1001-2400.2020.06.011

西安电子科技大学学报 ›› 2020, Vol. 47 ›› Issue (6): 72-77.doi: 10.19665/j.issn1001-2400.2020.06.011

• 面对B5G/6G的信息传输与接入技术进展 • 上一篇下一篇

一种提升最小距离的CRC-Polar码设计方法

宋嘉伟¹(),郑惠娟²,童胜¹

1.西安电子科技大学综合业务网理论及关键技术国家重点实验室,陕西西安 710071
2.西安邮电大学电子工程学院,陕西西安 710121

收稿日期:2020-07-01 出版日期:2020-12-20 发布日期:2021-01-06
作者简介:宋嘉伟(1995—),男,西安电子科技大学硕士研究生,E-mail: jwsong@stu.xidian.edu.cn
基金资助:
国家自然科学基金(61871029);中央高校基本科研业务项目(JB190122)

Method for designing CRC-Polar codes to improve minimum distances

SONG Jiawei¹(),ZHENG Huijuan²,TONG Sheng¹

1. State Key Laboratory of Integrated Service Networks, Xidian University,Xi’an 710071,China
2. School of Electronic Engineering, Xi’an University of Posts and Telecommunications,Xi’an 710121,China

Received:2020-07-01 Online:2020-12-20 Published:2021-01-06

摘要/Abstract

摘要：

鉴于级联CRC-Polar码在短码长时的优异纠错性能,5G标准已经采纳级联CRC-Polar码作为eMBB场景下控制信道的信道编码方案。为了提升级联CRC-Polar码的最小汉明距离,改善其在高信噪比时的纠错性能,同时考虑了循环冗余校验码的优化设计和极化码信息位选择对级联编码最小距离的影响,提出了一种新的级联CRC-Polar码设计方案。采用所提方案设计的CRC-Polar码在相同参数下能够减少最小重量码字数目,甚至在某些参数下能够提升级联CRC-Polar码的最小距离。仿真结果验证了所提设计方法的有效性。

关键词: 极化码, 循环冗余校验, 最小距离

Abstract:

In view of the excellent error correction performance of short concatenated CRC-Polar codes, the 5G standard has adopted concatenated CRC-Polar codes as the channel coding scheme for control channels in the eMBB scenario. This paper examines the optimal design of concatenated CRC-Polar codes, and aims to increase the minimum distance of concatenated CRC-Polar codes in order to improve their error correction performance at the high SNR region. To this end, this paper considers both the optimal design of the CRC code and the selection of information bit positions on the minimum distance behaviors of concatenated codes, and proposes a new design method for concatenated CRC-Polar codes. The proposed scheme can effectively reduce the number of codewords with a minimum Hamming weight, and even can increase the minimum distances of concatenated CRC-Polar codes for some code parameters. Simulation results verify the effectiveness of the proposed design method.

Key words: polar code, cyclic redundancy check, minimum distance

中图分类号:

TN911.22

宋嘉伟,郑惠娟,童胜. 一种提升最小距离的CRC-Polar码设计方法[J]. 西安电子科技大学学报, 2020, 47(6): 72-77.

SONG Jiawei,ZHENG Huijuan,TONG Sheng. Method for designing CRC-Polar codes to improve minimum distances[J]. Journal of Xidian University, 2020, 47(6): 72-77.

图/表 5

图1

图2

图3

表1

图4

参考文献 12

[1]	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. doi: 10.1109/TIT.2009.2021379
[2]	TAL I, VARDY A. List Decoding of Polar Codes[J]. IEEE Transactions on Information Theory, 2015, 61(5): 2213-2226. doi: 10.1109/TIT.2015.2410251
[3]	WANG T, QU D M, JIANG T. Parity-check-concatenated Polar Codes[J]. IEEE Communications Letters, 2016, 20(12): 2342-2345. doi: 10.1109/LCOMM.2016.2607169
[4]	CAI X W, WANG T, QU DM, et al. Hybrid CRC and Parity-Check-Concatenated Polar Codes with Shared Encoder[C]// Proceedings of the 2019 IEEE International Conference on Computing, Communication and IoT Application. Piscataway:IEEE, 2019: 288-292.
[5]	RICCIUTELLI G, BALDI M, CHIARALUCE F. Interleaved Design for Short Concatenated Codes[J]. IEEE Communications Letters, 2018, 22(9): 1762-1765. doi: 10.1109/LCOMM.2018.2855936
[6]	周田心, 李颖. 分组码级联极化码[J]. 西安电子科技大学学报, 2018, 45(5): 64-68.
	ZHOU Tianxin, LI Ying. Block Codes Concatenated Polar Codes[J]. Journal of Xidian University, 2018, 45(5): 64-68.
[7]	LIB, 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. doi: 10.1109/LCOMM.2012.111612.121898
[8]	ZHANG Q S, LIU A J, PAN X F, et al. CRC Code Design for List Decoding of Polar Codes[J]. IEEE Communications Letters, 2017, 21(6): 1229-1232. doi: 10.1109/LCOMM.2017.2672539
[9]	ZHANG Q S, LIU A J, PAN X F. Efficient CRC Concatenation Scheme for Polar Codes[J]. Electronics Letters, 2017, 53(13): 860-862. doi: 10.1049/ell2.v53.13
[10]	CHENG F Y, LIU A J, ZHANG Y X, et al. CRC Location Design for Polar Codes[J]. IEEE Communications Letters, 2018, 22(11): 2202-2205. doi: 10.1109/LCOMM.2018.2868067
[11]	LI B, SHEN H, TSE D. A RM-Polar Codes[J/OL]. [2020-06-22]. https://arxiv.org/ftp/arxiv/papers/1407/1407.5483.pdf.
[12]	TRIFONOV P. Efficient Design and Decoding of Polar Codes[J]. IEEE Transactions on Communications, 2012, 60(11): 3221-3227. doi: 10.1109/TCOMM.2012.081512.110872

(N,R,L_crc)	CRC码	w₁₂	w₁₆	w₂₄
(128,1/2,6)	[1000111]^[10]	256	29 592
(128,1/2,6)	[1000011]	0	31 000
(128,1/2,7)	[10010011]^[10]	128	26 520
(128,1/2,7)	[10111111]	0	22 808
(256,1/2,8)	[110110001]	0	960
(256,1/2,8)	[110101001]	0	386
(512,1/2,8)	[100110111]^[10]	0	128	3 588
(512,1/2,8)	[111101011]	0	0	3 066

一种提升最小距离的CRC-Polar码设计方法

Method for designing CRC-Polar codes to improve minimum distances

RichHTML

PDF (PC)

赞

可视化

摘要/Abstract

引用本文

使用本文

图/表 5

参考文献 12

相关文章 10

Metrics

本文评价

推荐阅读 10

[1]	牛凯,许文俊,张平. 面向6G的极化编码非正交多址接入[J]. 西安电子科技大学学报, 2020, 47(6): 5-12.
[2]	周沈洋,白宝明,任兆丰,朱敏,李秉豪,唐瑞波. 面向高吞吐传输的级联极化码BP List译码算法[J]. 西安电子科技大学学报, 2020, 47(6): 58-65.
[3]	张萌,李卓,邢莉娟. 加权和码辅助的极化码SCL译码算法[J]. 西安电子科技大学学报, 2020, 47(6): 66-71.
[4]	周田心;李颖. 分组码级联极化码[J]. 西安电子科技大学学报, 2018, 45(5): 64-68.
[5]	郝晓慧;车书玲;张欣瑜. LRC码最小距离限的深入分析[J]. 西安电子科技大学学报, 2018, 45(5): 75-79+135.
[6]	李桂萍;慕建君;焦晓鹏. 极化码串行抵消多比特翻转译码算法[J]. 西安电子科技大学学报, 2017, 44(2): 63-68.
[7]	洪银芳;李晖;王新梅. 一种改进的Polar码的BP译码算法[J]. 西安电子科技大学学报, 2016, 43(4): 39-44.
[8]	刘焕云;王军宁;何迪;涂尚斌. 仿生模式识别目标自适应跟踪算法[J]. J4, 2013, 40(4): 142-148.
[9]	刘德平1;2;陈建军1. 逆向工程中数据精简技术的研究 [J]. J4, 2008, 35(2): 334-339.
[10]	暂时无作者信息. 计算线性分组码汉明距离的遗传算法[J]. J4, 1999, 26(5): 537-541.