LDPC block and convolutional codes based on circulant matrices

IEEE Transactions on Information Theory

Volumn 50, Issue 12, 2004, Pages 2966-2984

  Tanner, R Michael ^a   Sridhara, Deepak ^b,c   Sridharan, Arvind ^b   Fuja, Thomas E ^b   Costello Jr , Daniel ^b  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^b University of Notre Dame   (United States)

^c INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Circulant matrices; Iterative decoding; LDPC codes; LDPC convolutional codes; Low density parity check (LDPC) block codes; Message passing; Quasi cyclic (QC) codes

Indexed keywords

CONVOLUTIONAL CODES; DECODING; ENCODING (SYMBOLS); ITERATIVE METHODS; MATRIX ALGEBRA; SIGNAL TO NOISE RATIO; WHITE NOISE;

CIRCULANT MATRICES; ITERATIVE DECODING; LOW DENSITY PARITY CHECK (LDPC) BLOCK CODES; LOW DENSITY PARITY CHECK CONVOLUTIONAL CODES; MESSAGE PASSING; QUASI CYCLIC (QC) CODES;

BLOCK CODES;

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

References (32)

1. S.-Y. Chung, G. D. Fomey, Jr., T. J. Richardson, and R. Urbanke, "On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit," IEEE Commun. Lett., vol. 5, pp. 58-60, Feb. 2001.
2. R. M. Tanner, "A [155, 64, 20] sparse graph (LDPC) code," presented at the Recent Results Session at IEEE International Symposium on Information Theory, Sorrento, Italy, June 2000.
3. Y. Kou, S. Lin, and M. Fossorier, "Low density parity-check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inform. Theory, vol. 47, pp. 2711-2736, Nov. 2001.
4. J. Rosenthal and P. O. Vontobel, "Constructions of LDPC codes using Ramanujam graphs and ideas from Margulis," in Proc. 38th Allerton Conf. Communications, Control, and Computing, Monticello, IL, Oct. 2000, pp. 248-257.
5. R. M. Tanner, "On quasi-cyclic repeat accumulate codes," in Proc. 37th Allerton Conf. Communication, Control and Computing, Monticello, IL, Oct. 1999, pp. 249-259.
6. M. P. C. Fossorier, "Quasi-cyclic low-density parity-check codes from circulani permutation matrices," IEEE Trans. Inform. Theory, to be published.
7. J. L. Fan, "Array codes as low-density parity check codes," in Proc. 2nd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sept. 2000, pp. 543-546.
8. R. M. Tanner, "Convolutional codes from quasi-cyclic codes: A link between the theories of block and convolutional codes," Univ. Calif. Santa Cruz, Tech. Rep., 1987.
9. Y. Levy and D. J. Costello, Jr., "An algebraic approach to constructing convolutional codes from quasi-cyclic codes," DIMACS Ser. Discr. Math. Theor. Comput. Sci., vol. 14, pp. 188-198, 1993.
10. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
11. T. Richardson and R. Urbanke, "The capacity of low-density parity check codes under message-passing decoding," IEEE Trans. Inform. Theory vol. 47, pp. 599-618, Feb. 2001.
12. S. L. Hakimi and J. Bredeson, "Graph theoretic error-correcting codes," IEEE Trans. Inform. Theory, vol. IT-14, pp. 584-591, July 1968.
13. R. M. Tanner, D. Sridhara, and T. E. Fuja, "A class of group-structured LDPC codes," in Proc. Int. Symp. Communications Theory and Applications, Ambleside, U.K., July 2001.
14. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.
15. D. J. C. MacKay, S. T. Wilson, and M. C. Davey, "Comparison of constructions of irregular Gallager codes," IEEE Trans. Communications, vol. 47, pp. 1449-1454, Oct. 1999.
16. S.-Y. Chung, T. Richardson, and R. Urbanke, "Analysis of sum-product decoding of low density parity-check codes using a Gaussian approximation," IEEE Trans. Inform. Theory, vol. 47, pp. 657-670, Feb. 2001.
17. D. J. C. MacKay and M. C. Davey, Evaluation of Gallager Codes for Short Block Length and High Rate Applications, 2001, vol. 123, IMA volumes in Mathematics and its Applications, ch. 5, pp. 113-130.
18. R. Johannesson and K. S. Zigangirov, Fundamentals of Convolutional Coding. Piscataway, NJ: IEEE Press, 1999.
19. H. H. Ma and J. K. Wolf, "On tail-biting convolutional codes," IEEE Trans. Commun., vol. COM-34, pp. 104-111, Feb. 1986.
20. G. Solomon and H. C. A. van Tilborg, "A connection between block and convolutional codes," SIAM J. Appl. Math., vol. 37, no. 2, pp. 358-369, Oct. 1979.
21. S. Lin and D. J. Costello, Jr., Error Control Coding: Fundamentals and Applications. Upper Saddle River, NJ: Prentice-Hall, 2004.
22. R. M. Tanner, "Minimum distance bounds by graph analysis," IEEE Trans. Inform. Theory, vol. 47, pp. 808-821, Feb. 2001.
23. A. Orlitsky, R. Urbanke, K. Vishwanathan, and J. Zhang, "Stopping sets and the girth of Tanner graphs," in Proc. 2002 IEEE Int. Symp. Information Theory, Lausanne, Switzerland, June/July 2002, p. 2.
24. T. Richardson and R. Urbanke, "Efficient encoding of low density parity check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 638-656, Feb. 2001.
25. R. M. Tanner, "A transform theory for a class of group invariant codes," IEEE Trans. Inform. Theory, vol. 34, pp. 725-775, July 1988.
26. M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman, and V. Stemann, "Practical erasure resilient codes," in Proc. 29th Annu. ACM Symp. Theory of Computing, (STOC), 1997, pp. 150-159.
27. C. Di, D. Proietti, I. E. Teletar, T. Richardson, and R. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inform. Theory, vol. 48, pp. 1570-1579, June 2002.
28. D. Sridhara, T. E. Fuja, and R. M. Tanner, "Low density parity check codes from permutation matrices," in Proc. Conf. Information Sciences and Systems, Baitimore, MD, Mar. 2001, p. 142.
29. A. J. Feltström and K. S. Zigangirov, "Time-varying periodic convolutional codes with low-density parity-check matrix," IEEE Trans. Inform. Theory, vol. 45, pp. 2181-2191, Sept. 1999.
30. A. Sridharan, D. J. Costello, Jr., D. Sridhara, T. E. Fuja, and R. M. Tanner, "A construction for low density parity check convolutional codes based on quasi-cyclic block codes," in Proc. 2002 IEEE Int. Symp. Information Theory, Lausanne, Switzerland, June 2002, p. 481.
31. A. Sridharan, M. Lentmaier, D. J. Costello, Jr., and K. S. Zigangirov, "Convergence analysis of a class of LDPC convolutional codes for the erasure channel," in Proc. 42nd Allerton Conf. Communication, Control and Computing, Monticello, IL, Oct. 2004.
32. K. Yoshida, J. Brockman, D. Costello, Jr., T. Fuja, and R. M. Tanner, "VLSI implementation of quasi-cyclic LDPC codes," in Proc. 2004 Int. Symp. Information Theory and Its Applications, Parma, Italy, Oct. 10-13, 2004, pp. 551-556.