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 Decoding Algorithm based on Equivalent Parity Check Matrix for LDPC Codes

Nguyen Tung Hung

Published Oct 1, 2013• 2 citations
Publisher

Abstract

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.

DOI
10.21553/rev-jec.57

Related papers

A New High Performance Decoder for LDPC Codes

Nguyen Tung Hung, Nguyen Van Duan

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.

REV Journal on Electronics and Communications•Jul 1, 2014•1 citation

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

A Method on Construction of LDPC Parity-Check Matrix

Lizhi Zhao

A method on construction of LDPC Parity-check matrix was proposed,by removing loops with girth 4 in a semi-random parity-check matrix.Simulation results show that the proposed method can effectively avoid the influence on the performance of LDPC codes exerted by short loops,so the decoding performance is distinctively improved.Furthermore,the better performance can be obtained as the increasing of code lengths.

现代传播：中国传媒大学学报•Jan 1, 2008•0 citations

Improved BP Decoding Algorithm for LDPC Codes

Li Na Wang, Xiao Liu

In this paper, an improved belief propagation decoding algorithm was proposed for low density parity check codes. In the proposed decoding process, error bits can be detected once again after hard-decision in the conventional BP decoding algorithm. The detection criterion is based on check matrix characteristics and D-value between prior probability and posterior probability. Simulation results demonstrate the performance of the improved BP decoding algorithm outperform that of the conventional BP decoding algorithm.

Advanced materials research•Nov 1, 2013•1 citation

An Improved Decoding Algorithm for LDPC Codes

XU Yong-tai

An improved decoding algorithm based on minimum mean square error(MMSE) for low-density parity-check(LDPC) codes is proposed.The new algorithm combines processing methods of two modified uniformly most powerful(UMP) BP-based algorithms(normalized UMP BP-based algorithm and offset UMP BP-based algorithm) and attains the corresponding normalization factor and offset factor according to MMSE criterion.Simulations indicate that,compared with the two above-mentioned algorithms,a gain of 0.03 dB can be achieved at bit error rate(BER) of 10-6 with the proposed algorithm when a(3,6) regular LDPC code of code length 1 008 and code rate 1/2 is used.

Beijing Youdian Xueyuan xuebao•Jan 1, 2007•0 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
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.
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.
In this paper, an improved belief propagation decoding algorithm was proposed for low density parity check codes. In the proposed decoding process, error bits can be detected once again after hard-decision in the conventional BP decoding algorithm. The detection criterion is based on check matrix characteristics and D-value between prior probability and posterior probability. Simulation results demonstrate the performance of the improved BP decoding algorithm outperform that of the conventional BP decoding algorithm.
An improved decoding algorithm based on minimum mean square error(MMSE) for low-density parity-check(LDPC) codes is proposed.The new algorithm combines processing methods of two modified uniformly most powerful(UMP) BP-based algorithms(normalized UMP BP-based algorithm and offset UMP BP-based algorithm) and attains the corresponding normalization factor and offset factor according to MMSE criterion.Simulations indicate that,compared with the two above-mentioned algorithms,a gain of 0.03 dB can be achieved at bit error rate(BER) of 10-6 with the proposed algorithm when a(3,6) regular LDPC code of code length 1 008 and code rate 1/2 is used.