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 Transactions on Communications

Near optimum universal belief propagation based decoding of LDPC codes

J. Chen

Published Jan 1, 2002• 19 citations
OpenAlex

Related papers

Decoding for LDPC codes with enhanced residual belief-propagation

Ming Shu Zhao, Xiaolin Zhang

Beijing Hangkong Hangtian Daxue xuebao•Mar 20, 2014•1 citation

Near optimum universal belief propagation based decoding of LDPC codes and extension to turbo decoding

J. Chen, M.P.C. Fossorier

In this paper, we propose a normalized belief propagation-based algorithm which utilizes normalization to improve the accuracy of the soft values delivered by a previously proposed simplified belief propagation-based algorithm, and can achieve an error performance very close to that of belief propagation. We also extend the principle of normalization to improve the performance of the Max-Log-MAP algorithm in turbo decoding.

IEEE International Symposium on Information Theory (ISIT)•Nov 13, 2002•12 citations

Low Complexity Decoding Scheme for LDPC Codes Based on Belief Propagation Algorithm

Wenshuo Zhang, Liming Zheng, Yue Wu +2 more

Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering•Jan 1, 2019•1 citation

Near optimal reduced-complexity decoding algorithms for LDPC codes

J. Chen, Ajay Dholakia, Evangelos S. Eleftheriou +2 more

In this paper, two families of reduced-complexity algorithms for decoding low-density parity-check (LDPC) codes based on incorporating either a normalization or a correction term in the check-node update are presented. A simplified symbol-node update can also be used. Using simulations, it is shown that these simplified belief propagation (BP) approaches provide near optimum performance with different classes of LDPC codes.

IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2003•21 citations

Greedy Belief Propagation Algorithm for Low-Complexity LDPC Decoding

Yimo Zhen, Jinhui Chen, Zhan Zhang Xu +1 more

Lecture notes in networks and systems•Jan 1, 2025•0 citations

Iterative decoding of one-step majority logic deductible codes based on belief propagation

R. Lucas, M.P.C. Fossorier, Yu Kou +1 more

Previously, the belief propagation (BP) algorithm has received a lot of attention in the coding community, mostly due to its near-optimum decoding for low-density parity check (LDPC) codes and its connection to turbo decoding. In this paper, we investigate the performance achieved by the BP algorithm for decoding one-step majority logic decodable (OSMLD) codes. The BP algorithm is expressed in terms of likelihood ratios rather than probabilities, as conventionally presented. The proposed algorithm fits better the decoding of OSMLD codes with respect to its numerical stability due to the fact that the weights of their check sums are often much higher than that of the corresponding LDPC codes. Although it has been believed that OSMLD codes are far inferior to LDPC codes, we show that for medium code lengths (say between 200-1000 bits), the BP decoding of OSMLD codes can significantly outperform BP decoding of their equivalent LDPC codes. The reasons for this behavior are elaborated.

IEEE Transactions on Communications•Jun 1, 2000•168 citations
Previously, the belief propagation (BP) algorithm has received a lot of attention in the coding community, mostly due to its near-optimum decoding for low-density parity check (LDPC) codes and its connection to turbo decoding. In this paper, we investigate the performance achieved by the BP algorithm for decoding one-step majority logic decodable (OSMLD) codes. The BP algorithm is expressed in terms of likelihood ratios rather than probabilities, as conventionally presented. The proposed algorithm fits better the decoding of OSMLD codes with respect to its numerical stability due to the fact that the weights of their check sums are often much higher than that of the corresponding LDPC codes. Although it has been believed that OSMLD codes are far inferior to LDPC codes, we show that for medium code lengths (say between 200-1000 bits), the BP decoding of OSMLD codes can significantly outperform BP decoding of their equivalent LDPC codes. The reasons for this behavior are elaborated.