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

Information Technology Journal

Performance Evaluation of Sum Product and Min-sum Stopping Node Algorithm for LDPC Decoding

Nguyen Thi Dieu Linh, Gang Wang, Min Jia, Georgia Rugumira

Published Jun 9, 2012• 3 citations
Publisher
DOI
10.3923/itj.2012.1298.1303

Related papers

Reduced-complexity decoding of LDPC codes based on the sum-product algorithm

양경철

•Nov 1, 2006•0 citations

Performance and processing time enhancement of LDPC decoder using stopping node modified Sum Product algorithm

Nguyen Thi Dieu Linh, Gang Wang, Abdelhafidh Barkana +1 more

In this paper, a new method based on Sum Product algorithm (SPA) using stopping node to reduce computing complexity on Low Density Parity Check Codes (LDPC) decoding algorithms is presented. We show how to make early decisions to reduce calculation of the next iteration. Simulation results show that performance of iterative decoding for LDPC codes using stopping node algorithm can reduce up to 10 times computational complexity with maintaining quality level.

IEEE International Conference on Communication Technology (ICCT)•Sep 1, 2011•2 citations

Efficient Inplementation of the Sum-Product Algorithm for Decoding LDPC Codes

X-Y. Hu

Globecom•Jan 1, 2001•0 citations

Optimized Min-Sum Decoding Algorithm for Low Density Parity Check Codes

Mohammad Rakibul, Dewan Siam Shafiullah, Muhammad Mostafa +1 more

Low Density Parity Check (LDPC) code approaches Shannon–limit performance for binary field and long code lengths. However, performance of binary LDPC code is degraded when the code word length is small. An optimized min-sum algorithm for LDPC code is proposed in this paper. In this algorithm unlike other decoding methods, an optimization factor has been introduced in both check node and bit node of the Min-sum algorithm. The optimization factor is obtained before decoding program, and the same factor is multiplied twice in one cycle. So the increased complexity is fairly low. Simulation results show that the proposed Optimized Min-Sum decoding algorithm performs very close to the Sum-Product decoding while preserving the main features of the Min-Sum decoding, that is low complexity and independence with respect to noise variance estimation errors.

International Journal of Advanced Computer Science and Applications•Jan 1, 2011•19 citations

Optimized Min-Sum decoding algorithm for Low Density PC codes

Dewan Siam Shafiullah, Mohammad Rakibul Islam, Muhammad Mostafa Amir Faisal +1 more

Low Density Parity Check (LDPC) approaches Shannon -limit performance for binary field and long code lengths. However performance of binary LDPC code is degraded when the code word length is small. An optimized min-sum algorithm for LDPC code is proposed in this paper. In this algorithm unlike other decoding methods an optimization factor has been introduced in both check node and bit node of the Min-sum algorithm. The optimization factor is obtained before decoding program and the same factor is multiplied twice in one cycle. So the increased complexity is fairly low. Simulation results show that the proposed Optimized Min-Sum decoding algorithm performs very close to the Sum-Product decoding, while preserving the main features of the Min-Sum decoding, that is low complexity and independence with respect to noise variance estimation errors.

International Conference on Advanced Communication Technology•Jan 1, 2012•5 citations

Improving Performance of the Min Sum Algorithm for LDPC Codes

Abdelilah Kadi, Saïd Najah, Mostafa Mrabti +1 more

Lecture notes in electrical engineering•Jan 1, 2016•0 citations
Low Density Parity Check (LDPC) code approaches Shannon–limit performance for binary field and long code lengths. However, performance of binary LDPC code is degraded when the code word length is small. An optimized min-sum algorithm for LDPC code is proposed in this paper. In this algorithm unlike other decoding methods, an optimization factor has been introduced in both check node and bit node of the Min-sum algorithm. The optimization factor is obtained before decoding program, and the same factor is multiplied twice in one cycle. So the increased complexity is fairly low. Simulation results show that the proposed Optimized Min-Sum decoding algorithm performs very close to the Sum-Product decoding while preserving the main features of the Min-Sum decoding, that is low complexity and independence with respect to noise variance estimation errors.
Low Density Parity Check (LDPC) approaches Shannon -limit performance for binary field and long code lengths. However performance of binary LDPC code is degraded when the code word length is small. An optimized min-sum algorithm for LDPC code is proposed in this paper. In this algorithm unlike other decoding methods an optimization factor has been introduced in both check node and bit node of the Min-sum algorithm. The optimization factor is obtained before decoding program and the same factor is multiplied twice in one cycle. So the increased complexity is fairly low. Simulation results show that the proposed Optimized Min-Sum decoding algorithm performs very close to the Sum-Product decoding, while preserving the main features of the Min-Sum decoding, that is low complexity and independence with respect to noise variance estimation errors.