Quasi-cyclic LDPC codes: Influence of proto-and tanner-graph structure on minimum hamming distance upper bounds

IEEE Transactions on Information Theory

Volumn 58, Issue 2, 2012, Pages 585-607

  Smarandache, Roxana ^a   Vontobel, Pascal O ^b  

^a SAN DIEGO STATE UNIVERSITY   (United States)

^b HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Convolutional code; Girth; Graph cover; Low density parity check (LDPC) matrix; Proto graph; Proto matrix; Pseudo codeword; Quasi cyclic (QC) code; Tanner graph; Weight matrix

Indexed keywords

GIRTH; GRAPH COVER; LOW DENSITY PARITY CHECK; PROTO-GRAPH; PROTO-MATRIX; PSEUDO-CODEWORD; QUASICYCLIC CODES; TANNER GRAPHS; WEIGHT MATRICES;

CODING ERRORS; ERROR CORRECTION; GRAPHIC METHODS; HAMMING DISTANCE; MATRIX ALGEBRA;

CONVOLUTIONAL CODES;

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

References (45)

1. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: M.I.T. Press, 1963.
2. R. M. Tanner, "On quasi-cyclic repeat-accumulate codes," in Proc. 37th Allerton Conf. Commun., Contr., Comput., Monticello, IL, Sep. 22-24, 1999, pp. 249-259, Allerton House.
3. J. L. Fan, "Array codes as low-density parity-check codes," in Proc. 2nd Int. Symp. on Turbo Codes and Rel. Top., Brest, France, Sep. 4-7, 2000.
4. D. J. C. MacKay andM. C. Davey, "Evaluation of Gallager codes for short block length and high rate applications," in Codes, Systems, and Graphical Models (Minneapolis, MN, 1999), B. Marcus and J. Rosenthal, Eds. New York: Springer-Verlag, 2001, pp. 113-130.
5. M. P. C. Fossorier, "Quasi-cyclic low-density parity-check codes from circulant permutation matrices," IEEE Trans. Inf. Theory, vol. 50, no. 8, pp. 1788-1793, Aug. 2004.
6. O. Milenkovic, K. Prakash, and B. Vasic, "Regular and irregular low-density parity-check codes for iterative decoding based on cycle-invariant difference sets," in Proc. 41st Allerton Conf. on Commun., Contr., Comput., Monticello, IL, Oct. 1-3, 2003, Allerton House.
7. K. Lally and P. Fitzpatrick, "Algebraic structure of quasicyclic codes," Discr. Appl. Math., vol. 111, pp. 157-175, 2001.
8. R. Smarandache and P. O. Vontobel, "On regular quasi-cyclic LDPC codes from binomials," in Proc. IEEE Int. Symp. Inf. Theory, Chicago, IL, Jun. 27-Jul. 2 2004, p. 274.
9. J. Thorpe, Low-density parity-check (LDPC) codes constructed from protographs, JPL, IPN Progress Rep., Aug. 2003, vol. 42-154.
10. J. Thorpe, K. Andrews, and S. Dolinar, "Methodologies for designing LDPC codes using protographs and circulants," in Proc. IEEE Int. Symp. Inf. Theory, Chicago, IL, Jun. 27-Jul. 2 2004, p. 238.
11. R. M. Tanner, "A recursive approach to low-complexity codes," IEEE Trans. Inf. Theory, vol. 27, no. 5, pp. 533-547, Sep. 1981.
12. W. S. Massey, Algebraic Topology: An Introduction. New York: Springer-Verlag, 1977, reprint of the 1967 edition, Graduate Texts in Mathematics, Vol. 56.
13. H. M. Stark and A. A. Terras, "Zeta functions of finite graphs and coverings," Adv. in Math., vol. 121, no. 1, pp. 124-165, Jul. 1996.
14. Z. Li, L. Chen, L. Zeng, 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-78, Jan. 2006.
15. 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.
16. J. Feldman, "Decoding error-correcting codes via linear programming," Ph.D. dissertation, Dep. Elect. Eng. Comput. Sci., Mass. Inst. Technol., Cambridge, MA, 2003.
17. 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.
18. P. O. Vontobel and R. Koetter, "On low-complexity linear-programming decoding of LDPC codes," Eur. Trans. Telecomm., vol. 18, no. 5, pp. 509-517, Aug. 2007.
19. M. H. Taghavi N. and P. H. Siegel, "Adaptive methods for linear programming decoding," IEEE Trans. Inf. Theory, vol. 54, no. 12, pp. 5396-5410, Dec. 2008.
20. N. Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Dep. Elect. Eng., Linköping Univ., Linköping, Sweden, 1996.
21. G. D. Forney, Jr., R. Koetter, F. R. Kschischang, and A. Reznik, "On the effective weights of pseudocodewords for codes defined on graphs with cycles," in Codes, Systems, and Graphical Models (Minneapolis, MN, 1999), ser. IMA Vol. Math. Appl., B. Marcus and J. Rosenthal, Eds. New York: Springer-Verlag, 2001, vol. 123, pp. 101-112.
22. B. J. Frey, R. Koetter, and A. Vardy, "Signal-space characterization of iterative decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 766-781, Feb. 2001.
23. R. Koetter and P. O. Vontobel, "Graph covers and iterative decoding of finite-length codes," in Proc. 3rd Int. Symp. on Turbo Codes and Rel. Top., Brest, France, Sep. 1-5, 2003, pp. 75-82.
24. P. O.Vontobel and R.Koetter, "Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes," in CoRR, Dec. 2005 [Online]. Available: http://www.arxiv.org/abs/cs.IT/0512078
25. R. Koetter, W.-C. W. Li, P. O. Vontobel, and J. L. Walker, "Characterizations of pseudo-codewords of (low-density) parity-check codes," Adv. in Math., vol. 213, no. 1, pp. 205-229, Aug. 2007.
26. R. Smarandache and P. O. Vontobel, "Pseudo-codeword analysis of Tanner graphs from projective and Euclidean planes," IEEE Trans. Inf. Theory, vol. 53, no. 7, pp. 2376-2393, Jul. 2007.
27. C. A. Kelley and D. Sridhara, "Pseudocodewords of Tanner graphs," IEEE Trans. Inf. Theory, vol. 53, no. 11, pp. 4013-4038, Nov. 2007.
28. 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. UCSC-CRL-87-21, Nov. 1987.
29. Y. Levy and D. J. Costello, Jr., "An algebraic approach to constructing convolutional codes from quasi-cyclic codes," in Coding and Quantization, Providence, RI, 1993, vol. 14, pp. 189-198, DIMACS Ser. Discr. Math. Theoret. Comput. Sci..
30. 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.
31. R. Smarandache, A. E. Pusane, P. O. Vontobel, and D. J. Costello, Jr., "Pseudocodeword performance analysis for LDPC convolutional codes," IEEE Trans. Inf. Theory, vol. 55, no. 6, pp. 2577-2598, Jun. 2009.
32. A. E. Pusane, R. Smarandache, P. O. Vontobel, and D. J. Costello, Jr., "Deriving good LDPC convolutional codes from LDPC block codes," IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 835-857, Feb. 2011.
33. O. Y. Takeshita, "A new construction for LDPC codes using permutation polynomials over integer rings," in CoRR, Jun. 2005 [Online]. Available: http://arxiv.org/abs/cs.IT/0506091
34. W. Bosma, J. Cannon, and C. Playoust, "The Magma algebra system. I. The user language," J. Symbol. Comput., vol. 24, no. 3-4, pp. 235-265, 1997, Computational Algebra and Number Theory (London, 1993).
35. I. Bocharova,M. Handlery, R. Johannesson, and B. D. Kudryashov, "A BEAST for prowling in trees," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1295-1302, Jun. 2004.
36. R. M. Tanner, D. Sridhara, and T. Fuja, "A class of group-structured LDPC codes," in Proc. ICSTA 2001, Ambleside, U.K., 2001.
37. I. E. Bocharova, F. Hug, R. Johannesson, B. D. Kudryashov, and R. V. Satyukov, "Searching for voltage graph-based LDPC tailbiting codes with large girth," IEEE Trans. Inf. Theory [Online]. Available: http://arxiv.org/abs/1108.0840, submitted for publication
38. X. Wu, X. You, and C. Zhao, "An efficient girth-locating algorithm for quasi-cyclic LDPC codes," in Proc. IEEE Int. Symp. Inf. Theory, Seattle, WA, Jul. 9-14, 2006, pp. 817-820.
39. M. E.O'Sullivan, "Algebraic construction of sparsematrices with large girth," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 718-727, Feb. 2006.
40. M. J. Wainwright, "Codeword polytopes and linear programming relaxations for error-control coding," inWorkshop on Applications of Statistical Physics to Coding Theory, Santa Fe, NM, Jan. 11, 2005 [Online]. Available: http://cnls.lanl.gov/chertkov/EC-Talks/Wainwright
41. 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.
42. R. Smarandache and P. O. Vontobel, "Absdet-pseudo-codewords and perm-pseudo-codewords: Definitions and properties," in Proc. IEEE Int. Symp. Inf. Theory, Seoul, Korea, Jun. 28-Jul. 3 2009.
43. Y. Y. Tai, L. Lan, L. Zeng, S. Lin, and K. A. S. Abdel-Ghaffar, "Algebraic construction of quasi-cyclic LDPC codes for the AWGN and erasure channels," IEEE Trans. Commun., vol. 54, no. 10, pp. 1765-1773, Oct. 2006.
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. R. Asvadi, A. H. Banihashemi, and M. Ahmadian-Attari, "Lowering the error floor of LDPC codes using cyclic liftings," IEEE Trans. Inf. Theory, vol. 57, no. 4, pp. 2213-2224, Apr. 2011.