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

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.

@article{Islam,2011,
  title     = {Optimized Min-Sum Decoding Algorithm for Low Density Parity Check Codes},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {2},
  number    = {12},
  year      = {2011},
  publisher = {The Science and Information Organization},
  author    = {Mohammad Rakibul Islam, and Dewan Siam Shafiullah and Muhammad Mostafa Amir Faisal and Imran Rahman},
  doi       = {10.14569/IJACSA.2011.021225},
  url       = {https://doi.org/10.14569/IJACSA.2011.021225}
}