An Improved EPC-MS-SCL Decoding Algorithm of Polar Codes Based on the Enhanced Parity Check Code

被引：0
|
作者：
Zhang X.-L. [1 ]
Yuan J.-G. [2 ]
You W. [2 ]
Yu L.-F. [2 ]
Huang S. [1 ]
机构：
[1] School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing
[2] School of Optoelectronic Engineering, Chongqing University of Posts and Telecommunications, Chongqing
来源：
Tien Tzu Hsueh Pao/Acta Electronica Sinica | 2023年 / 51卷 / 09期
基金：
中国国家自然科学基金;
关键词：
enhanced parity check code; polar code; pruning; PSS-SS-SCL decoding; search set;
D O I：
10.12263/DZXB.20211678
中图分类号：
学科分类号：
摘要：
In order to improve the performance of the path splitting selecting strategy based on search set under the successive cancellation list (PSS-SS-SCL) decoding algorithm, an improved decoding algorithm based on the enhanced pari⁃ ty check code and Monte Carlo segment aiding successive cancellation list (EPC-MS-SCL) is proposed. The algorithm di⁃ vides the information sequence into some segments in the encoding stage of the polar code, and adds an enhanced parity check code at the end of each segment. The decoder performs the path splitting only when decoding the elements within the search set (SS), and directly does the hard decision for the other unfrozen bits. The decoder will verify the segment immedi⁃ ately after decoding a sequence, the verified path can only be retained. Thus the competition from the wrong paths to the correct path can be reduced to increase the probability of keeping the correct path until the end of the decoding and the per⁃ formance of the decoding can be improved. Meanwhile, the decoding complexity is also reduced because of decreasing the number of the decoding lists. Simulation results show that compared with the PSS-SS-SCL decoding algorithm, the pro⁃ posed decoding algorithm can improve the coding gain to a certain degree and reduce the decoding complexity too. © 2023 Chinese Institute of Electronics. All rights reserved.
引用
收藏
页码：2391 / 2397
页数：6
相关论文
共 13 条
  • [1] ARIKAN E., Channel polarization: A method for construct⁃ ing capacity-achieving codes for symmetric binary-input memoryless channels, IEEE Transactions on Informa⁃ tion Theory, 55, 7, pp. 3051-3073, (2009)
  • [2] LI X W, LI W B., A simplified successive cancellation list decoding algorithm for polar codes, Journal of Chongq⁃ ing University of Posts and Telecommunications (Natural Science Edition), 31, 4, pp. 488-494, (2019)
  • [3] LIU W, DUAN H G., Adaptive successive cancellation list bit-flip decoding of polar codes, Journal of Chongqing University of Posts and Telecommunications(Natural Sci⁃ ence Edition), 33, 1, pp. 87-93, (2021)
  • [4] TAL I, VARDY A., List decoding of polar codes, IEEE Transactions on Information Theory, 61, 5, pp. 2213-2226, (2015)
  • [5] NIU K, CHEN K., CRC-aided decoding of polar codes, IEEE Communications Letters, 16, 10, pp. 1668-1671, (2012)
  • [6] ZHOU H Y, ZHANG C, SONG W Q, Et al., Segmented CRC-aided SC list polar decoding, 2016 83rd Vehicu⁃ lar Technology Conference, pp. 1-5, (2016)
  • [7] ZHOU H Y, LIANG X, LI L P, Et al., Segmented successive cancellation list polar decoding with tailored CRC[J], Jour⁃ nal of Signal Processing Systems, 91, 8, pp. 923-935, (2019)
  • [8] YU Y R., Investigations on the Construction and Decoding of Polar Codes, (2019)
  • [9] GAO C, LIU R K, DAI B, Et al., Path splitting selecting strategy-aided successive cancellation list algorithm for po⁃ lar codes, IEEE Communications Letters, 23, 3, pp. 422-425, (2019)
  • [10] BALATSOUKAS-STIMMING A, PARIZI M B, BURG A., LLR-based successive cancellation list decoding of po⁃ lar codes, IEEE Transactions on Signal Processing, 63, 19, pp. 5165-5179, (2015)
12