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

Lecture notes in electrical engineering

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

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

Published Dec 11, 2017• 4 citations
Publisher
DOI
10.1007/978-981-10-4762-6_58

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

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

Junho Cho

•Jan 1, 2010•0 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

An overview of some efficient encoding and decoding algorithms for Low-Density Parity-Check Codes

Enrico Paolini, Gianluigi Liva, Marco Chiani

•Oct 10, 2003•0 citations

A Study of Decoding Algorithm of Low Density Parity Check Code

Naoto Kobayashi, Ryo Nomura, Toshiyasu Matsushima

Technical report of IEICE. ISEC•Mar 12, 2002•1 citation

Symbol-flipping based decoding of generalized low-density parity-check codes over GF(q)

Fang-Chun Kuo, L. Hanzo

An efficient symbol-flipping based decoding algorithm designed for nonbinary generalized low-density parity-check (GLDPC) codes is proposed. By extending the concept of the weighted bit flip voting (WBFV) algorithm designed for binary Hamming-code based GLDPC codes, the symbol-flipping decoding algorithm can be beneficially employed for decoding the family of GLDPC codes constructed from nonbinary constituent codes, such as nonbinary Bose Chaudhuri Hocquenghem (BCH) codes or Reed Solomon (R-S) codes. The simulation results demonstrate that improvements of 1 dB and 2.7 dB are achieved by the proposed coding scheme in comparison to the more conventional binary GLDPC codes using the WBFV decoding algorithm, when using the Galois Field GF(32) for communicating over AWGN and uncorrelated Rayleigh fading channels, respectively

IEEE Wireless Communications and Networking Conference•Jan 1, 2006•10 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
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.
An efficient symbol-flipping based decoding algorithm designed for nonbinary generalized low-density parity-check (GLDPC) codes is proposed. By extending the concept of the weighted bit flip voting (WBFV) algorithm designed for binary Hamming-code based GLDPC codes, the symbol-flipping decoding algorithm can be beneficially employed for decoding the family of GLDPC codes constructed from nonbinary constituent codes, such as nonbinary Bose Chaudhuri Hocquenghem (BCH) codes or Reed Solomon (R-S) codes. The simulation results demonstrate that improvements of 1 dB and 2.7 dB are achieved by the proposed coding scheme in comparison to the more conventional binary GLDPC codes using the WBFV decoding algorithm, when using the Galois Field GF(32) for communicating over AWGN and uncorrelated Rayleigh fading channels, respectively