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

Technical report of IEICE. ISEC

A Study of Decoding Algorithm of Low Density Parity Check Code

Naoto Kobayashi, Ryo Nomura, Toshiyasu Matsushima

Published Mar 12, 2002• 1 citation
OpenAlex

Related papers

Self reliability based weighted bit-flipping decoding for low-density parity-check codes

Jin Sha, Minglun Gao, Zhongjin Zhang +2 more

Abstract- Low Density Parity Check (LDPC) codes can be decoded in various ways, namely the Bit-Flipping (BF) algorithm, the Weighted BF algorithm (WBF) ， the Belief Propagation (BP) algorithm and so on. These algorithms provide a wide range of tradeoffs among decoding complexity, decoding speed, and error rate performance. In this paper, a novel self-reliability-based weighted bit-flipping decoding scheme for low-density parity-check codes is proposed. Improvement in performance is observed in comparison with the modified weighted bit-flipping decoding scheme, and the decoding complexity can be significantly reduced as well. Key-Words:- Low-density parity-check (LDPC) codes, decoding algorithm, bit flipping, self reliability

International Conference on Instrumentation, Measurement, Circuits and Systems•Apr 16, 2006•3 citations

Introduction of Low-density Parity-Check decoding Algorithm design

Florent Pirou

•Jan 1, 2004•1 citation

Low-density Parity-Check decoding Algorithms

Florent Pirou

Recently, low-density parity-check (LDPC) codes have attracted much attention because of their excellent error correcting performance and highly parallelizable decoding scheme. However, the effective VLSI implementation of and LDPC decoder remains a big challenge and is a crucial issue in determining how well we can exploit the benefits of the LDPC codes in the real applications. In this master thesis report, following a error coding background, we describe Low-Density Parity-Check codes and their decoding algorithm, and also requirements and architectures of LPDC decoder implementations.

•Jan 1, 2004•0 citations

Improvement of decoding algorithms for low-density parity-check codes

Junho Cho

•Jan 1, 2010•0 citations

Comparison of Various Decoding Algorithms for EG-Low Density Parity Check Codes

Jyothi Chinna Babu, C. Chinnapu Reddy, M. N. Giri Prasad

Lecture notes in electrical engineering•Dec 11, 2017•4 citations

Review on Decoding Algorithms Useful in Modified Low Density Parity Check Code for Optical Fibre Communication

Bhavinee U. Parihar, Y. A. Nafde

Low-density parity-check (LDPC) codes are linear block codes. It is called low density parity check code because their parity-check matrix contains only a few 1’s in comparison to the amount of 0’s. These codes were first introduced by Gallager. It is a very powerful code for forward error correction system. The presently used LDPC code in optical fibre communication systems is not meeting the requirements of the high speed fibre optics communication systems. So the LDPC code can be modified and with which the quality factor can be improved. This modification is beneficial for the high speed fibre optic communication systems. We present here a comprehensive review of decoding algorithm of modified Low density parity check code useful in Optical fibre communication. BP and the MS decoding algorithms which are modified decoding algorithm are use for a better performance in high speed fibre optic communication.

•Dec 26, 2013•0 citations
Abstract- Low Density Parity Check (LDPC) codes can be decoded in various ways, namely the Bit-Flipping (BF) algorithm, the Weighted BF algorithm (WBF) ， the Belief Propagation (BP) algorithm and so on. These algorithms provide a wide range of tradeoffs among decoding complexity, decoding speed, and error rate performance. In this paper, a novel self-reliability-based weighted bit-flipping decoding scheme for low-density parity-check codes is proposed. Improvement in performance is observed in comparison with the modified weighted bit-flipping decoding scheme, and the decoding complexity can be significantly reduced as well. Key-Words:- Low-density parity-check (LDPC) codes, decoding algorithm, bit flipping, self reliability
Recently, low-density parity-check (LDPC) codes have attracted much attention because of their excellent error correcting performance and highly parallelizable decoding scheme. However, the effective VLSI implementation of and LDPC decoder remains a big challenge and is a crucial issue in determining how well we can exploit the benefits of the LDPC codes in the real applications. In this master thesis report, following a error coding background, we describe Low-Density Parity-Check codes and their decoding algorithm, and also requirements and architectures of LPDC decoder implementations.
Low-density parity-check (LDPC) codes are linear block codes. It is called low density parity check code because their parity-check matrix contains only a few 1’s in comparison to the amount of 0’s. These codes were first introduced by Gallager. It is a very powerful code for forward error correction system. The presently used LDPC code in optical fibre communication systems is not meeting the requirements of the high speed fibre optics communication systems. So the LDPC code can be modified and with which the quality factor can be improved. This modification is beneficial for the high speed fibre optic communication systems. We present here a comprehensive review of decoding algorithm of modified Low density parity check code useful in Optical fibre communication. BP and the MS decoding algorithms which are modified decoding algorithm are use for a better performance in high speed fibre optic communication.