Fast-SSC-Flip Decoding Algorithm Based on Critical Flip Set for Polar Code

GUO Rui; SUN He; YANG Pei

doi:10.11999/JEIT221392

Volume 45 Issue 10

Oct. 2023

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2023 > 45(10): 3594-3602

GUO Rui, SUN He, YANG Pei. Fast-SSC-Flip Decoding Algorithm Based on Critical Flip Set for Polar Code[J]. Journal of Electronics & Information Technology, 2023, 45(10): 3594-3602. doi: 10.11999/JEIT221392

Citation:

GUO Rui, SUN He, YANG Pei. Fast-SSC-Flip Decoding Algorithm Based on Critical Flip Set for Polar Code[J]. Journal of Electronics & Information Technology, 2023, 45(10): 3594-3602. doi: 10.11999/JEIT221392

Citation:

PDF( 3210 KB)

Fast-SSC-Flip Decoding Algorithm Based on Critical Flip Set for Polar Code

doi: 10.11999/JEIT221392

School of Communication Engineering, Hangzhou Dianzi University, Hangzhou 310018, China

Received Date: 2022-11-07
Rev Recd Date: 2023-08-14

Available Online: 2023-08-18

Publish Date: 2023-10-31

Abstract

Abstract

In order to reduce the candidate flip bit set size when using Fast Simplified Successive Cancellation Flip(Fast-SSC-Flip) decoding algorithm and decrease the search complexity, a kind of Fast-SSC-Flip decoding algorithm based on critical flip set for polar code is proposed. Based on the fact that the first decoding error information bit in the Fast Simplified Successive Cancellation (Fast-SSC) decoding process is highly likely to fall into the Critical Set (CS), and the candidate bits in the Fast-SSC-Flip decoding algorithm are all codeword bits, the proposed algorithm uses the polar code generator matrix to obtain the corresponding codeword bits of the information bits in the CS, and constructs a Critical Flip Set (CFS) as the candidate flip bit set. Experimental results show that, under the same candidate bit reliability measurement criteria, when the code length N = 1 024 and the code rate R = 0.5, the proposed Fast-SSC-Flip decoding algorithm based on critical flip set reduces significantly the candidate flip bit set size without sacrificing decoding performance compared to the traditional Fast-SSC-Flip algorithm; Compared to the New Fast Simplified Successive Cancellation Flip( N-Fast-SSC-Flip) algorithm, the candidate flip bit set decreased by at least 77.93% while maintaining similar decoding performance.
- Polar codes,
- Fast-SSC decode,
- Bit flip,
- Critical Flip Set(CFS)

FullText(HTML)

References(18)

References

[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]	AFISIADIS O, BALATSOUKAS-STIMMING A, and BURG A. A low-complexity improved successive cancellation decoder for polar codes[C]. The 48th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, USA, 2014: 2116–2120.
[3]	CHANDESRIS L, SAVIN V, and DECLERCQ D. Dynamic-SCFlip decoding of polar codes[J]. IEEE Transactions on Communications, 2018, 66(6): 2333–2345. doi: 10.1109/TCOMM.2018.2793887
[4]	ZHANG Xueting, LIU Yingzhuang, and CHEN Shaoping. BER evaluation based SCFlip algorithm for polar codes decoding[J]. IEEE Access, 2020, 8: 3042–3054. doi: 10.1109/ACCESS.2019.2962003
[5]	QIAO Xinyuan, CUI Hangxuan, LIN Jun, et al. Reducing search complexity of dynamic SC-Flip decoding for polar codes[C]. The 7th International Conference on Computer and Communications (ICCC), Chengdu, China, 2021: 27–31.
[6]	ERCAN F and GROSS W J. Fast thresholded SC-flip decoding of polar codes[C]. 2020 IEEE International Conference on Communications, Dublin, Ireland, 2020: 1–7.
[7]	DAI Bin, GAO Chenyu, YAN Zhiyuan, et al. Parity check aided SC-flip decoding algorithms for polar codes[J]. IEEE Transactions on Vehicular Technology, 2021, 70(10): 10359–10368. doi: 10.1109/TVT.2021.3106349
[8]	ALAMDAR-YAZDI A and KSCHISCHANG F R. A simplified successive-cancellation decoder for polar codes[J]. IEEE Communications Letters, 2011, 15(12): 1378–1380. doi: 10.1109/LCOMM.2011.101811.111480
[9]	SARKIS G, GIARD P, VARDY A, et al. Fast polar decoders: Algorithm and implementation[J]. IEEE Journal on Selected Areas in Communications, 2014, 32(5): 946–957. doi: 10.1109/JSAC.2014.140514
[10]	HANIF M and ARDAKANI M. Fast successive-cancellation decoding of polar codes: Identification and decoding of new nodes[J]. IEEE Communications Letters, 2017, 21(11): 2360–2363. doi: 10.1109/LCOMM.2017.2740305
[11]	GIARD P and BURG A. Fast-SSC-flip decoding of polar codes[C]. IEEE Wireless Communications and Networking Conference Workshops (WCNCW), Barcelona, Spain, 2018: 73–77.
[12]	ZHOU Yangcan, LIN Jun, and WANG Zhongfeng. A new fast-SSC-flip decoding of polar codes[C]. IEEE International Conference on Communications (ICC), Shanghai, China, 2019: 1–6.
[13]	ZHOU Yangcan, LIN Jun, and WANG Zhongfeng. Improved fast-SSC-flip decoding of polar codes[J]. IEEE Communications Letters, 2019, 23(6): 950–953. doi: 10.1109/LCOMM.2019.2910059
[14]	JAN Q, HUSSAIN S, LIU Zechen, et al. Improved partitioned fast-SSC-flip decoding for polar coded[C]. The 7th International Conference on Computer and Communication Systems (ICCCS), Wuhan, China, 2022: 382–386.
[15]	WANG Xiumin, WANG Ting, LI Jun, et al. Improved multiple bit-flipping fast-SSC decoding of polar codes[J]. IEEE Access, 2020, 8: 27851–27860. doi: 10.1109/ACCESS.2020.2964904
[16]	JAN Q, HUSSAIN S, FURQAN M, et al. Parity-check-CRC concatenated polar codes SSCFlip decoder[J]. Electronics, 2022, 11(23): 3839. doi: 10.3390/electronics11233839
[17]	GUO Rui, YANG Pei, YING Na, et al. Multiple node flip fast-SSC decoding algorithm for polar codes based on node reliability[J]. KSII Transactions on Internet and Information Systems, 2022, 16(2): 658–675. doi: 10.3837/TIIS.2022.02.015
[18]	MONDELLI M, HASHEMI S A, CIOFFI J M, et al. Sublinear latency for simplified successive cancellation decoding of polar codes[J]. IEEE Transactions on Wireless Communications, 2021, 20(1): 18–27. doi: 10.1109/TWC.2020.3022922