Successive-Cancellation Flip and Perturbation Decoder of Polar Codes

Abstract

In this paper, two decoding algorithms based on Successive Cancellation (SC) are proposed to improve the error-correction performance of cyclic redundancy check (CRC)-aided polar codes while aiming for a low-complexity implementation. Comparisons with Dynamic SC Flip (DSCF) and SC Perturbation (SCP) are carried out since the proposed DSCF and Perturbation (DSCFP) and Perturbed DSCF (PDSCF) algorithms combine both methods. The analysis includes comparisons with several code lengths $N$ and various number of decoding attempts $T_{max}$. For $N=1024$ and the coding rate $R=\frac{1}{2}$, the DSCFP and the SCP algorithms with $T_{max}=17$ are bested by approximately $0.1$\,dB at block error rate (BLER) of $0.001$. At $\text{BLER}=10^{-6}$ and for $T_{max}=64$, the gain is of $0.375$ dB and $>0.5$ dB with respect to DSCF and SCP, respectively. At high signal-to-noise ratio, the average computational complexity of the proposed algorithms is virtually equivalent to that of SC.

6 pages, 9 figures, 1 table. Presented in IEEE WCNC 2025, Milan, Italy

References in corpus (5)

• Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels
• Fast and Flexible Successive-Cancellation List Decoders for Polar Codes
• PolarBear: A 28-nm FD-SOI ASIC for Decoding of Polar Codes
• Fast-SSC-Flip Decoding of Polar Codes
• Practical Dynamic SC-Flip Polar Decoders: Algorithm and Implementation