An Improvement on the Min-sum Algorithm for Low-rate Protograph LDPC Codes

Gallager R G. Low-density parity-check codes [J].IRE Transactions on Information Theory.1962, 8(1):21-28[2]Chung S Y. On the construction of some capacity- approaching coding schemes [D]. [Ph.D. dissertation], MIT, Cambridge, MA, 2000.[3]Brink S ten. Convergence behavior of iteratively decoded parallel concatenated codes [J].IEEE Transactions on Communications.2001, 49(10):1727-1737[4]Qian D, Jiang M, and Zhao C, et al.. A modification to weighted bit-flipping decoding algorithm for LDPC codes based on reliability adjustment [C]. IEEE International Conference, Beijing, 2008: 1161-1165.[5]Mobini N, Banihashemi A H, and Hemati S. A differential binary message-passing LDPC decoder [J].IEEE Transactions on Communications.2009, 57(9):2518-2523[6]Kim S, Jang M H, and No J S, et al.. Sequential message- passing decoding of LDPC codes by partitioning check nodes [J].IEEE Transactions on Communications.2008, 56(7):1025-1031[7]Chang Y M, Andres I, and Casado V. Lower-complexity layered belief-propagation decoding of LDPC codes [C]. IEEE International Conference, Beijing, 2008: 1155-1160.[8]Chen J and Fossorier M P C. Near-optimum universal belief propagation based decoding of low-density parity check codes [J].IEEE Transactions on Communications.2002, 50(3):406-414[9]Divsalar D, Dolinar S, and Jones C, et al.. Capacity- approaching protograph codes [J].IEEE Journal on Selected Areas in Communications.2009, 27(6):876-888[10]Gounai S and Ohtsuki T. Decoding algorithms based on oscillation for Low-Density Parity Check codes [J].IEICE Transactions on Fundamentals.2005, E88-A(8):2216-2226[11]Zhang J, Fossorier M, and Gu D. Two-dimensional correction for min-sum decoding of irregular LDPC codes [J].IEEE Communications Letters.2006, 10(3):180-182[12]Divsalar D, Dolinar S, and Jones C. Low-rate LDPC codes with simple protograph structure [C]. Proceedings International Symposium on Information Theory, Adelaide, 2005: 1622-1626.Richter G, Schmidt G, and Bossert M, et al.. Optimization of a reduced-complexity decoding algorithm for LDPC codes by density evolution [C]. Proceedings 2005 IEEE International Conference on Communications, Seoul, Korea, 2005: 642-646.[13]Chen J, Dholakia A, and Eleftheriou E, et al.. Reduced- complexity decoding of LDPC codes [J].IEEE Transactions on Communications.2005, 53(8):1288-1299[14]Hu X Y, Eleftheriou E, and Arnold D M. Regular and irregular progressive edge-growth Tanner graphs [J].IEEE Transactions on Information Theory.2005, 51(1):386-398[15]Tian T, Jones C, and Villasenor J D, et al.. Selective avoidance of cycles in irregular LDPC code construction [J].IEEE Transactions on Communications.2004, 52(8):1242-1247