As discussed earlier, there are two ways to deliver messages in the LDPC decoding. One is to use probabilities, and the other is to use LLRs [6]. In general, utilizing LLR values is favored since by using LLR values, we can replace expensive multiplication operations with inexpensive addition operations [14]. UMP-BP algorithm was proposed to reduce the processing complexity of LLR-BP algorithm [15]. UMP-BP shows worse performance than LLR-BP approximately by 1dB. But UMP- BP has merits of significant reduction in the computational complexity and eliminated need for the channel estimation [16]. Modified UMP-BP algorithm divides the message value by a specified coefficient. The complexity of the processing remains almost the same, but the BER performance is very close to what LLR-BP shows as shown in Fig. 11 [7]. The proposed LDPC decoder employs Modified UMP-BP algorithm