Practical Dynamic SC-Flip Polar Decoders: Algorithm and Implementation
Furkan Ercan, Thibaud Tonnellier, Nghia Doan, Warren J. Gross

TL;DR
This paper introduces a practical, simplified Fast-DSCF decoding algorithm for polar codes that corrects multiple errors efficiently, with a hardware implementation demonstrating high throughput, area efficiency, and energy savings.
Contribution
It proposes a simplified, hardware-friendly Fast-DSCF decoding algorithm capable of correcting multiple errors with minimal performance loss, outperforming existing decoders in efficiency.
Findings
Achieves up to 1.25 Gbps throughput with TSMC 65nm CMOS.
Up to 5.8 times more area-efficient than comparable CA-SCL decoders.
More energy-efficient than state-of-the-art CA-SCL decoders.
Abstract
SC-Flip (SCF) is a low-complexity polar code decoding algorithm with improved performance, and is an alternative to high-complexity (CRC)-aided SC-List (CA-SCL) decoding. However, the performance improvement of SCF is limited since it can correct up to only one channel error (). Dynamic SCF (DSCF) algorithm tackles this problem by tackling multiple errors (), but it requires logarithmic and exponential computations, which make it infeasible for practical applications. In this work, we propose simplifications and approximations to make DSCF practically feasible. First, we reduce the transcendental computations of DSCF decoding to a constant approximation. Then, we show how to incorporate special node decoding techniques into DSCF algorithm, creating the Fast-DSCF decoding. Next, we reduce the search span within the special nodes to further reduce the…
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.
