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

REV Journal on Electronics and Communications

A New High Performance Decoder for LDPC Codes

Nguyen Tung Hung, Nguyen Van Duan

Published Jul 1, 2014• 1 citation
Publisher

Abstract

The article introduces a new decoder for LDPC codes based on the general check matrix and soft syndrome. Simulation result shows that the new decoder can improve the performance of LDPC codes. Compared with some other improvements, the new decoding algorithm is simpler, and it can detect errors and be applied to great length LDPC codes.
DOI
10.21553/rev-jec.62

Related papers

A New Decoding Algorithm based on Equivalent Parity Check Matrix for LDPC Codes

Nguyen Tung Hung

The article introduces a new LDPC decoding algorithm based on Equivalent Parity Check Matrix. Simulation results show that the new LDPC decoding algorithm can improve LDPC decoding performance. Compared to some other improvements, the new LDPC decoding algorithm, which is simpler, can detect errors and be applied to LDPC codes for great-length LDPC codes.

REV Journal on Electronics and Communications•Oct 1, 2013•2 citations

Syndrome Weight Decision based Genetic Algorithm Decoder for LDPC Codes

Hasna Chaibi, Ahlam Berkani, My Ahmad

Genetic algorithms are successfully used for decoding some classes of error correcting codes, and offer very good performances when solving large optimization problems .This article introduces a new Decoder based on Genetic Algorithm and the Syndrome Weight decision (GADSW) for decoding Low Density Parity Check (LDPC) codes.The performances of (GADSW) decoder are very good compared to sumproduct decoder, which prove its efficiency.

International Journal of Computer Applications•Oct 15, 2015•3 citations

Improved Redundant Parity-Check Based BP Decoding of LDPC Codes

Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek +1 more

A new decoding algorithm for LDPC codes on the AWGN channel is proposed. The algorithm is based on the idea of using redundant parity checks and additional variable nodes. The new key element in the proposed algorithm is the use of the orthogonal subsets of parity checks for computing soft decisions for different variable nodes. This allows for significant improvement in the decoding error performance of the algorithm compared to the known counterparts. Furthermore, new bounds on the error performance of the BP decoding applied to the parity-check matrices with redundant parity-checks are obtained.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2018•3 citations

Candidate bit based bit-flipping decoding algorithm for LDPC codes

Guiqiang Dong, Yanan Li, Ningde Xie +2 more

A novel hard-decision decoding algorithm for low-density parity-check (LDPC) codes is proposed in this paper. This algorithm employs the correlation information among the column vectors of the parity-check matrix and syndrome vector for decoding. It does not require soft information, and has low decoding complexity. Simulation results show that the proposed decoding algorithm could provide an effective tradeoff between error performance and decoding complexity.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2009•11 citations

Analysis and improvement of the bit-flipping decoding algorithm for LDPC codes

SU Guang-chuan

According to the statistical decoding method,a new enlarged set of the low density check vectors was constructed by the linear combination among the vectors of the LDPC code's old check matrix.Combined with the analysis of the ParallelBit-Flipping(PBF) decoding algorithm,such as loop detection technique,a new hard-decision decoding algorithm was presented for LDPC codes.The simulation results show that our algorithm has small iterative numbers just like the PBF algorithm,and the decoding performance approaching the belief propagation algorithm.

Journal of Computer Applications•Jan 1, 2006•0 citations

An Improved Bit-flipping Decoding Algorithm for Low-density Parity-check Codes

Zhu Jin-kang

An improved bit-flipping decoding algorithm is proposed for low-density parity-check(LDPC) codes in this paper.Two influences on error probabilities of code bits are considered: the influence of the number of code bits included in an unsatisfied check,and the influence of the number of unsatisfied checks of each code bit.No soft information is required for decoding.Simulation results show that improvement on performance is observed for the proposed algorithm,and it provides better performance over several soft-decision bit-flipping decoding algorithms for LDPC codes with large girth.

Wireless Communication Technology•Jan 1, 2008•0 citations
A new decoding algorithm for LDPC codes on the AWGN channel is proposed. The algorithm is based on the idea of using redundant parity checks and additional variable nodes. The new key element in the proposed algorithm is the use of the orthogonal subsets of parity checks for computing soft decisions for different variable nodes. This allows for significant improvement in the decoding error performance of the algorithm compared to the known counterparts. Furthermore, new bounds on the error performance of the BP decoding applied to the parity-check matrices with redundant parity-checks are obtained.
According to the statistical decoding method,a new enlarged set of the low density check vectors was constructed by the linear combination among the vectors of the LDPC code's old check matrix.Combined with the analysis of the ParallelBit-Flipping(PBF) decoding algorithm,such as loop detection technique,a new hard-decision decoding algorithm was presented for LDPC codes.The simulation results show that our algorithm has small iterative numbers just like the PBF algorithm,and the decoding performance approaching the belief propagation algorithm.
An improved bit-flipping decoding algorithm is proposed for low-density parity-check(LDPC) codes in this paper.Two influences on error probabilities of code bits are considered: the influence of the number of code bits included in an unsatisfied check,and the influence of the number of unsatisfied checks of each code bit.No soft information is required for decoding.Simulation results show that improvement on performance is observed for the proposed algorithm,and it provides better performance over several soft-decision bit-flipping decoding algorithms for LDPC codes with large girth.