Recently, LDPC codes have been proved to be capable of closely approaching the channel capacity and hence they are strongly promoted in many international standards. Though decoding is simpler compared to Turbo code decoding, efficient decoding techniques for LDPC codes are in demand to make it further simpler. The theoretical performance of LDPC codes appears simple and close to Shannon’s capacity of channel, but the practical implementation is still challenging due to tasks like numerical inaccuracy, limited memory resources, etc. We investigate methods to reduce the complexity and make decoding simple while still keeping the loss in performance negligible. The aim of this paper is to reduce the complexity by simplification of the component decoders. For this, we analyze the min-sum algorithm and derive a theoretical framework. With this framework, we are able to modify the algorithm in order to achieve good performance for regular as well as irregular LDPC codes.