New Approach to Optimal Approximation of Tanh Rule for LDPC Codes under the Gaussian Approximation

Callager R C. Low-Density Parity-Check Codes. Cambridge,MA: MIT Press, 1963, Chapter 1.[2]Tanner R M. A recursive approach to low complexity codes.IEEE Trcms. on I匆orm. Theory, 1981, IT-27(5): 533-547.[3]Richardson T J, Shokrollahi M A, Urbanke R L. Design ofcapacity-approaching irregular low-density parity-check codes[J].IEEETrans. onlnform. Theory.2001, 47(2):619-637[4]Luby M C, Mitzenmacher M, Shokrollahi M A, Spielman D A.Efficient erasure correcting codes[J].IEEE Trans. on Inform. Theory.2001, 47(2):569-584[5]Hagenauer J, Offer E,block and convolutionalPapkecodes.L. Iterative decoding of binaryZF.F.F.7YCL12,Son InformTheory,1996, 42(2): 429-445.[6]Ha J, Kim J, McLaughlin S W Rate-compatible puncturing of low-density parity-check codes. IEEE Trans[J].on Inform. Theory.2004, 50(11):2824-2836[7]Chung S Y, Richardson T J, Urbanke R L. Analysis of sum-product decoding of low-density parity-check codes using a Caussian approximation[J].IEEE Trans. on Iorm. Theory.2001, 47(2):657-670[8]Hagenauer J. Source-controlled channel decoding[J].IEEE Trans. on6}mmun.1995, 43(9):2449-2457[9]MacKay D J C. Good error-correcting codes based on very sparse matrices[J].IEEE Trans. on I匆orm. Theory.1999, 45(2):399-431[10]Chen J, Fossorier M. Near optimum universal belief propagation based decoding of low-density parity check codes[J].IEEE Trans. on6}mmun.2002, 50(3):406-414[11]Chen J, Fossorier M. Density evolution for two improved BP-based decoding algorithms of LDPC codes[J].IEEE Commun. Levers.2002, 6(5):208-210[12]Wei L. Several properties of short LDPC codes[J].IEEE Trans. on Commun.2004, 52(5):721-727