Related Experiment Video
Updated: Aug 30, 2025

A Photonic System for Generating Unconditional Polarization-Entangled Photons Based on Multiple Quantum Interference
Published on: September 5, 2019
An Enhanced Belief Propagation Flipping Decoder for Polar Codes with Stepping Strategy
Xiaojun Zhang1,2, Yimeng Liu1, Chengguan Chen1
1College of Electronic and Information Engineering, Shandong University of Science and Technology, Qingdao 266590, China.
This study introduces a new algorithm to improve decoding efficiency for Belief Propagation (BP) algorithms. The enhanced BP-Step-Flipping (EBPSF) algorithm reduces decoding iterations while maintaining error rate performance.
Area of Science:
- Coding Theory
- Digital Communications
- Signal Processing
Background:
- The Belief Propagation (BP) algorithm offers high-speed decoding and low latency in digital communication systems.
- The BP flipping algorithm enhances block error rate (BLER) performance but can involve numerous unproductive bit-flipping attempts.
- Reducing decoding iterations is crucial for practical applications without compromising error correction capabilities.
Purpose of the Study:
- To develop a more efficient decoding algorithm that reduces the number of iterations required by BP-based methods.
- To maintain or improve the block error rate (BLER) performance compared to existing BP flipping algorithms.
- To introduce a metric for evaluating bit-flipping likelihood and an enhanced algorithm for lower BLER.
Main Methods:
- A novel metric is proposed to assess the probability of bits correcting BP flipping decoding errors.
- The BP-Step-Flipping (BPSF) algorithm is introduced, focusing on flipping only unreliable bits within the flip set (FS).
- An enhanced BPSF (EBPSF) algorithm incorporates a threshold (β) for small log-likelihood ratio (LLR) magnitudes to further reduce BLER.
Main Results:
- The proposed BPSF and EBPSF algorithms significantly reduce the average number of decoding iterations for a given flip set (FS).
- Numerical results demonstrate an average iteration reduction of 77.5% for EBPSF-1 (N=256) compared to the BP bit-flip-1 (BPF-1) algorithm at Eb/N0 = 1.5 dB.
- The EBPSF algorithm effectively lowers the BLER while maintaining decoding efficiency.
Conclusions:
- The BP-Step-Flipping (BPSF) and enhanced BP-Step-Flipping (EBPSF) algorithms offer substantial improvements in decoding efficiency for BP-based systems.
- These algorithms achieve reduced iteration counts without sacrificing block error rate (BLER) performance.
- The proposed methods provide a practical advancement for high-speed, low-latency decoding applications.
Related Concept Videos
Group Polarization
Even and Odd Signals
¹³C NMR: Distortionless Enhancement by Polarization Transfer (DEPT)
Reconstruction of Signal using Interpolation
Block Diagram Reduction
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
Cable: Problem Solving

