2025/04/16 by Charles Pillet, Ilshat Sagitov, Pillet, Charles +5
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #PAPR reduction in OFDM
paper · pdf · doi:10.48550/arxiv.2504.12102
openalex publication_date 2025/04/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 Tmax. For N=1024 and the coding rate R=(1)/(2), the DSCFP and the SCP algorithms with Tmax=17 are bested by approximately 0.1 dB at block error rate (BLER) of 0.001. At BLER=10-6 and for Tmax=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.