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

New interative decoding algorithms for low-density parity-check (LDPC) codes

Nastaran Mobini

Published Jan 1, 2011• 0 citations
Publisher
DOI
10.22215/etd/2011-07099

Related papers

A Comparative Review of Recent Advances in Decoding Algorithms for Low-Density Parity-Check (LDPC) Codes and Their Applications

Michaelraj Kingston Roberts, Parthibaraj Anguraj

Archives of Computational Methods in Engineering•Jul 16, 2020•32 citations

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

Iterative Decoding of Complex-rotary Codes

Wen Hong, Jin Fan, Fei Hu

Due to its near-optimum decoding for low-density parity check (LDPC) codes and turbo codes, the belief propagation (BP) algorithm has recently received a lot of attention in the coding community. In this paper, the iterative decoding of complex-rotary codes (CRC) based on the belief propagation is researched. The decoding performance of CRC is as good as those of the finite geometry codes and the difference set cyclic codes. A modest performance gain is made over the low density parity check codes with similar parameters. Two new low complexity algorithms for decoding complex-rotary codes are developed. The complexity of the new algorithms is remarkably low in comparison with the BP algorithm.

Journal of the China Railway Society•Jan 1, 2005•0 citations

Early Detection Algorithm for Decoding LDPC Codes

Ho-Il Kim

한국통신학회 학술대회 및 강연회•Apr 1, 2004•4 citations

Optimal Puncturing of Block-Type LDPC Codes and Their Fast Convergence Decoding

Song‐Nam Hong, Hyeong‐Gun Joo, Dong‐Joon Shin

In this paper, we study and propose a puncturing algorithm of block-type low-density parity-check (B-LDPC) codes. This optimal puncturing algorithm is derived from the fact that puncturing of parity bits is equivalent to merging the check nodes. Furthermore, we propose a new decoding algorithm suitable for the punctured B-LDPC codes. This decoding algorithm needs not only smaller number of operations at each iteration, but also shows faster decoding convergence speed than the conventional erasure decoding algorithm. If the optimally punctured B-LDPC code is decoded by the new decoding algorithm, it results in the same performance as the unpunctured B-LDPC code of the same code rate.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2006•8 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
Due to its near-optimum decoding for low-density parity check (LDPC) codes and turbo codes, the belief propagation (BP) algorithm has recently received a lot of attention in the coding community. In this paper, the iterative decoding of complex-rotary codes (CRC) based on the belief propagation is researched. The decoding performance of CRC is as good as those of the finite geometry codes and the difference set cyclic codes. A modest performance gain is made over the low density parity check codes with similar parameters. Two new low complexity algorithms for decoding complex-rotary codes are developed. The complexity of the new algorithms is remarkably low in comparison with the BP algorithm.
In this paper, we study and propose a puncturing algorithm of block-type low-density parity-check (B-LDPC) codes. This optimal puncturing algorithm is derived from the fact that puncturing of parity bits is equivalent to merging the check nodes. Furthermore, we propose a new decoding algorithm suitable for the punctured B-LDPC codes. This decoding algorithm needs not only smaller number of operations at each iteration, but also shows faster decoding convergence speed than the conventional erasure decoding algorithm. If the optimally punctured B-LDPC code is decoded by the new decoding algorithm, it results in the same performance as the unpunctured B-LDPC code of the same code rate.