Cyclic and Quasi-Cyclic LDPC codes on constrained parity-check matrices and their trapping sets

IEEE Transactions on Information Theory

Volumn 58, Issue 5, 2012, Pages 2648-2671

  Huang, Qin ^a   Diao, Qiuju ^b   Lin, Shu ^b   Abdel Ghaffar, Khaled ^b  

^a BEIHANG UNIVERSITY   (China)

^b Davis   (United States)

Author keywords

Circulant decomposition; cyclic code; finite geometry (FG) code; low density parity check (LDPC) code; orthogonal parity check sums; quasi cyclic (QC) code; row column (RC) constrained LDPC code; trapping set

Indexed keywords

CIRCULANTS; CYCLIC CODE; FINITE-GEOMETRY (FG) CODE; LDPC CODES; LOW-DENSITY PARITY-CHECK (LDPC) CODES; ORTHOGONAL PARITY-CHECK SUMS; QUASICYCLIC CODES; TRAPPING SET;

BLOCK CODES; DECODING; FORWARD ERROR CORRECTION;

ERROR CORRECTION;

EID: 84860254324     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2179842     Document Type: Conference Paper

References (84)

1. R. G. Gallager, "Low density parity-check codes," IRE Trans. Inf. Theory, vol. IT-8, no. 1, pp. 21-28, Jan. 1962.
2. 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, Aug. 1996.
3. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-432, Mar. 1999.
4. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
5. Y. Kou, S. Lin, and M. P. C. Fossorier, "Low density parity-check codes based on finite geometries: Arediscovery and newresults," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001.
6. S. Lin and D. J. Costello Jr., Error Control Coding: Fundamentals and Applications, 2nd ed. Upper Saddle River, NJ: Prentice-Hall, 2004.
7. H. Tang, J. Xu, S. Lin, and K. A. S. Abdel-Ghaffar, "Codes on finite geometries," IEEE Trans. Inf. Theory, vol. 51, no. 2, pp. 572-596, Feb. 2005.
8. J. Xu, L. Chen, I. Djurdjevic, S. Lin, and K. Abdel-Ghaffar, "Construction of regular and irregular LDPC codes: Geometry decomposition and masking," IEEE Trans. Inf. Theory, vol. 53, no. 1, pp. 121-134, Jan. 2007.
9. N. Kamiya, "High-rate quasi-cyclic low-density parity-check codes derived from finite affine planes," IEEE Trans. Inf. Theory, vol. 53, no. 4, pp. 1444-1459, Apr. 2007.
10. L. Chen, L. Lan, I. Djurdjevic, and S. Lin, "An algebraic method for construction quasi-cyclic LDPC codes," in Proc. Int. Symp. Inf. Theory Appl., Parma, Italy, Oct. 10-13, 2004, pp. 535-539.
11. L. Lan, L. Zeng, Y. Y. Tai, L. Chen, S. Lin, and K. Abdel-Ghaffar, "Construction of quasi-cyclic LDPC codes for AWGN and binary erasure channels: A finite field approach," IEEE Trans. Inf. Theory, vol. 53, no. 7, pp. 2429-2458, Jul. 2007.
12. J. Kang,Q.Huang, L. Zhang, B. Zhou, and S. Lin, "Quasi-cyclic LDPC codes: An algebraic construction," IEEE Trans. Commun., vol. 58, no. 5, pp. 1383-1396, May 2010.
13. L. Zhang, Q. Huang, S. Lin, and K. Abdel-Ghaffar, "Quasi-cyclic LDPC codes: An algebraic construction, rank analysis, and codes on Latin squares," IEEE Trans. Commun., vol. 58, no. 11, pp. 3126-3139, Nov. 2010.
14. L. Zhang, S. Lin, K. Abdel-Ghaffar, Z. Ding, and B. Zhou, "Quasicyclic LDPC codes on cyclic subgroups of finite fields," IEEE Trans. Commun., vol. 59, no. 9, pp. 2330-2336, Sep. 2011.
15. Z. Li, L. Chen, L. Zeng, S. Lin, andW. Fong, "Efficient encoding of quasi-cyclic low-density parity-check codes," IEEE Trans. Commun., vol. 54, no. 1, pp. 71-81, Jan. 2006.
16. N. Kamiya and E. Sasaki, "Efficient encoding of QC-LDPC codes related to cyclic MDS codes," IEEE J. Sel. Areas Commun., vol. 27, no. 6, pp. 846-854, Aug. 2009.
17. Y. Chen and K. Parhi, "Overlapped message passing for quasi-cyclic low-density parity check codes," IEEE Trans. Circuits Syst. I, vol. 51, no. 6, pp. 1106-1113, Jun. 2004.
18. Z. Wang and Z. Cui, "Low-complexity high-speed decoder design for quasi-cyclic LDPC codes," IEEE Trans. Very Large Scale Integr. Syst., vol. 15, no. 1, pp. 104-114, Jan. 2007.
19. T. Richardson, "Error floors of LDPC codes," in Proc. 41st Annu. Allerton Conf. Commun., Control Comp., Monticello, IL, Oct. 2003, pp. 1426-1435.
20. D. MacKay and M. S. Postol, "Weaknesses of Margulis and Ramanujan- Margulis low-density parity-check codes," Electron. Notes Theor. Comput. Sci., vol. 74, pp. 97-104, 2003.
21. W. E. Ryan and S. Lin, Channel Codes: Classical and Modern. Cambridge, U.K.: Cambridge Univ. Press, 2009.
22. S. Ländner and O. Milenkovic, "Algorithmic and combinatorial analysis of trapping sets in structured LDPC codes," in Proc. Int. Conf. Wireless Netw., Commun. Mobile Comput., Maui, HI, Jun. 2005, pp. 630-635.
23. W. W. Peterson and E. J. Weldon Jr., Error-Correcting Codes, 2nd ed. Cambridge, MA: MIT Press, 1972.
24. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw- Hill, 1964, (Revised edition, Laguna Hills, CA: Aegean Park Press, 1984.).
25. I. F. Blake and R. C. Mullin, The Mathematical Theory of Coding. New York: Academic, 1975.
26. R. E. Blahut, Theory and Practice of Error Control Codes. Reading, MA: Addison-Wesley, 1983.
27. R. M. Roth, Introduction to Coding Theory. Cambridge, U.K.: Cambridge Univ. Press, 2006.
28. S. Song, S. Lin, K. Abdel-Ghaffar, Z. Ding, W. H. Fong, and M. Fossorier, "Burst decoding of cyclic codes based on circulant parity-check matrices," IEEE Trans. Inf. Theory, vol. 56, no. 3, pp. 1038-1047, Mar. 2010.
29. Q. Huang, J. Kang, L. Zhang, S. Lin, and K. Abdel-Ghaffar, "Two efficient and low-complexity iterative reliability-based majority-logic decoding algorithms for LDPC codes," in Proc. Inf. Theory Appl. Workshop, San Diego, CA, Feb. 8-13, 2009, pp. 253-257.
30. Q. Huang, J. Kang, L. Zhang, S. Lin, and K. Abdel-Ghaffar, "Two reliability- based iterative majority-logic decoding algorithms for LDPC codes," IEEE Trans. Commun., vol. 57, no. 12, pp. 3597-3606, Dec. 2009.
31. R. D. Carmichael, Introduction to the Theory of Groups of Finite Orders. Boston, MA: Ginn & Co, 1937.
32. H. Mann, Analysis and Design of Experiments. New York, NY: Dover, 1949.
33. H. Marshall, Jr., Combinatorial Theory, 2nd ed. New York: Wiley, 1986.
34. R. Lidl and H. Niederreiter, Introduction to Finite Fields and their Applications, Revised ed. Cambridge, U.K.: Cambridge Univ. Press, 1994.
35. T. Kasami, S. Lin, and W. W. Peterson, "Polynomial codes," IEEE Trans. Inf. Theory, vol. 13, no. 6, pp. 807-814, Nov. 1968.
36. S. Lin, "On a class of cyclic codes," in Error Correcting Codes, H. Mann, Ed. New York: Wiley, 1968, ch. 7.
37. T. Kasami and S. Lin, "On majority-logic decoding for duals of primitive polynomial codes," IEEE Trans. Inf. Theory, vol. IT-17, no. 3, pp. 322-331, May 1971.
38. S. Lin, "On the number of information symbols in polynomial codes," IEEE Trans. Inf. Theory, vol. IT-18, no. 6, pp. 785-794, Nov. 1972.
39. K. J. C. Smith, Majority Decodable Codes Derived From Finite Geometries, ser. Inst. Statist. Mimeo Series, 561. Chapel Hill, NC: Univ. North Carolina, 1967.
40. J. Chen and M. P. C. Fossorier, "Density evolution for two improved BP-based decoding algorithms of LDPC codes," IEEE Commun. Lett., vol. 6, no. 5, pp. 208-210, May 2002.
41. J. Zhang and M. P. C. Fossorier, "A modified weighted bit-flipping decoding for low-density parity-check codes," IEEE Commun. Lett., vol. 9, no. 3, pp. 165-167, Mar. 2004.
42. M. Jiang, C. Zhao, Z. Shi, and Y. Chen, "An improvement on the modified weighted bit-flipping decoding algorithm for LDPC codes," IEEE Commun. Lett., vol. 9, no. 9, pp. 814-816, Sep. 2005.
43. T. Richardson, M. A. Shokrollahi, and R. Urbanke, "Design of capacity- approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
44. European Standard, (Telecommunications Series): Digital Video Broadcasting (DVB); Second generation framing structure, channel coding and modulation systems for broadcasting, interactive services, news gathering and other broadband satellite applications, ETSI EN 302 307 V1.1.2 (2006-06).
45. H. Jin, A. Khandekar, and R. McEliece, "Irregular repeat-accumulate codes," in Proc. 2nd. Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 4, 2000, pp. 1-8.
46. Low Density Parity Check Code for Rate 7/8, NASA Goddard Technical Standard, Sep. 2005 [Online]. Available: http://standards.gsfc. nasa.gov/gsfc-std/gsfc-std-9100a.doc
47. S. Sankaranarayanan, S. K. Chilappagari, R. Radhakrishnan, and B. Vasic, "Failures of the Gallager B decoder: Analysis and applications," in Proc. Inf. Theory Appl. Workshop, San Diego, CA, Feb. 6-10, 2006.
48. S. K. Chilappagari, S. Sankaranarayanan, and B. Vasic, "Error floors of LDPC codes on binary symmetric channel," in Proc. IEEE Int. Conf. Commun., Istanbul, Turkey, Jun. 11-15, 2006, vol. 3, pp. 1089-1094.
49. C.A. Cole, S. G. Wilson, E.K.Hall, and T. R. Giallorenzi, "A general method for finding low error-rates of LDPC codes," , May 2006 [Online]. Available: http://arxiv.org/pdf/cs/0605051v1.pdf
50. M. Stepanov and M. Chertkov, "Instanton analysis of low-density parity-check codes in error-floor regime," in Proc. IEEE Int. Symp. Inf. Theory, Seattle, WA, Jul. 9-14, 2006, pp. 552-556.
51. Z. Zhang, L. Dolecek, B. Nikolic, V. Anantharam, and M.Wainwright, "Investigation of error floors of structured low-density parity-check codes by hardware emulation," in Proc. IEEE Global Telecommun. Conf., San Francisco, CA, Nov. 1, 2006, pp. 1-6.
52. O. Milenkovic, E. Soljanin, and P. Whiting, "Asymptotic spectra of trapping sets in regular and irregular LDPC codes ensembles," IEEE Trans. Inf. Theory, vol. 53, no. 1, pp. 39-55, Jan. 2007.
53. S. Ländner and O. Milenkovic, "LDPC codes based on Latin squares: Cycle structure, stopping set, and trapping set analysis," IEEE Trans. Commun., vol. 55, no. 2, pp. 303-307, Feb. 2007.
54. A. McGregor and O. Milenkovic, "On the hardness of approximating stopping and trapping sets in LDPC codes," in Proc. IEEE Inf. Theory Workshop, Lake Tahoe, CA, Sep. 2-6, 2007, pp. 248-253.
55. M. Ivkovic, S. K. Chilappagari, and B.Vasic, "Designing LDPC codes without small trapping sets by using Tanner graph covers," in Proc. IEEE Int. Symp. Inf. Theory, Nice, France, Jun. 24-29, 2007, pp. 2266-2270.
56. L. Dolecek, Z. Zhang, V. Anantharam,M.Wainwright, and B. Nikolic, "Analysis of absorbing sets for array-based LDPC codes," in Int. Conf. Commun., Glasgow, Scotland, Jun. 24-28, 2007, pp. 6261-6268.
57. S. Abu-Surra, W. E. Ryan, and D. Divsalar, "Ensemble trapping set enumerators for protograph-based LDPC codes," presented at the 45th Annu. Conf. Commun., Control, Comput., Monticello, IL, Sep. 2007.
58. S. Abu-Surra, W. E. Ryan, and D. Divsalar, "Asymptotic ensemble enumerators for protograph-based generalized LDPC codes: Computational complexity," in Proc. Inf. Theory Appl. Workshop, San Diego, CA, Jan. 27-Feb. 1 2008, pp. 63-65.
59. M. Hirotomo, Y. Konishi, and M. Morii, "Approximate examination of trapping sets of LDPC codes using the probabilistic algorithm," presented at the Int. Symp. Inf. Theory Appl., Auckland, New Zealand, Dec. 7-10, 2008.
60. 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.
61. J. Kang, L. Zhang, Z. Ding, and S. Lin, "A two-stage iterative decoding of LDPC codes for lowering error floors," in Proc. IEEE Global Telecommun. Conf., New Orleans, LA, Nov. 30-Dec. 4 2008, pp. 1-4.
62. Z. Zhang, L. Dolecek, B. Nikolic, V. Anantharam, and M. J. Wainwright, "Lowering LDPC error floors by postprocessing," in Proc. IEEE Global Telecommun. Conf., New Orleans, LA, Nov.-Dec. 30-Dec. 4, 2008, pp. 1-6.
63. D. G. M. Michell, A. E. Pusane, and D. J. Costello Jr., "Asymptotic trapping set analysis of regular protograph-based LDPC convolutional code ensembles," in Proc. Inf. Theory Appl.Workshop, San Diego, CA, Feb. 8-13, 2009, pp. 264-271.
64. Y. Han and W. E. Ryan, "Low-floor decoder for LDPC codes," IEEE Trans. Commun., vol. 57, no. 6, pp. 1663-1673, Jun. 2009.
65. E. Pusane, D. J. Costello, and D. G.M. Mitchell, "Trapping set analysis of protograph-based LDPC convolutional codes," in Proc. IEEE Int. Symp. Inf. Theory, Seoul, Korea, Jun. 28-Jul. 3 2009, pp. 561-565.
66. Y. F. Zhang and W. E. Ryan, "Toward low LDPC-code floors: A case study," IEEE Trans. Commun., vol. 57, no. 6, pp. 1566-1573, Jun. 2009.
67. E. Cavus, C. L. Haymes, and B. Daneshrad, "Low BER performance estimation of LDPC codes via application of importance sampling to trapping sets," IEEE Trans. Commun., vol. 57, no. 7, pp. 1886-1888, Jul. 2009.
68. B. Vasic, S. K. Chilappagari, D.V. Nguyen, and S.K. Planjery, "Trapping set ontology," presented at the 47th Annu. Conf. Commun, Control, Comput., Allerton, IL, Sep. 30-Oct. 2 2009.
69. Z. Zhang, L. Dolecek, B. Nikolic, V. Anantharam, and M. J. Wainwright, "Design of LDPC decoders for improved low error rate performance: Quantization and algorithm choices," IEEE Trans. Commun., vol. 57, no. 11, pp. 3258-3268, Nov. 2009.
70. L. Dolecek, Z. Zhang, V. Anantharam, M. J. Wainwright, and B. Nikolic, "Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes," IEEE Trans. Inf. Theory, vol. 56, no. 1, pp. 181-201, Jan. 2010.
71. S. Abu-Surra, D. Declercq, D. Divsalar, and W. E. Ryan, "Trapping set enumerators for specific LDPC codes," in Proc. Inf. Theory Appl. Workshop, San Diego, CA, Jan. 31-Feb. 5 2010, pp. 1-5.
72. S. K. Chilappagari, D. V. Nguyen, B. Vasic, and M. W. Marcellin, "On trapping sets and guaranteed error correction capability of LDPC codes and GLDPC codes," IEEE Trans. Inf. Theory, vol. 56, no. 4, pp. 1600-1611, Apr. 2010.
73. H. Yang and W. E. Ryan, "Low-floor detection/decoding of LDPCcoded partial response channels," IEEE J. Sel. Areas Commun., vol. 28, no. 2, pp. 252-260, Feb. 2010.
74. D. V. Nyuyen, B. Vasic, M. Marcellin, and S. K. Chilappagari, "Structured LDPC codes from permutation matrices free of small trapping sets," in Proc. IEEE Inf. Theory Workshop, Dublin, Ireland, Aug. 30-Sep. 3, 2010, pp. 1-5.
75. J. Kang, Q. Huang, S. Lin, and K. Abdel-Ghaffar, "An iterative decoding algorithm with backtracking to lower the error-floors of LDPC codes," IEEE Trans. Commun., vol. 59, no. 1, pp. 64-73, Jan. 2011.
76. M. Karimi and A. Banihashemi, "An efficient algorithm for finding dominant trapping sets of LDPC codes," presented at the IEEE Int. Symp. Inf. Theory, Saint Petersburg, Russia, Jul. 31-Aug. 5 2011.
77. I. Djurdjevic, J. Xu, K. Abdel-Ghaffar, and S. Lin, "A class of lowdensity parity-check codes constructed based on Reed-Solomon codes with two information symbols," IEEE Commun. Lett., vol. 7, no. 7, pp. 317-319, Jul. 2003.
78. Y. Y. Tai, L. Lan, L. Zheng, S. Lin, and K. Abdel-Ghaffar, "Algebraic construction of quasi-cyclic LDPC codes for the AWGN and erasure channels," IEEE Trans. Commun., vol. 54, no. 7, pp. 1765-1774, Oct. 2006.
79. S. Song, B. Zhou, S. Lin, and K. Abdel-Ghaffar, "A unified approach to the construction of binary and nonbinary quasi-cyclic LDPC codes based on finite fields," IEEE Trans. Commun., vol. 57, no. 1, pp. 84-93, Jan. 2009.
80. S. Johnson and S. R. Weller, "Regular low-density parity-check codes from combinatorial designs," presented at the IEEE Inform. Theory Workshop, Cairns, Australia, Sep. 2-7, 2001, pp. 90-92.
81. S. J. Johnson and S. R. Weller, "Construction of low-density parity-check codes from Kirkman triple systems," in Proc. IEEE Global Telecommun. Conf., San Antonio, TX, Nov. 25-29, 2001, pp. 970-974.
82. B. Vasic and O. Milenkovic, "Combinatorial construction of low-density parity-check codes for iterative decoding," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1156-1176, Jun. 2004.
83. B. Ammar, B. Honary, Y. Kou, J. Xu, and S. Lin, "Construction of low-density parity-check codes based on balanced incomplete block designs," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1257-1568, Jun. 2004.
84. L. Lan, Y. Y. Tai, S. Lin, B. Memari, and B.Honary, "New construction of quasi-cyclic LDPC codes based on special classes of BIBDs for the AWGN and binary erasure channels," IEEE Trans. Commun., vol. 56, no. 1, pp. 39-48, Jan. 2008.