Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Globecom Workshops (GC Wkshps)

Stochastic Flipping Decoding for Short Polar Codes

Yuzhou Shang, Zhaoyang Zhang

Published Dec 1, 2021• 2 citations
Publisher

Abstract

Polar codes are considered a promising candidate for URLLC. Due to the inevitable decoding delay and error propagation brought by successive cancellation (SC) based decoders, the ordered statistic decoding (OSD) algorithm, which has a parallel structure, raises much attention in polar decoding, especially for the short codelength cases. However, the OSD algorithm contains many unnecessary attempts for different error patterns (EPs), increasing the complexity and decoding delay. To address this issue, we propose a novel stochastic flipping decoding (SFD) algorithm. Instead of processing all EPs in the search space, each time, the proposed SFD decoder only processes a small set of EPs generated by stochastic flipping and then chooses the one that has the best distance to get the new reference codeword. The flipping probability vector depends on how the flip of each bit potentially affects the overall distance, and it is updated progressively towards all-zero. The complexity of the algorithm can be further reduced by eliminating all the duplicated EPs. Numerical results show that improved SFD with adequately selected parameters outperforms OSD while the search space of these two algorithms is close.

DOI
10.1109/gcwkshps52748.2021.9681994

Related papers

A Low-Complexity Ordered Statistics Decoding Algorithm for Short Polar Codes

Yusheng Xing, Guofang Tu

In this paper, we propose a low-complexity ordered statistics decoding (OSD) algorithm called threshold-based OSD (TH-OSD) that uses a threshold on the discrepancy of the candidate codewords to speed up the decoding of short polar codes. To determine the threshold, we use the probability distribution of the discrepancy value of the maximal likelihood codeword with a predefined parameter controlling the trade-off between the error correction performance and the decoding complexity. We also derive an upper-bound of the word error rate (WER) for the proposed algorithm. The complexity analysis shows that our algorithm is faster than the conventional successive cancellation (SC) decoding algorithm in mid-to-high signal-to-noise ratio (SNR) situations and much faster than the SC list (SCL) decoding algorithm. Our addition of a list approach to our proposed algorithm further narrows the error correction performance gap between our TH-OSD and OSD. Our simulation results show that, with appropriate thresholds, our proposed algorithm achieves performance close to OSD’s while testing significantly fewer codewords than OSD, especially with low SNR values. Even a small list is sufficient for TH-OSD to match OSD’s error rate in short-code scenarios. The algorithm can be easily extended to longer code lengths.

Applied Sciences•Feb 26, 2019•2 citations

A Hybrid OSD-SC Decoding Algorithm for Polar Codes

Yusheng Xing, Guofang Tu

In this paper, we propose a low complexity hybrid ordered statistics decoding (OSD) successive cancellation (SC) decoding algorithm for the polar codes. By replacing smaller size SC decoder with OSD decoder, we can improve the error correcting performance of the SC algorithm. The size of the OSD decoder can be changed to control the trade-off between the decoding complexity and the error correcting performance of the proposed algorithm. We also provide a method to further simplify the proposed algorithm. Simulation results show that the proposed algorithm offers about 0.3 dB gain comparing to the SC at target bit error rate (BER) 10-5with code length N = 1024, 512,256 and code rate R = 1 /3. The impact of the OSD size is also simulated and analyzed.

IEEE Information Technology, Networking, Electronic and Automation Control Conference (ITNEC)•Mar 1, 2019•4 citations

An Improved Bit-Flipping Algorithm of Successive Cancellation List Decoding for Polar Codes

Desheng Wang, Jihang Yin, Yonggang Xu +3 more

Polar codes, as the coding scheme for the control channel in fifth-generation mobile communication technology (5G), have attracted widespread attention since their proposal. As a mainstream decoding algorithm for polar codes, the successive cancellation list (SCL) decoder usually improves the error correction performance by increasing the list size, but this method suffers from the problems of high decoding complexity. To address this problem, this paper proposes a layered-search bit-flipping (LS-SCLF) decoding algorithm based on SCL decoding. Firstly, a new flip-bit metric is proposed, which derives a formula to approximate the probability of an error occurring in an information bit. This formula introduces a perturbation parameter to improve the calculation accuracy. Secondly, a compromise scheme for determining the perturbation parameter is proposed. The scheme uses Monte Carlo simulation to determine an optimized parameter for the precise positioning of the first erroneous decoded bit under different decoding conditions. Finally, a layered search strategy is adopted to sequentially search the erroneous decoded bits from the low order to high order, which can correct up to multiple bits at the same time. Simulation results show that the proposed algorithm achieves improved error correction performance with a slight increase in decoding complexity compared to the generalized SCL-Flip (GSCLF) decoding algorithm. This algorithm also achieves a good balance between the error correction performance and decoding complexity.

Mathematics•Oct 27, 2023•2 citations

Guessing Error Pattern Ordered Statistic Decoding for Short Polar Codes

Yuxin Han, Kai Niu, Xuanyu Li

Polar codes have been used to guarantee high reliability in communication due to their excellent performance. In this letter, we propose a guessing error pattern ordered statistic decoding (GEPOSD) algorithm to further improve the performance of short polar codes. It outperforms the widely used cyclic redundancy check-aided successive cancellation list (CA-SCL) decoding under a code length of 64. The GEPOSD algorithm utilizes a strategy based on the maximum a posteriori probability rule to select the error pattern on the most reliable independent bits. Subsequently, an error pattern set is extended using a tree search approach. To minimize computational complexity, we introduce two early stopping criteria that limit the number of error patterns tested in decoding. The simulation results show that the complexity of GEPOSD is significantly reduced compared to the original OSD algorithm.

IEEE Communications Letters•Sep 28, 2023•4 citations

Ordered Statistic Decoding for Short Polar Codes

Daolong Wu, Ying Li, Xudong Guo +1 more

In this letter, the ordered statistic decoding (OSD) is considered to decode short polar codes. Since the number of tested codewords is high in the original OSD, a threshold-based OSD is proposed to reduce the complexity. The analysis shows that the threshold affects the OSD in two ways. One is the error floor in high signal-to-noise ratio (SNR) region while the other is the reduction of the number of tested codewords. The estimation on the BLER performance in high SNR region and the average number of tested codewords are discussed. After that, CRC-aided OSD is proposed to further improve the performance of polar codes. Simulation results show that a well-designed threshold-based OSD can reduce the complexity without significant performance loss. And a higher order OSD decoder is needed if OSD is used to decoding moderate or long polar codes. It is also illustrated that the CRC-aided OSD outperforms the CRC-aided list decoding when the code rate is high. When code rate is low, the result inverses.

IEEE Communications Letters•Mar 7, 2016•50 citations

An Improved Belief Propagation Bit-Flipping Decoder for Polar Codes

Mengqing Zhao, Daqin Peng

Bit flipping was first used to improve the decoding performance of successive cancellation (SC) decoder. Since SC decoding process is serial, so the first bit that goes wrong in the decoding process will cause several subsequent bits to go wrong, which will suffer from higher decoding delay than belief propagation (BP) parallel decoding. In order to meet the performance of 5G low latency and high reliability, BP decoding algorithm have received a lot of attention. However, at medium and high signal-to-noise ratios (SNR), BP decoding does not perform as well as the SC list (SCL) decoding algorithm. Hence, BP decoding algorithm borrows bit-flip strategies from SC bit flip (SCF) decoder to improve the performance. The performance of BP bit flip (BPF) decoding depends on whether the construction of the flip set is correct, so this letter proposes a flip set construction approach based on the standard deviation of the log-likelihood ratio (LLR) and the reliability weight of polarized channels, which is comparable to the existing BPF decoding, the improved algorithm can identify the error-prone bits more efficiently and improve the decoding performance.

International Conference on Intelligent Computing and Signal Processing (ICSP)•Apr 21, 2023•2 citations
Polar codes are considered a promising candidate for URLLC. Due to the inevitable decoding delay and error propagation brought by successive cancellation (SC) based decoders, the ordered statistic decoding (OSD) algorithm, which has a parallel structure, raises much attention in polar decoding, especially for the short codelength cases. However, the OSD algorithm contains many unnecessary attempts for different error patterns (EPs), increasing the complexity and decoding delay. To address this issue, we propose a novel stochastic flipping decoding (SFD) algorithm. Instead of processing all EPs in the search space, each time, the proposed SFD decoder only processes a small set of EPs generated by stochastic flipping and then chooses the one that has the best distance to get the new reference codeword. The flipping probability vector depends on how the flip of each bit potentially affects the overall distance, and it is updated progressively towards all-zero. The complexity of the algorithm can be further reduced by eliminating all the duplicated EPs. Numerical results show that improved SFD with adequately selected parameters outperforms OSD while the search space of these two algorithms is close.
In this paper, we propose a low-complexity ordered statistics decoding (OSD) algorithm called threshold-based OSD (TH-OSD) that uses a threshold on the discrepancy of the candidate codewords to speed up the decoding of short polar codes. To determine the threshold, we use the probability distribution of the discrepancy value of the maximal likelihood codeword with a predefined parameter controlling the trade-off between the error correction performance and the decoding complexity. We also derive an upper-bound of the word error rate (WER) for the proposed algorithm. The complexity analysis shows that our algorithm is faster than the conventional successive cancellation (SC) decoding algorithm in mid-to-high signal-to-noise ratio (SNR) situations and much faster than the SC list (SCL) decoding algorithm. Our addition of a list approach to our proposed algorithm further narrows the error correction performance gap between our TH-OSD and OSD. Our simulation results show that, with appropriate thresholds, our proposed algorithm achieves performance close to OSD’s while testing significantly fewer codewords than OSD, especially with low SNR values. Even a small list is sufficient for TH-OSD to match OSD’s error rate in short-code scenarios. The algorithm can be easily extended to longer code lengths.
In this paper, we propose a low complexity hybrid ordered statistics decoding (OSD) successive cancellation (SC) decoding algorithm for the polar codes. By replacing smaller size SC decoder with OSD decoder, we can improve the error correcting performance of the SC algorithm. The size of the OSD decoder can be changed to control the trade-off between the decoding complexity and the error correcting performance of the proposed algorithm. We also provide a method to further simplify the proposed algorithm. Simulation results show that the proposed algorithm offers about 0.3 dB gain comparing to the SC at target bit error rate (BER) 10-5with code length N = 1024, 512,256 and code rate R = 1 /3. The impact of the OSD size is also simulated and analyzed.
Polar codes, as the coding scheme for the control channel in fifth-generation mobile communication technology (5G), have attracted widespread attention since their proposal. As a mainstream decoding algorithm for polar codes, the successive cancellation list (SCL) decoder usually improves the error correction performance by increasing the list size, but this method suffers from the problems of high decoding complexity. To address this problem, this paper proposes a layered-search bit-flipping (LS-SCLF) decoding algorithm based on SCL decoding. Firstly, a new flip-bit metric is proposed, which derives a formula to approximate the probability of an error occurring in an information bit. This formula introduces a perturbation parameter to improve the calculation accuracy. Secondly, a compromise scheme for determining the perturbation parameter is proposed. The scheme uses Monte Carlo simulation to determine an optimized parameter for the precise positioning of the first erroneous decoded bit under different decoding conditions. Finally, a layered search strategy is adopted to sequentially search the erroneous decoded bits from the low order to high order, which can correct up to multiple bits at the same time. Simulation results show that the proposed algorithm achieves improved error correction performance with a slight increase in decoding complexity compared to the generalized SCL-Flip (GSCLF) decoding algorithm. This algorithm also achieves a good balance between the error correction performance and decoding complexity.
Polar codes have been used to guarantee high reliability in communication due to their excellent performance. In this letter, we propose a guessing error pattern ordered statistic decoding (GEPOSD) algorithm to further improve the performance of short polar codes. It outperforms the widely used cyclic redundancy check-aided successive cancellation list (CA-SCL) decoding under a code length of 64. The GEPOSD algorithm utilizes a strategy based on the maximum a posteriori probability rule to select the error pattern on the most reliable independent bits. Subsequently, an error pattern set is extended using a tree search approach. To minimize computational complexity, we introduce two early stopping criteria that limit the number of error patterns tested in decoding. The simulation results show that the complexity of GEPOSD is significantly reduced compared to the original OSD algorithm.
In this letter, the ordered statistic decoding (OSD) is considered to decode short polar codes. Since the number of tested codewords is high in the original OSD, a threshold-based OSD is proposed to reduce the complexity. The analysis shows that the threshold affects the OSD in two ways. One is the error floor in high signal-to-noise ratio (SNR) region while the other is the reduction of the number of tested codewords. The estimation on the BLER performance in high SNR region and the average number of tested codewords are discussed. After that, CRC-aided OSD is proposed to further improve the performance of polar codes. Simulation results show that a well-designed threshold-based OSD can reduce the complexity without significant performance loss. And a higher order OSD decoder is needed if OSD is used to decoding moderate or long polar codes. It is also illustrated that the CRC-aided OSD outperforms the CRC-aided list decoding when the code rate is high. When code rate is low, the result inverses.
Bit flipping was first used to improve the decoding performance of successive cancellation (SC) decoder. Since SC decoding process is serial, so the first bit that goes wrong in the decoding process will cause several subsequent bits to go wrong, which will suffer from higher decoding delay than belief propagation (BP) parallel decoding. In order to meet the performance of 5G low latency and high reliability, BP decoding algorithm have received a lot of attention. However, at medium and high signal-to-noise ratios (SNR), BP decoding does not perform as well as the SC list (SCL) decoding algorithm. Hence, BP decoding algorithm borrows bit-flip strategies from SC bit flip (SCF) decoder to improve the performance. The performance of BP bit flip (BPF) decoding depends on whether the construction of the flip set is correct, so this letter proposes a flip set construction approach based on the standard deviation of the log-likelihood ratio (LLR) and the reliability weight of polarized channels, which is comparable to the existing BPF decoding, the improved algorithm can identify the error-prone bits more efficiently and improve the decoding performance.