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

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

Error Performance of Codes to which Belief Propagation Decoding Algorithm is Applicable.

Akira Shiozaki, Hideki Fukuhara

Published May 1, 2002• 0 citations
OpenAlex

Related papers

Iterative decoding beyond belief propagation

Shiva Kumar Planjery, Shashi Kiran Chilappagari, Bane V. Vasic +2 more

At the heart of modern coding theory lies the fact that low-density parity-check (LDPC) codes can be efficiently decoded by belief propagation (BP). The BP is an inference algorithm which operates on a graphical model of a code, and lends itself to low-complexity and high-speed implementations, making it the algorithm of choice in many applications. It has unprecedentedly good error rate performance, so good that when decoded by the BP, LDPC codes approach theoretical limits of channel capacity. However, this capacity approaching property holds only in the asymptotic limit of code length, while codes of practical lengths suffer abrupt performance degradation in the low noise regime known as the error floor phenomenon. Our study of error floor has led to an interesting and surprising finding that it is possible to design iterative decoders which are much simpler yet better than belief propagation! These decoders do not propagate beliefs but a rather different kind of messages that reflect the local structure of the code graph. This has opened a plethora of exciting theoretical problems and applications. This paper introduces this new paradigm.

Information Theory and Applications Workshop (ITA)•Jan 1, 2010•17 citations

Performance study of non-binary belief propagation for decoding Reed-Solomon codes

Bimberg, Lentmaier, Fettweis

•Jan 1, 2010•0 citations

Improved Belief Propagation Decoding Algorithm for Short Polar Codes

Shajeel Iqbal, Adnan Ahmed Hashmi, GoangSeog Choi

Wireless Personal Communications•Apr 22, 2017•3 citations

Serially concatenated scheme of polar codes and the improved belief propagation decoding algorithm

Yinyou Mao, Dong Yang, Xingcheng Liu +1 more

In this study, a serially concatenated scheme of polar codes with convolutional codes is proposed to improve the error correction performance. The novel belief propagation (BP) decoding algorithm addresses two issues that are present in the currently available BP decoding algorithms. The first issue is the poor performance of the BP decoding algorithms, in particular the introduction of an error floor. The second is the component codes can only use systematic codes in the traditional concatenated scheme of polar codes with convolutional codes, which inhibits the effective update of the prior information of the redundant check bits. The proposed BP decoding algorithm is based on right‐directed message processing, which effectively improves the decoding performance. In addition, the proposed concatenated scheme extends the selection of component codes from the systematic polar codes to the non‐systematic polar codes. Hence, the areas of applications and the prior information of information bits for polar codes are expanded and more effectively updated, respectively. The simulation results show that the proposed scheme is much better than the traditional concatenated scheme, and the error floor is no longer introduced in terms of the block error rate, while the storage and computational complexities have not increased obviously.

IET Communications•May 21, 2020•3 citations

Near optimum universal belief propagation based decoding of LDPC codes

J. Chen

IEEE Transactions on Communications•Jan 1, 2002•20 citations

A Feedback Belief Propagation Algorithm for LDPC Convolutional Codes

Yuanhua Liu, Xinmei Wang, Yucheng He

A feedback belief propagation (BP) decoding algorithm for low-density parity-check convolutional codes is proposed. The proposed algorithm can activate the variable nodes more efficiently by applying feedback decoding at each decoding iteration. Compared with the on-demand BP algorithm, the proposed algorithm has a doubled convergence speed and causes only about half of the decoding delay at similar error performances without any increase of storage requirement. Simulation results show that the proposed algorithm can offer a good trade-off between the error-correcting performance and the decoding complexity.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2008•2 citations
At the heart of modern coding theory lies the fact that low-density parity-check (LDPC) codes can be efficiently decoded by belief propagation (BP). The BP is an inference algorithm which operates on a graphical model of a code, and lends itself to low-complexity and high-speed implementations, making it the algorithm of choice in many applications. It has unprecedentedly good error rate performance, so good that when decoded by the BP, LDPC codes approach theoretical limits of channel capacity. However, this capacity approaching property holds only in the asymptotic limit of code length, while codes of practical lengths suffer abrupt performance degradation in the low noise regime known as the error floor phenomenon. Our study of error floor has led to an interesting and surprising finding that it is possible to design iterative decoders which are much simpler yet better than belief propagation! These decoders do not propagate beliefs but a rather different kind of messages that reflect the local structure of the code graph. This has opened a plethora of exciting theoretical problems and applications. This paper introduces this new paradigm.
In this study, a serially concatenated scheme of polar codes with convolutional codes is proposed to improve the error correction performance. The novel belief propagation (BP) decoding algorithm addresses two issues that are present in the currently available BP decoding algorithms. The first issue is the poor performance of the BP decoding algorithms, in particular the introduction of an error floor. The second is the component codes can only use systematic codes in the traditional concatenated scheme of polar codes with convolutional codes, which inhibits the effective update of the prior information of the redundant check bits. The proposed BP decoding algorithm is based on right‐directed message processing, which effectively improves the decoding performance. In addition, the proposed concatenated scheme extends the selection of component codes from the systematic polar codes to the non‐systematic polar codes. Hence, the areas of applications and the prior information of information bits for polar codes are expanded and more effectively updated, respectively. The simulation results show that the proposed scheme is much better than the traditional concatenated scheme, and the error floor is no longer introduced in terms of the block error rate, while the storage and computational complexities have not increased obviously.
A feedback belief propagation (BP) decoding algorithm for low-density parity-check convolutional codes is proposed. The proposed algorithm can activate the variable nodes more efficiently by applying feedback decoding at each decoding iteration. Compared with the on-demand BP algorithm, the proposed algorithm has a doubled convergence speed and causes only about half of the decoding delay at similar error performances without any increase of storage requirement. Simulation results show that the proposed algorithm can offer a good trade-off between the error-correcting performance and the decoding complexity.