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 Conference Proceedings

A Transformation for Polar Code BP Decoding

Chen Yi-Ru, Huang–Chang Lee, Lin Mao-Chao

Published Jan 1, 2019• 0 citations
OpenAlex

Related papers

A Transformation for Polar Code BP Decoding

Yi‐Ru Chen, Huang–Chang Lee, Mao‐Chao Lin

A transformation technique has been designed, where the encoding result of the polar code can be transferred to an low-density parity-check (LDPC) code. The belief-propagation decoding can be applied to the received sequence according to the parity-check matrix of the LDPC code. The transferred polar code can provide the same error-rate of the LDPC code, and its performance can be further improved if the success-cancellation decoding is available.

International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)•Dec 1, 2019•0 citations

A Study on Quantization for BP Decoding of Polar Codes

Akira Yamada, Tomoaki Otsuki Ohtsuki

IEICE Technical Report; IEICE Tech. Rep.•Feb 26, 2020•0 citations

A Polar Subcode Approach to Belief Propagation List Decoding

Marvin Geiselhart, Ahmed Elkelesh, Jannis Clausius +1 more

Permutation decoding gained recent interest as it can exploit the symmetries of a code in a parallel fashion. Moreover, it has been shown that by viewing permuted polar codes as polar subcodes, the set of usable permutations in permutation decoding can be increased. We extend this idea to pre-transformed polar codes, such as cyclic redundancy check (CRC)-aided polar codes, which previously could not be decoded using permutations due to their lack of automorphisms. Using belief propagation (BP)-based subdecoders, we showcase a performance close to CRC-aided SCL (CA-SCL) decoding. The proposed algorithm outperforms the previously best performing iterative CRC-aided belief propagation list (CA-BPL) decoder both in error-rate performance and decoding latency.

arXiv:2205.06631•IEEE Information Theory Workshop (ITW)•Nov 1, 2022•8 citations

Multi-stack Decoding of Polar Codes

Dongsheng Wu, Qingshuang Zhang, Yingxian Zhang

Lecture notes in electrical engineering•Jan 1, 2016•0 citations

An improvement of approximate BP decoding

Gou Hosoya, Hiroyuki Yashima

•Dec 8, 2014•0 citations

A Novel Post-Processing Method for Belief Propagation List Decoding of Polar Codes

Baoping Feng, Rongke Liu, Kairui Tian

For polar codes, the statistical breakdown of belief propagation (BP) decoding errors is firstly proposed by Sunet al.The errors are classified into three categories: unconverged errors, false converged errors and oscillation errors, which are corrected by three different post-processing methods. As for the BP List (BPL) decoding, we discover that one type of error can be transformed to another type by different factor graphs in the failed BP decoding. Besides, false converged error is usually easier to be detected and modified. Therefore, we only target false converged error to detect and correct. In this work, we propose a two-level detection rule for false converged errors and its corresponding post-processing algorithm to modify these errors in order to improve the performance of the BPL decoding. Numerical results show that the error-correction performance of the proposed decoder is more than 0.85dB better than that of the permuted BPL (PBPL) decoder with slight extra computation complexity at the frame error rate (FER) of$10^{-5}$for 5G (1024,512) polar code.

IEEE Communications Letters•Jun 4, 2021•8 citations
Permutation decoding gained recent interest as it can exploit the symmetries of a code in a parallel fashion. Moreover, it has been shown that by viewing permuted polar codes as polar subcodes, the set of usable permutations in permutation decoding can be increased. We extend this idea to pre-transformed polar codes, such as cyclic redundancy check (CRC)-aided polar codes, which previously could not be decoded using permutations due to their lack of automorphisms. Using belief propagation (BP)-based subdecoders, we showcase a performance close to CRC-aided SCL (CA-SCL) decoding. The proposed algorithm outperforms the previously best performing iterative CRC-aided belief propagation list (CA-BPL) decoder both in error-rate performance and decoding latency.
For polar codes, the statistical breakdown of belief propagation (BP) decoding errors is firstly proposed by Sunet al.The errors are classified into three categories: unconverged errors, false converged errors and oscillation errors, which are corrected by three different post-processing methods. As for the BP List (BPL) decoding, we discover that one type of error can be transformed to another type by different factor graphs in the failed BP decoding. Besides, false converged error is usually easier to be detected and modified. Therefore, we only target false converged error to detect and correct. In this work, we propose a two-level detection rule for false converged errors and its corresponding post-processing algorithm to modify these errors in order to improve the performance of the BPL decoding. Numerical results show that the error-correction performance of the proposed decoder is more than 0.85dB better than that of the permuted BPL (PBPL) decoder with slight extra computation complexity at the frame error rate (FER) of10−510^{-5}10−5for 5G (1024,512) polar code.