Abstract
In order to reduce the number of redundant candidate codewords generated by the fast successive cancellation list (FSCL) decoding algorithm for polar codes, a simplified FSCL decoding algorithm based on critical sets (CS-FSCL) of polar codes is proposed. The algorithm utilizes the number of information bits belonging to the CS in the special nodes, such as Rate-1 node, repetition (REP) node and single-parity-check (SPC) node, to constrain the number of the path splitting and avoid the generation of unnecessary candidate codewords, and thus the latency and computational complexity are reduced. Besides, the algorithm only flips the bits corresponding to the smaller log-likelihood ratio (LLR) values to generate the sub-maximum likelihood (sub-ML) decoding codewords and ensure the decoding performance. Simulation results show that for polar codes with the code length of 1 024, the code rates of 1/4, 1/2 and 3/4, the proposed CS-FSCL algorithm, compared with the conventional FSCL decoding algorithm, can achieve the same decoding performance, but reduce the latency and computational complexity at different list sizes. Specifically, under the list size of L=8, the code rates of R=1/2 and R=1/4, the latency is reduced by 33% and 13% and the computational complexity is reduced by 55% and 50%, respectively.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
CHEN F T, ZHAO H M, SHI D, et al. Decoding algorithm of polarization code with low time complexity[J]. Journal of Chongqing University of Posts and Telecommunications (natural science edition), 2021, 33(4): 571–576. (in Chinese)
MILOSLAVSKAYA V, VUCETIC B, LI Y H, et al. Recursive design of precoded polar codes for SCL decoding[J]. IEEE transactions on communications, 2021, 69(12): 7945–7959.
LIU W, DUAN H G. Adaptive successive cancellation list bit-flip decoding of polar codes[J]. Journal of Chongqing University of Posts and Telecommunications (natural science edition), 2021, 33(1): 87–93. (in Chinese)
SHEN Y F, BALATSOUKAS-STIMMING A, YOU X H, et al. Dynamic SCL decoder with path-flipping for 5G polar codes[J]. IEEE wireless communications letters, 2022, 11(2): 391–395.
YUAN J G, ZHANG R, ZHANG F G, et al. Novel coding algorithm of the CRC-aided PC-polar codes[J]. Journal of Chongqing University of Posts and Telecommunications (natural science edition), 2022, 34(6): 929–934. (in Chinese)
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.
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.
HANIF M, ARDAKANI M. Fast successive-cancellation decoding of polar codes: identification and decoding of new nodes[J]. IEEE communications letters, 2017, 21(11): 2360–2363.
ARDAKANI M H, HANIF M, ARDAKANI M. Fast successive-cancellation-based decoders of polar codes[J]. IEEE communications letters, 2019, 67(7): 4562–4574.
ZHENG H T, HASHEMI S A, BALATSOUKAS S A, et al. Threshold-based fast successive-cancellation decoding of polar codes[J]. IEEE transactions on communications, 2021, 69(6): 3541–3555.
SHEN Y F, KRISTENSEN A T, BALATSOUKAS S A, et al. Fast sequence repetition node-based successive cancellation list decoding for polar codes[C]//IEEE 9th International Conference on Communications, July 27–29, 2022, Seoul, Korea. New York: IEEE, 2022: 116–122.
GAO C, LIU R, DAI B, et al. Path splitting selecting strategy-aided successive cancellation list algorithm for polar codes[J]. IEEE communications letters, 2019, 23(3): 422–425.
WANG L, ZHANG Z, HU H. Adaptive fast simplified successive cancellation list polar decoding based on path selecting[C]//2020 IEEE/CIC International Conference on Communications in China, August 9–11, 2020, Chongqing, China. New York: IEEE, 2020: 959–963.
PENG Y L, WU H H, CHEN P P, et al. Simplified path split strategy for SCL decoding algorithm with lower latency[C]//2022 Wireless Telecommunications Symposium, April 6–8, 2022, Pomona, CA, USA. New York: IEEE, 2022: 1–6.
ZHAO Y, YIN Z, WU Z, et al. Minimum-combinations set-based rate-1 decoder for fast list decoding of polar codes[J]. IEEE communications letters, 2021, 25(10): 3185–3189.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflicts of interest
The authors declare no conflict of interest.
Additional information
This work has been supported by the National Natural Science Foundation of China (Nos.U21A20447 and No.61971079).
YUAN Jianguo is a professor at School of Optoelectronic Engineering, Chongqing University of Posts and Telecommunications. He received his Ph.D. degree in 2007 from Chongqing University. His research interests are mainly in the coding and decoding technologies for polar codes and LDPC codes as well as OFDM technologies. E-mail: yuanjg@cqupt.edu.cn
Rights and permissions
About this article
Cite this article
Yuan, J., Zhang, F., He, J. et al. CS-FSCL decoding algorithm of polar codes based on critical sets. Optoelectron. Lett. 20, 418–423 (2024). https://doi.org/10.1007/s11801-024-3214-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11801-024-3214-2