Generalized Restart Mechanism for Successive-Cancellation Flip Decoding of Polar Codes

2025-04-15

Journal of Signal Processing Systems

AI Summary

To address the uncontrollable average execution time and latency in polar code SCF/DSCF decoding caused by redundant computations, this paper proposes the Generalized Restart Mechanism (GRM). GRM enables dynamic computational path reuse for multi-bit flipping in DSCF decoding by leveraging intermediate states from prior decoding attempts to skip redundant operations—thereby significantly reducing latency without compromising error-correction performance. The mechanism is fully compatible with state-of-the-art low-latency techniques such as Fast-DSCF, incurring only ~4% additional memory overhead. Experimental results demonstrate that GRM reduces the average execution time of DSCF-3 by 25%–60%; when jointly optimized with Fast-DSCF-3, further latency reductions of 15%–22% are achieved, while bit-error-rate performance remains strictly unchanged.

Technology Category

• Search and Optimization: Mixed Discrete/Continuous Search
• Constraint Satisfaction and Optimization: Distributed CSP/Optimization
• Reasoning under Uncertainty: Stochastic Optimization

Application Category

• Security and Privacy: Large-scale security measurements
• Search and Retrieval-Augmented AI: Vertical and domain-specific search
• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems

Abstract

Polar codes are a class of linear error-correction codes that have received a lot of attention due to their ability to achieve channel capacity in an arbitrary binary discrete memoryless channel (B-DMC) with low-complexity successive-cancellation (SC) decoding. However, practical implementations often require better error-correction performance than what SC decoding provides, particularly at short to moderate code lengths. Successive-cancellation flip (SCF) decoding algorithm was proposed to improve error-correction performance with an aim to detect and correct the first wrongly estimated bit in a codeword before resuming SC decoding. At each additional SC decoding trial, i.e., decoding attempt beyond the initial unsuccessful trial, one bit estimated as the least reliable is flipped. Dynamic SCF (DSCF) is a variation of SCF, where multiple bits may be flipped simultaneously per trial. Despite the improved error-correction performance compared to the SC decoder, SCF-based decoders have variable execution time, which leads to high average execution time and latency. In this work, we propose the generalized restart mechanism (GRM) that allows to skip decoding computations that are identical between the initial trial and any additional trial. Under DSCF decoding with up to 3-bit flips per decoding trial, our proposed GRM is shown to reduce the average execution time by 25% to 60% without any negative effect on error-correction performance. The proposed mechanism is adaptable to state-of-the-art latency-reduction techniques. When applied to Fast-DSCF-3 decoding, the additional reduction brought by the GRM is 15% to 22%. For the DSCF-3 decoder, the proposed mechanism requires approximately 4% additional memory.

Problem

• Improve error-correction performance in polar codes
• Reduce execution time and latency in SCF-based decoders
• Skip redundant computations between initial and additional trials

Innovation

• Generalized restart mechanism skips redundant computations
• Reduces execution time by 25% to 60%
• Adaptable to latency-reduction techniques