Fast Thresholded SC-Flip Decoding of Polar Codes
Furkan Ercan, Warren J. Gross

TL;DR
This paper introduces a practical, fast thresholded SC-Flip decoding algorithm for polar codes that improves error correction, reduces complexity, and is efficiently implementable in hardware.
Contribution
It proposes an approximated threshold and an alternative critical set formation for TSCF decoding, enabling practical, hardware-efficient implementation without performance loss.
Findings
Achieves 0.24 to 0.41 dB performance gain over existing fast SCF decoders.
Requires 87% fewer decoding steps than traditional TSCF decoding.
Demonstrates 20% and 82% area efficiency improvements in CMOS implementation.
Abstract
SC-Flip (SCF) decoding algorithm shares the attention with the common polar code decoding approaches due to its low-complexity and improved error-correction performance. However, the inefficient criterion for locating the correct bit-flipping position in SCF decoding limits its improvements. Due to its improved bit-flipping criterion, Thresholded SCF (TSCF) decoding algorithm exhibits a superior error-correction performance and lower computational complexity than SCF decoding. However, the parameters of TSCF decoding depend on multiple channel and code parameters, and are obtained via Monte-Carlo simulations. Our main goal is to realize TSCF decoding as a practical polar decoder implementation. To this end, we first realize an approximated threshold value that is independent of the code parameters and precomputations. The proposed approximation has negligible error-correction…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Advanced Wireless Communication Techniques · Coding theory and cryptography
