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

電子情報通信学会技術研究報告. MR, 磁気記録

A Study on Suppression of Error Propagation in LDPC Coding and Iterative Decoding System

Y. Nakamura, 道太 柳田, Hisashi Osawa, Yoshihiro Okamoto, Hiroaki MURAOKA

Published Jun 14, 2013• 0 citations
OpenAlex

Related papers

Iterative decoding of LDPC codes: some bounds and properties

David Burshtein, Gadi Miller

Physica A Statistical Mechanics and its Applications•Dec 1, 2001•0 citations

Non iterative LDPC decoding by syndrome generation using Artificial Neural Network

Dinesh Kumar, Alkesh Agrawal, Gopal Singh Phartiyal

Low density parity-check code (LDPC) is an error correcting code used in noisy communication channel (e.g. AWGN) to reduce the probability of error in information. By using LDPC codes, this probability can be made comparatively small, so that the data transmission rate can be as close to Shannon's limit. The decoding of Low Density Parity Check (LDPC) codes by iterative process of belief propagation gives challenges for designers looking for real time performance in communication systems. This thesis work proposes the use of Artificial Neural Networks (ANN) to replace belief propagation to approach closer to Shannon's limit more closer than other traditional decoding methods. This thesis is intended to design a new methodology to decode LDPC codes in Non-iterative manner with the help of ANN and Look Up Table (LUT). This work is at initial stage and will be extended for better performance.

National Conference on Recent Advances in Electronics & Computer Engineering (RAECE)•Feb 1, 2015•1 citation

Iterative reliability-based decoding of low-density parity check codes

M.P.C. Fossorier

In this paper, reliability based decoding is combined with belief propagation (BP) decoding for low-density parity check (LDPC) codes. At each iteration, the soft output values delivered by the BP algorithm are used as reliability values to perform reduced complexity soft decision decoding of the code considered. This approach allows to bridge the error performance gap between belief propagation decoding which remains suboptimum, and maximum likelihood decoding which is too complex to be implemented for the codes considered. Trade-offs between decoding complexity and error performance are also investigated. In particular, a stopping criterion which reduces the average number of iterations at the expense of very little performance degradation is proposed for this combined decoding approach. Simulation results for several Gallager (1963, 1968) LDPC codes and different set cyclic codes of hundreds of information bits are given and elaborated.

IEEE Journal on Selected Areas in Communications•May 1, 2001•169 citations

On the block error probability of iteratively decoded LDPC codes

Michael Lentmaier, Dmitri V. Truhachev, Daniel J. Costello +1 more

•Jan 1, 2004•5 citations

On the upper bound on undetected error probability for LDPC code

Pavel S. Rybin, Victor Zyablov

This paper deals with the method of undetected error probability estimation for a low-density parity-check (LDPC) code under any given iterative decoding algorithm. We propose such modification of a given iterative decoding algorithm, that almost preserves a decoding failure exponent and decoding complexity of this algorithm. We obtain the upper bound on the undetected error probability for the modified algorithm. We show how to use the proposed method to estimate the undetected error probability of LDPC code under the belief propagation (BP) algorithm at the end of this paper.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2014•1 citation

Iterative Decoding with Bias Terms for LDPC Codes

Hiroshi Kamabe, Shusaku Kobota

IEICE Technical Report; IEICE Tech. Rep.•Dec 31, 2009•0 citations
Low density parity-check code (LDPC) is an error correcting code used in noisy communication channel (e.g. AWGN) to reduce the probability of error in information. By using LDPC codes, this probability can be made comparatively small, so that the data transmission rate can be as close to Shannon's limit. The decoding of Low Density Parity Check (LDPC) codes by iterative process of belief propagation gives challenges for designers looking for real time performance in communication systems. This thesis work proposes the use of Artificial Neural Networks (ANN) to replace belief propagation to approach closer to Shannon's limit more closer than other traditional decoding methods. This thesis is intended to design a new methodology to decode LDPC codes in Non-iterative manner with the help of ANN and Look Up Table (LUT). This work is at initial stage and will be extended for better performance.
In this paper, reliability based decoding is combined with belief propagation (BP) decoding for low-density parity check (LDPC) codes. At each iteration, the soft output values delivered by the BP algorithm are used as reliability values to perform reduced complexity soft decision decoding of the code considered. This approach allows to bridge the error performance gap between belief propagation decoding which remains suboptimum, and maximum likelihood decoding which is too complex to be implemented for the codes considered. Trade-offs between decoding complexity and error performance are also investigated. In particular, a stopping criterion which reduces the average number of iterations at the expense of very little performance degradation is proposed for this combined decoding approach. Simulation results for several Gallager (1963, 1968) LDPC codes and different set cyclic codes of hundreds of information bits are given and elaborated.
This paper deals with the method of undetected error probability estimation for a low-density parity-check (LDPC) code under any given iterative decoding algorithm. We propose such modification of a given iterative decoding algorithm, that almost preserves a decoding failure exponent and decoding complexity of this algorithm. We obtain the upper bound on the undetected error probability for the modified algorithm. We show how to use the proposed method to estimate the undetected error probability of LDPC code under the belief propagation (BP) algorithm at the end of this paper.