针对高维核矩阵构造的极化码中为提升纠错性能而造成的复杂度增加的问题,提出了基于3×3高维核矩阵终止极化码的构造方案。首先筛选出极化率最高的核矩阵G531构造终止极化码,并在二进制擦除信道上证明了在不影响纠错性能的前提下终止极化码能够降低编译码计算复杂度,同时推导出终止极化码的复杂度降低比的上下界。仿真表明,终止极化码复杂度降低比与二进制擦除信道(binary erasure channel,BEC)的擦除概率有关,在擦除概率为0.5左右时,复杂度降低比最小,且目标误帧率(frame error rate,FER)越高,复杂度降低比越大,在目标误帧率为10-5时,最高可实现71.43%的复杂度降低比。
Aiming at the problem of high complexity in the polarization code constructed by the high-dimensional kernel matrix to improve the error correction performance, a construction scheme based on the 3×3 high-dimensional kernel matrix terminating the polarization code is proposed. Firstly, the kernel matrix G531 with the highest polarization rate is selected to construct a termination polarization code, and it is theoretically proved on the binary erasure channel that the termination polarization code can reduce the computational complexity of encoding and decoding without affecting the error correction performance, and derive the upper and lower bounds of the complexity reduction ratio (CRC) of terminating polarization codes at the same time. Simulation shows that the complexity reduction ratio of the termination polarization code is related to the BEC (binary erasure channel) erasure probability. When the erasure probability is about 0.5, the complexity reduction ratio reaches the smallest, and the higher the target frame error rate (FER), the greater the complexity reduction ratio. When the FER is 10-5, the highest complexity reduction rate of 71.43% can be achieved.
[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.
[2] Korada S B, Sasoglu E, Urbanke R. Polar codes:characterization of exponent, bounds, and constructions[J]. IEEE Transactions on Information Theory, 2009, 56(12):6253-6264.
[3] Jin S, Liu J, Wang Z. Improved BP decoder for polar codes based on a modified kernel matrix[J]. Electronics Letters, 2016, 52(24):1982-1984.
[4] Liu Z, Kai N, Chao D, et al. Performance analysis of polar codes based on 3×3 kernel matrix[C]//International Conference on Communications & Networking in China. IEEE, 2016:382-386.
[5] Korada S B, Sasoglu E. A class of transformations that polarize symmetric binary-input memoryless channels[J]. Proceedings of the 2009 IEEE International Conference on Symposium on Information Theory, 2009, 3:1478-1482.
[6] Liang Z, Zhang Z, Wang X. Polar code with block-length N=3n[C]//International Conference on Wireless Communications & Signal Processing. IEEE, 2012:1-6.
[7] Mori R, Tanaka T. Channel polarization on q-ary discrete memoryless channels by arbitrary kernels[C]//2010 IEEE International Symposium on Information Theory. IEEE, 2010:894-898.
[8] Mori R, Tanaka T. Non-binary polar codes using Reed-Solomon codes and algebraic geometry codes[C]//2010 IEEE Information Theory Workshop. Dublin, 2010:1-5.
[9] Serbetci B, Pusane A E. On the selection of generator matrices for polar coded communication systems[C]//Signal Processing & Communications Applications Conference. IEEE, 2012:1-4.
[10] Mori R, Tanaka T. Performance of polar codes with the construction using density evolution[J]. IEEE Communications Letters, 2009, 13(7):519-521.
[11] Wu D, Li Y, Sun Y. Construction and block error rate analysis of polar codes over AWGN channel based on Gaussian approximation[J]. IEEE Communications Letters, 2014, 18(7):1099- 1102.
[12] 张施怡, 黄志亮, 周水红, 等. 一种基于蒙特卡洛的快速极化码构造方法[J]. 计算机工程, 2019, 45(9):76-81. Zhang S Y, Huang Z L, Zhou S H, et al. A Monte Carlo-based fast polarization code construction method[J]. Computer Engineering, 2019, 45(9):76-81. (in Chinese)
[13] 曹阳, 李岳, 李小红. 无线光通信中极化码构造方法研究[J]. 光学学报, 2020, 40(21):1-14. Cao Y, Li Y, Li X H. Research on polarization code construction method in wireless optical communication[J]. Acta Optica Sinica, 2020, 40(21):1-14. (in Chinese)
[14] El-Khamy M, Mahdavifar H, Feygin G, et al. Relaxed channel polarization for reduced complexity polar coding[C]//2015 IEEE Wireless Communications and Networking Conference (WCNC), 2015:207-212.
[15] El-Khamy M, Mahdavifar H, Feygin G, et al. Relaxed polar codes[J]. IEEE Transactions on Information Theory, 2017, 63(4):1986-2000.
[16] Cao Y, Zhang H, Tu Q. Decoding performance analysis of good-channel relaxed polar codes with 3×3 kernel matrix[J]. IET Communications, 2019, 13(8):1131-1139.
