Deriving good LDPC convolutional codes from LDPC block codes

IEEE Transactions on Information Theory

Volumn 57, Issue 2, 2011, Pages 835-857

  Pusane, Ali E ^a,b   Smarandache, Roxana ^c   Vontobel, Pascal O ^d   Costello Jr , Daniel J ^a  

^a University of Notre Dame   (United States)

^b BOGAZICI UNIVERSITY   (Turkey)

^c SAN DIEGO STATE UNIVERSITY   (United States)

^d HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Block codes; convolutional codes; low density parity check (LDPC) codes; message passing iterative; pseudocodewords; pseudoweights; quasi cyclic codes; unwrapping; wrapping decoding

Indexed keywords

LOW-DENSITY PARITY-CHECK CODES; PSEUDOCODEWORDS; PSEUDOWEIGHTS; QUASICYCLIC CODES; UNWRAPPING; WRAPPING DECODING;

BLOCK CODES; CODING ERRORS; COMMUNICATION CHANNELS (INFORMATION THEORY); CONVOLUTION; FREQUENCY SELECTIVE FADING; ITERATIVE DECODING; MESSAGE PASSING;

CONVOLUTIONAL CODES;

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

References (58)

1. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error correcting coding and decoding: Turbo codes," in Proc. IEEE Int. Conf. Commun., Geneva, Switzerland, May 1993, pp. 1064-1070.
2. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inf. Theory, vol. 8, no. 1, pp. 21-28, Jan. 1962.
3. N. Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Dept. Electr. Eng., Linköping Univ., Linköping, Sweden, 1996.
4. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electron. Lett., vol. 32, no. 18, pp. 1645-1646, Aug. 1996.
5. M. G. Luby,M.Mitzenmacher,M. A. Shokrollahi, D. A. Spielman, and V. Stemann, "Practical loss-resilient codes," in Proc. 29th Annu. ACM Symp. Theory Comput., 1997, pp. 150-159.
6. M. G. Luby,M.Mitzenmacher,M. A. Shokrollahi, and D. A. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
7. 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. Inf. Theory, vol. 47, no. 2, pp. 657-670, Feb. 2001.
8. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
9. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
10. S. Y. Chung, G. D. Forney, Jr., T. J. Richardson, and R. L. Urbanke, "On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit," IEEECommun.Lett., vol. 5, no. 2, pp. 58-60, 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. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
12. P. Oswald and A. Shokrollahi, "Capacity-achieving sequences for the erasure channel," IEEE Trans. Inf. Theory, vol. 48, no. 12, pp. 3017-3028, Dec. 2002.
13. S. Bates, D. Elliot, and R. Swamy, "Termination sequence generation circuits for low-density parity-check convolutional codes," IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 53, no. 9, pp. 1909-1917, Sep. 2006. (Pubitemid 44500797)
14. S. Bates, Z. Chen, and X. Dong, "Low-density parity check convolutional codes for Ethernet networks," in Proc. IEEE Pacific Rim Conf. Commun. Comput. Signal Process., Victoria, BC, Canada, Aug. 2005, pp. 85-88.
15. S. Bates, L. Gunthorpe, A. E. Pusane, Z. Chen, K. Sh. Zigangirov, and D. J. Costello, Jr., "Decoders for low-density parity-check convolutional codes with large memory," in Proc. 12th NASA Symp. VLSI Design, Coeur d'Alene, ID, Oct. 2005.
16. R. M. Tanner, "Error-correcting coding system," U.S. Patent # 4 295 218, Oct. 1981.
17. R. M. Tanner, "Convolutional codes from quasi-cyclic codes: A link between the theories of block and convolutional codes," Univ. California, Santa Cruz, CA, Tech Rep. UCSC-CRL-87-21, Nov. 1987.
18. R. M. Tanner, D. Sridhara, A. Sridharan, T. E. Fuja, and D. J. Costello, Jr., "LDPC block and convolutional codes based on circulant matrices," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 2966-2984, Dec. 2004.
19. A. Jiménez-Feltström and K. Sh. Zigangirov, "Time-varying periodic convolutional codes with low-density parity-check matrix," IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 2181-2191, Sep. 1999.
20. R. M. Tanner, "On quasi-cyclic repeat-accumulate codes," in Proc. 37th Allerton Conf. Commun. Control Comput., Monticello, IL, Sep. 22-24, 1999, pp. 249-259.
21. J. Thorpe, "Low-density parity-check (LDPC) codes constructed from protographs," JPL INP Progr. Rep., Aug. 2003, pp. 42-154.
22. R. Koetter and P. O. Vontobel, "Graph covers and iterative decoding of finite-length codes," in Proc. 3rd Int. Symp. Turbo Codes Related Topics, Brest, France, Sep. 1-5, 2003, pp. 75-82.
23. P. O.Vontobel and R.Koetter, "Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes," Dec. 2005 [Online]. Available: http://www.arxiv.org/abs/cs.IT/0512078
24. A. E. Pusane, K. Sh. Zigangirov, and D. J. Costello, Jr., "Construction of irregular LDPC codes with fast encoding," in Proc. IEEE Int. Conf. Commun., Istanbul, Turkey, Jun. 11-15, 2006, vol. 3, pp. 1160-1165.
25. L. Zongwang, C. Lei, Z. Lingqi, S. Lin, and W. H. Fong, "Efficient encoding of quasi-cyclic low-density parity-check codes," IEEE Trans. Commun., vol. 54, no. 1, pp. 71-81, Jan. 2006.
26. T. J. Richardson and R. L. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 638-656, Feb. 2001.
27. S. Lin and D. J. Costello, Jr., Error Control Coding, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 2004.
28. M. Papaleo, A. R. Iyengar, P. H. Siegel, J.Wolf, and G. Corazza, "Windowed erasure decoding of LDPC convolutional codes," in Proc. IEEE Inf. Theory Workshop, Cairo, Egypt, Jan. 6-8, 2010, pp. 78-82.
29. S. Bates, Z. Chen, L. Gunthorpe, A. E. Pusane, K. Sh. Zigangirov, and D. J. Costello, Jr., "A low-cost serial decoder architecture for low-density parity-check convolutional codes," IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 55, no. 7, pp. 1967-1976, Aug. 2008.
30. A. E. Pusane, A. Jiménez-Feltström, A. Sridharan, M. Lentmaier, K. Sh. Zigangirov, and D. J. Costello, Jr., "Implementation aspects of LDPC convolutional codes," IEEE Trans. Commun., vol. 56, no. 7, pp. 1060-1069, Jul. 2008.
31. Y. Levy and D. J. Costello, Jr., "An algebraic approach to constructing convolutional codes from quasi-cyclic codes," in Coding and Quantization, ser. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Providence, RI: AMS, 1993, vol. 14, pp. 189-198.
32. M. Esmaeili, T. A. Gulliver, N. P. Secord, and S. A. Mahmoud, "A link between quasi-cyclic codes and convolutional codes," IEEE Trans. Inf. Theory, vol. 44, no. 1, pp. 431-435, Jan. 1998.
33. H. M. Stark and A. A. Terras, "Zeta functions of finite graphs and coverings," Adv. Math., vol. 121, no. 1, pp. 124-165, Jul. 1996.
34. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. New York: North-Holland, 1977.
35. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
36. R. Smarandache, A. E. Pusane, P. O. Vontobel, and D. J. Costello, Jr., "Pseudo-codeword performance analysis of LDPC convolutional codes," IEEE Trans. Inf. Theory, vol. 55, no. 6, pp. 2577-2598, Jun. 2009.
37. R. M. Tanner, "A [155, 64, 20] sparse graph (LDPC) code," presented at the IEEE Int. Symp. Inf. Theory, Sorrento, Italy, Jun. 2000.
38. F. Hug, I. Bocharova, R. Johannesson, B. Kudryashov, and R. Satyukov, "New low-density parity-check codes with large girth based on hypergraphs," in Proc. IEEE Int. Symp. Inf. Theory, Austin, TX, Jun. 13-18, 2010, pp. 819-823.
39. A. E. Pusane, R. Smarandache, P. O. Vontobel, and D. J. Costello, Jr., "On deriving good LDPC convolutional codes from QC LDPC block codes," in Proc. IEEE Int. Symp. Inf. Theory, Nice, France, Jun. 24-29, 2007, pp. 1221-1225.
40. D. J. Costello, Jr., A. E. Pusane, S. Bates, and K. Sh. Zigangirov, "A comparison between LDPC block and convolutional codes," in Proc. Inf. Theory Appl. Workshop, San Diego, CA, Feb. 6-10, 2006.
41. D. J. Costello, Jr., A. E. Pusane, C. R. Jones, and D. Divsalar, "A comparison of ARA- and protograph-based LDPC block and convolutional codes," in Proc. Inf. Theory Appl. Workshop, San Diego, CA, Jan. 29-Feb. 2 2007, pp. 111-119.
42. M. Lentmaier, D. V. Truhachev, and K. Sh. Zigangirov, "On the theory of low-density convolutional codes II," Probl. Inf. Transm. (Problemy Peredachy Informatsii), vol. 37, pp. 288-306, Oct.-Dec. 2001.
43. D. Divsalar, C. R. Jones, S. Dolinar, and J. Thorpe, "Protograph based LDPC codes with minimum distance linearly growing with block size," in Proc. IEEE Global Telecommun. Conf., St. Louis, MO, Nov. 28-Dec. 5 2005, vol. 3, DOI: 10.1109/GLOCOM.2005.1577834. (Pubitemid 46171310)
44. M. Ivkovic, S. K. Chilappagari, and B. Vasic, "Eliminating trapping sets in low-density parity-check codes by using Tanner graph covers," IEEE Trans. Inf. Theory, vol. 54, no. 8, pp. 3763-3768, Aug. 2008.
45. The Consultative Committee for Space Data Systems (CCSDS), "Low density parity check codes for use in near-earth and deep space applications," Experimental Specification CCSDS 131.1-O-2, Sep. 2007 [Online]. Available: http://public.ccsds.org/publications/ archive/131x1o2e2.pdf
46. M. Lentmaier, G. P. Fettweis, K. Sh. Zigangirov, and D. J. Costello, Jr., "Approaching capacity with asymptotically regular LDPC codes," in Proc. Inf. Theory Appl. Workshop, San Diego, CA, Feb. 8-13, 2009, pp. 173-177.
47. M. Lentmaier, D. G.M.Mitchell, G. P. Fettweis, and D. J. Costello, Jr., "Asymptotically regular LDPC codes with linear distance growth and thresholds close to capacity," in Proc. Inf. Theory Appl. Workshop, San Diego, CA, Jan. 31-Feb. 5 2010, DOI: 10.1109/ITA.2010.5454141.
48. S. Kudekar, T. Richardson, and R. Urbanke, "Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC," IEEE Trans. Inf. Theory, vol. 57, no. 2, Feb. 2011.
49. R. Smarandache and P. O. Vontobel, "Quasi-cyclic LDPC codes: Influence of proto- and Tanner-graph structure on minimum Hamming distance upper bounds," IEEE Trans. Inf. Theory Jan. 2009 [Online]. Available: http://arxiv.org/abs/0901.4129, submitted for publication
50. B. K. Butler and P. H. Siegel, "On distance properties of quasi-cyclic protograph-based LDPC codes," in Proc. IEEE Int. Symp. Inf. Theory, Austin, TX, Jun. 13-18, 2010, pp. 809-813.
51. M. Lentmaier, A. Sridharan, D. J. Costello, Jr., and K. S. Zigangirov, "Iterative decoding threshold analysis for LDPC convolutional codes," IEEE Trans. Inf. Theory, vol. 56, no. 10, pp. 5274-5289, Oct. 2010.
52. T. Tian, C. R. Jones, J. D. Villasenor, and R. D. Wesel, "Selective avoidance of cycles in irregular LDPC code construction," IEEE Trans. Commun., vol. 52, no. 8, pp. 1242-1247, Aug. 2004.
53. A. Ramamoorthy and R. D.Wesel, "Analysis of an algorithm for irregular LDPC code construction," in Proc. IEEE Int. Symp. Inf. Theory, Chicago, IL, Jun. 27-Jul. 2 2004, DOI: 10.1109/ISIT.2004.1365107.
54. J. Feldman, "Decoding error-correcting codes via linear programming," Ph.D. dissertation, Dept. Electr. Eng. Comput. Sci., Massachusetts Inst. Technol., Cambridge, MA, 2003.
55. J. Feldman, M. J. Wainwright, and D. R. Karger, "Using linear programming to decode binary linear codes," IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 954-972, Mar. 2005.
56. N. Axvig, D. Dreher, K. Morrison, E. Psota, L. C. Perez, and J. L. Walker, "Analysis of connections between pseudocodewords," IEEE Trans. Inf. Theory, vol. 55, no. 9, pp. 4099-4107, Sep. 2009.
57. C. A. Kelley and D. Sridhara, "Pseudocodewords of Tanner graphs," IEEE Trans. Inf. Theory, vol. 53, no. 11, pp. 4013-4038, Nov. 2007.
58. G. D. Forney, Jr., R. Koetter, F. Kschischang, and A. Reznik, "On the effective weights of pseudocodewords for codes defined on graphs with cycles," in Codes, Systems, and Graphical Models, B. Marcus and J. Rosenthal, Eds. New York: Springer-Verlag, 2001, vol. 123, pp. 101-112.