Optimization of the min-sum decoding algorithm for low-density parity-check codes

In this paper iterative decoding algorithms of low-density parity check codes are considered. Various modified versions of the minsum algorithm are considered. Dependency graphs of the bit error on various coefficients when transmitting data over a binary communication channel with additive white Gaussian noise are constructed. Comparison of the complexity of the implementation of various decoding algorithms is studied.