Practical Dynamic SC-Flip Polar Decoders: Algorithm and Implementation

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 ($\omega =1$). Dynamic SCF (DSCF) algorithm tackles this problem by tackling multiple errors ($\omega \ge 1$), 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 computational complexity. Following, we describe a hardware architecture for the Fast-DSCF decoder, in which we introduce additional simplifications such as metric normalization and sorter length reduction. All the simplifications and approximations are shown to have minimal impact on the error-correction performance, and the reported Fast-DSCF decoder is the only SCF-based architecture that can correct multiple errors. The Fast-DSCF decoders synthesized using TSMC $65$nm CMOS technology can achieve a $1.25$, $1.06$ and $0.93$ Gbps throughput for $\omega \in \{1,2,3\}$, respectively. Compared to the state-of-the-art fast CA-SCL decoders with equivalent FER performance, the proposed decoders are up to $5.8\times$ more area-efficient. Finally, observations at energy dissipation indicate that the Fast-DSCF is more energy-efficient than its CA-SCL-based counterparts.

Accepted for publication in IEEE TSP

References in corpus (10)

• Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels
• Massive Machine-type Communications in 5G: Physical and MAC-layer solutions
• Fast Polar Decoders: Algorithm and Implementation
• Fast and Flexible Successive-Cancellation List Decoders for Polar Codes
• Improved Successive Cancellation Flip Decoding of Polar Codes Based on Error Distribution
• A Low-Latency List Successive-Cancellation Decoding Implementation for Polar Codes
• PolarBear: A 28-nm FD-SOI ASIC for Decoding of Polar Codes
• Fast-SSC-Flip Decoding of Polar Codes
• Partitioned Successive-Cancellation Flip Decoding of Polar Codes
• A High-Throughput Architecture of List Successive Cancellation Polar Codes Decoder with Large List Size

Cited by in corpus (7)

• High-Throughput and Energy-Efficient VLSI Architecture for Ordered Reliability Bits GRAND
• Recent Advances in Deep Learning for Channel Coding: A Survey
• High-Throughput VLSI architecture for Soft-Decision decoding with ORBGRAND
• Fast Successive-Cancellation List Flip Decoding of Polar Codes
• Successive-Cancellation Flip Decoding of Polar Codes with a Simplified Restart Mechanism
• Generalized Restart Mechanism for Successive-Cancellation Flip Decoding of Polar Codes
• Successive-Cancellation Flip and Perturbation Decoder of Polar Codes