Analysis of the Iterative Decoding of LDPC and Product Codes Using the Gaussian Approximation

IEEE Transactions on Information Theory

Volumn 49, Issue 11, 2003, Pages 2993-3000

  Lehmann, Frederic ^a   Maggio, Gian Mario ^b,c  

^a LAAS CNRS   (France)

^b STMicroelectronics USA   (United States)

^c University of California at San Diego   (United States)

Author keywords

Density evolution; Gaussian approximation; Low density parity check (LDPC) codes; Nonlinear dynamics; Threshold computation

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DECODING; ERRORS; GAUSSIAN NOISE (ELECTRONIC); ITERATIVE METHODS; PROBABILITY; RAYLEIGH FADING;

DENSITY EVOLUTION; LOW-DENSITY PARITY-CHECK (LDPC) CODES; THRESHOLD COMPUTATION;

CODES (SYMBOLS);

EID: 0345306756     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2003.819335     Document Type: Article

References (24)

1. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423, 1948.
2. R. G. Gallager, "Low density parity check codes," IRE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1962.
3. D. J. C. MacKay and R. M. Neal, "Near shannon limit performance of low density parity check codes," Electron. Lett., vol. 32, pp. 1645-1646, 1996.
4. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. inform. Theory, vol. 47, pp. 498-519, Feb. 2001.
5. P. Elias, "Error-free coding," IRE Trans. Inform. Theory, vol. PGIT-4, pp. 29-37, Sept. 1954.
6. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near shannon limit error-correcting coding and decoding: Turbo-codes," in Proc. IEEE Int. Conf. Communications, 1993, pp. 1064-70.
7. R. Pyndiah, A. Glavieux, A. Picart, and S. Jacq, "Near optimum decoding of product codes," in Proc. GLOBECOM'94, vol. 1, San Francisco, CA, Nov. 1994, pp. 339-343.
8. R. M. Pyndiah, "Near optimum decoding of product codes: Block turbo codes," lEEE Trans. Commun., vol. 46, pp. 1003-1010, Aug. 1998.
9. D. Chase, "A class of algorithms for decoding block codes with channel measurement information," IEEE Trans. Inform. Theory, vol. IT-18, pp. 170-182. Jan. 1972.
10. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb. 2001.
11. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47. pp. 619-637, Feb. 2001.
12. N. Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Linköping Univ., Linköping, Sweden, 1996.
13. S.-Y. Chung, T. J. Richardson, and R. L. Urbanke, "Analysis of sumproduct decoding of low-density parity-check codes using a Gaussian approximation," IEEE Trans. Inform. Theory, vol. 47, pp. 657-670, Feb. 2001.
14. H. E. Gammal and A. R. Hammons, Jr., "Analysis the turbo decoder using the Gaussian approximation," IEEE Trans. Inform. Theory, vol. 47, pp. 671-686, Feb. 2001.
15. D. Divsalar, S. Dolinar, and F. Pollara, "Iterative turbo decoder analysis based on density evolution," J. Select. Areas Commun., vol. 19, pp, 891-907, May 2001.
16. S. ten Brink, "Convergence of iterative decoding," Electron. Lett., vol. 35, no. 10, pp. 806-808, May 1999.
17. _, "Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. Commun., vol. 49, pp. 1727-1737, Oct. 2001.
18. F. Lehmann and G. M. Maggio, "An approximate analytical model of the message passing decoder of LDPC codes," in Proc. 2002 IEEE Int. Symp. Information Theory. Lausanne, Switzerland. June/July 2002, p. 31.
19. P. Rusmevichientong and B. Van Roy, "An analysis of belief propagation on the turbo decoding graph with Gaussian densities," IEEE Trans. Inform. Theory, vol. 47, pp. 745-765, Feb. 2001.
20. S. H. Strogatz, Nonlinear Dynamics and Chaos. Cambridge, MA: Perseus, 1994.
21. J. Hou, P. H. Siegel, and L. B. Milstein, "Performance analysis and code optimization of low density parity-check codes on Rayleigh fading channels," IEEE J. Select. Areas Commun., vol. 19, pp. 924-934, May 2001.
22. M. P. C. Fossorier and S. Lin, "Error performance analysis for reliability-based decoding algorithms," IEEE Trans.-Inform. Theory, vol. 48, pp. 287-293. Jan. 2002.
23. L. Bazzi, T. Richardson, and R. Urbanke, "Exact thresholds and optimal codes for the binary symmetric channel and Gallager's decoding algorithm A," in Proc 2000 IEEE Int. Symp. Information Theory, Sorrento, Italy, June 2000.
24. M. A. Shokrollahi, "New sequences of linear time erasure codes approaching the channel capacity," in Proc. AAECC'99: 13th AAECC Symp. Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, Honolulu, HI, Nov 1999, pp. 65-76.