A Low Decoding Complexity Gallager Code with Turbo Architecture

Gallager R G. Low-density parity-check codes. IRE Trans. on Inform. Theory, 1962, IT-8(1): 21-28.[2]MacKay D J C and Neal Near R M. Shannon limit performance of low density parity check codes[J].IEEE Electron. Lett.1996, 32(18):1645-1646[3]MacKay D J C. Good error-correcting codes based on very sparse matrices[J].IEEE Trans. on Information Theory.1999, 45(2):399-[4]Chung S Y, Forney G D J, and Richardson T J, et al.. On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit. IEEE Commun. Lett., 2001, 5(2): 58-60.[5]MacKay D J C. Gallager codes that are better than Turbo codes. 36th Allerton Conf. Communications, Control, and Computing, Monticello, USA, Sept. 1998: 23-25.[6]Chen J and Fossorier M P C. Density evolution for two improved BP-based decoding algorithms of LDPC codes[J].IEEE Commun. Lett.2002, 6(5):208-210[7]Rusmevichientong P and Van Roy B. An analysis of belief propagation on the Turbo decoding graph with Gaussian densities[J].IEEE Trans. on Information Theory.2001, 47(2):745-765[8]Hu X-Y, Eleftheriou E, and Arnol D M. Regular and irregular progressive edge-growth Tanner graphs[J].IEEE Trans. on Information Theory.2005, 51(1):386-398[9]Behairy H and Chang S C. Parallel concatenated Gallager codes[J].IEEE Electron. Lett.2000, 36(24):2025-2026[10]Behairy H and Chang S C. Parallel concatenated Gallager codes for CDMA applications. IEEE GLOBECOM 2001, San Antonio, USA, Nov. 2001: 1002-1006.[11]Behairy H and Chang S C. Analysis and design of parallel concatenated Gallager codes[J].IEEE Electron. Lett.2002, 38(18):1039-1040