Fast and Flexible Successive-Cancellation List Decoders for Polar Codes
Seyyed Ali Hashemi, Carlo Condo, Warren J. Gross

TL;DR
This paper introduces Fast-SSCL and Fast-SSCL-SPC, optimized polar code decoders that improve speed and throughput while maintaining error-correction performance, suitable for high-speed hardware implementations.
Contribution
The paper proves the number of bit estimations needed for certain code patterns, enabling faster decoding with guaranteed performance, and presents hardware architectures achieving high throughput.
Findings
Achieved 1.86 Gb/s throughput in hardware implementation.
Maintained error-correction performance with reduced estimations.
Improved decoding speed over state-of-the-art decoders.
Abstract
Polar codes have gained significant amount of attention during the past few years and have been selected as a coding scheme for the next generation of mobile broadband standard. Among decoding schemes, successive-cancellation list (SCL) decoding provides a reasonable trade-off between the error-correction performance and hardware implementation complexity when used to decode polar codes, at the cost of limited throughput. The simplified SCL (SSCL) and its extension SSCL-SPC increase the speed of decoding by removing redundant calculations when encountering particular information and frozen bit patterns (rate one and single parity check codes), while keeping the error-correction performance unaltered. In this paper, we improve SSCL and SSCL-SPC by proving that the list size imposes a specific number of bit estimations required to decode rate one and single parity check codes. Thus, the…
Click any figure to enlarge with its caption.
Figure 1
Figure 2
Figure 3
Figure 4Peer 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.
