Optimization of Two BP-Based Decoding Algorithms for Short LDPC Codes on Fast Rayleigh Fading Channel

[1] Gallager R G. Low-density parity-check codes[J].IRE Trans. Inform. Theory.1962, 8(1):21-28 [2] MacKay D J C and Neal R M. Near-Shannon-limit performance of low-density parity-check codes[J].Electron. Lett.1996, 32(18):1645-1646 [3] Tanner R M. A recursive approach to low complexity codes[J].IEEE Trans. on Inform. Theory.1981, 27(5):533-547 [4] Chung S Y, Richardson T J, and Urbanke R L. Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation[J].IEEE Trans. on Inform. Theory.2001, 47(2):657-670 [5] Fossorier M, Mihaljevic M, and Imai H. Reduced complexity iterative decoding of low-density parity check codes based on belief propagation[J].IEEE Trans. on Commun.1999, 47(5):673-680 [6] Chen J and Fossorier M. Near optimum universal belief propagation based decoding of low-density parity check codes[J].IEEE Trans. on Commun.2002, 50(3):406-414 [7] Chen J and Fossorier M. Density evolution for two improved BP-based decoding algorithms of LDPC codes[J].IEEE on Commun. Letters.2002, 6(5):208-210 [8] Chen J, Dholakia A, and Eleftheriou E, et al.. Reduced-complexity decoding of LDPC codes[J].IEEE Trans. on Commun.2005, 53(8):1288-1299 [9] Kim N and Park H. Modified UMP-BP decoding algorithm based on mean square error[J].Electron. Lett.2004, 40(13):816-817 [10] Hou J, Siegel P H, and Milstein L B. Performance analysis and code optimization of low density parity-check codes on Rayleigh fading channels[J].IEEE J. Select. Areas Commun.2001, 19(5):924-934