Construction of regular and irregular LDPC codes: Geometry decomposition and masking

IEEE Transactions on Information Theory

Volumn 53, Issue 1, 2007, Pages 121-134

  Xu, Jun ^a   Chen, Lei ^b   Djurdjevic, Ivana ^c   Lin, Shu ^d   Abdel Ghaffar, Khaled ^d  

^a MARVELL SEMICONDUCTOR INC   (United States)

^b Legend Silicon Corp   (United States)

^c SAN JOSE RESEARCH CENTER   (United States)

^d Davis   (United States)

Author keywords

Degree distribution; Euclidean geometry; Geometry decomposition; Masking; Permutation matrix

Indexed keywords

ALGEBRA; CODES (SYMBOLS); GEOMETRY; MATRIX ALGEBRA; NUMERICAL METHODS; RANDOM PROCESSES;

DEGREE DISTRIBUTION; EUCLIDEAN GEOMETRY; GEOMETRY DECOMPOSITION; LOW-DENSITY PARITY-CHECK (LDPC) CODES; MASKING; PERMUTATION MATRIX;

INFORMATION THEORY;

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

References (67)

1. R. G. Gallager, "Low-density parity-check codes," IRE Trans. In. Theory, vol. IT-8, no. 1, pp. 21-28, Jan. 1962.
2. M. Sipser and D. Spielman, "Expander codes," IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1710-1722, Nov. 1996.
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, Aug. 1996.
4. 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.
5. 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.
6. 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.
7. S. Y. Chung, G. D. Forney, T. 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, no. 2, pp. 58-60, Feb. 2001.
8. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
9. N. Wiberg, H.-A. Loeliger, and R. Kötter, "Codes and iterative decoding on general graphs," Europ. Trans. Telecommun., vol. 6, pp. 513-525, Sep./Oct. 1995.
10. N. Wiberg, "Codes and Decoding on General Graphs," Ph.D. dissertation, Dept. Elec. Engr., Univ. Linköping, Linköping, Sweden, Apr. 1996.
11. R. J. McEliece, D. J. C. MacKay, and J.-F. Cheng, "Turbo decoding as an instance of Pearl's belief propagation algorithms," IEEE J. Select. Areas Commun., vol. 16, no. 2, pp. 140-152, Feb. 1998.
12. S. Y. Chung, T. J. Richardson, and R. L. Urbanke, "Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 657-670, Feb. 2001.
13. 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.
14. R. Lucas, M. Fossorier, Y. Kou, and S. Lin, "Iterative decoding of one-step majority-logic decodable codes based on belief propagation," IEEE Trans. Commun., vol. 48, no. 6, pp. 931-937, Jun. 2000.
15. Y. Kou, S. Lin, and M. Fossorier, "Low density parity check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001.
16. L. Ping, W. K. Leung, and N. Phamdo, "Lowdensity parity check codes with semi-random parity check matrix," IEE Electron. Lett., vol. 35, pp. 38-39, Jan. 1999.
17. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. Spielman, "Improved designs using irregular graphs," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
18. A. Ventura and M. Chiani, "Design and evaluation of some high-rate irregular low-density parity-check codes," Proc. IEEE GlobeCom, vol. 2, pp. 990-994, Nov. 2001.
19. X.-Y. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 386-398, Jan. 2005.
20. I. Djurdjevic, S. Lin, and K. Abdel-Ghaffar, "Graph-theoretic construction of low density parity check codes," IEEE Commun. Lett., vol. 7, no. 4, pp. 171-173, Apr. 2003.
21. M. Yang, W. E. Ryan, and Y. Li, "Design of efficiently-encodable moderate-length high-rate irregular LDPC codes," IEEE Trans. Commun., vol. 52, no. 4, pp. 564-571, Apr. 2004.
22. L. Lan, Y. Y. Tai, L. Chen, S. Lin, and K. Abdel-Ghaffar, "A trellis-based method for removing cycles from bipartite graphs and construction of low density parity check codes," IEEE Commun. Lett., vol. 8, no. 7, pp. 443-445, Jul. 2004.
23. Y. Kou, S. Lin, and M. Fossorier, "Construction of low density parity check codes: A geometric approach," in Proc. 2nd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2000, pp. 137-140.
24. Y. Kou, S. Lin, and M. P. C. Fossorier, "Low density parity check codes: Construction based on finite geometries," in Proc. IEEE GlobeCom, San Francisco, CA, Nov./Dec. 2000, vol. 2, pp. 825-829.
25. J. L. Fan, "Array codes as low-density parity-check codes," in Proc. 2nd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2000, pp. 543-546.
26. R. M. Tanner, "Spectral graphs for quasicyclic LDPC codes," in Proc. IEEE Int. Symp. Information Theory, Washington, DC, Jun. 2001, p. 226.
27. R. M. Tanner, D. Sridhara, and T. Fuja, "A class of group-structured LDPC codes," in Proc. 6th Int. Symp. Communication Theory and Applications, Ambleside, U.K., Jul. 2001, pp. 365-370.
28. P. O. Vontobel and R. M. Tanner, "Construction of codes based on finite generalized quadrangles for iterative decoding," in Proc. IEEE Int. Symp. Information Theory, Washington, DC, Jun. 2001, p. 223.
29. J. Rosenthal and P. O.Vontobel, "Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from Margulis," in Proc. IEEE Int. Symp. Information Theory, Washington, DC, Jun. 2001, p. 4.
30. H. Tang, Y. Kou, J. Xu, S. Lin, and K. Abdel-Ghaffar, "Codes on finite geometries: Old, new, majority-logic and iterative decodings," in Proc. 6th Int. Symp. Communication Theory and Applications, Ambleside, U.K., Jul. 2001, pp. 381-386.
31. S. Lin, H. Tang, and Y. Kou, "On a class of finite geometry low density parity check codes," in Proc. IEEE Int. Symp. Information Theory, Washington, DC, Jun. 2001, p. 24.
32. S. J. Johnson and S. R. Weller, "Regular low-density parity-check codes from combinatorial designs," in Proc. IEEE Information Theory Workshop, Cairns, Australia, Sep. 2001, pp. 90-92.
33. B. Vasic, "High-rate low-density parity-check codes based on anti-Pasch affine geometries," in Proc. IEEE Int. Conf. Communications, New York, Apr./May 2002, vol. 3, pp. 1332-1336.
34. E. Eleftheriou and S. Ölcer, "Low-density parity-check codes for digital subscriber lines," in Proc. IEEE Int. Conf. Communications, New York, Apr./May 2002, vol. 3, pp. 1752-1757.
35. B. Vasic and O. Milenkovic, "Combinatorial constructions of low-density parity-check codes for iterative decoding," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1156-1176, Jun. 2004.
36. B. Ammar, B. Honary, Y. Kou, and S. Lin, "Construction of low density parity check codes: A combinatoric design approach," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, Jun/Jul. 2002, p. 311.
37. H. Tang, J. Xu, S. Lin, and K. Abdel-Ghaffar, "Codes on finite geometries," IEEE Trans. Inf. Theory, vol. 51, no. 2, pp. 572-596, Feb. 2005.
38. B. Vasic, B. Kurtas, and A. Kuznetsov, "LDPC codes based on mutually orthogonal Latin rectangles and their application in perpendicular magnetic recording," IEEE Trans. Magn., vol. 38, no. 5, pt. I, pp. 2346-2348, Sep. 2002.
39. Y. Kou, J. Xu, H. Tang, S. Lin, and K. Abdel-Ghaffar, "On circulant low density parity check codes," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, Jun./Jul. 2002, p. 200.
40. S. Lin, J. Xu, I. Djurdjevic, and H. Tang, "Hybrid construction of LDPC codes," in Proc. 40th Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2002, pp. 1149-1158.
41. J. Kim, U. N. Peled, I. Perepelitsa, and V. Pless, "Explicit construction of families of LDPC codes with girth at least six," in Proc. 40th Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2002, pp. 1024-1031.
42. S. J. Johnson and S. R. Weller, "A family of irregular LDPC codes with low encoding complexity," IEEE Commun. Lett., vol. 7, no. 2, pp. 79-81, Feb. 2003.
43. I. Djurdjevic, J. Xu, K. Abdel-Ghaffar, and S. Lin, "Construction of low-density parity-check codes based on Reed-Solomon codes with two information symbols," IEEE Commun. Lett., vol. 7, no. 7, pp. 317-319, Jul. 2003.
44. J. Xu and S. Lin, "A combinatoric superposition method for constructing low density parity check codes," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 30.
45. W. Matsumoto and H. Imai, "Irregular low-density parity-check code design based on integer lattices," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 3.
46. A. Sridharan, D. Sridhara, D. J. Costello, Jr., and T. E. Fuja, "A construction for irregular low density parity check convolutional codes," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 4.
47. N. Kamiya and M. Fossorier, "Quasicyclic codes from a finite affine plane," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 57.
48. R. Omrani, H.-F. Lu, O. Moreno, and P. V. Kumar, "Construction of low-density parity check codes from optical orthogonal codes," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 60.
49. M. Fossorier, "Quasicyclic low density parity check codes," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 150.
50. L. Chen, I. Djurdjevic, J. Xu, S. Lin, and K. Abdel-Ghaffar, "Construction of quasicyclic LDPC codes based on the minimum weight code-words of Reed-Solomon codes," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 239.
51. L. Chen, J. Xu, I. Djurdjevic, and S. Lin, "Near Shannon limit quasicyclic low-density parity-check codes," IEEE Trans. Commun., vol. 52, no. 7, pp. 1038-1042, Jul. 2004.
52. H. Tang, J. Xu, Y. Kou, S. Lin, and K. Abdel-Ghaffar, "On algebraic construction of Gallager and circulant low density parity check codes," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1269-1279, Jun. 2004.
53. 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-1268, Jun. 2004.
54. S. J. Johnson and S. R. Weller, "Codes for iteratively decoding from partial geometries," IEEE Trans. Commun., vol. 52, no. 2, pp. 236-243, Feb. 2004.
55. Z.-W. Li, L. Chen, L.-Q. Zeng, S. Lin, and W. Fong, "Efficient encoding of quasicyclic low-density parity-check codes," IEEE Trans. Commun., vol. 54, no. 1, pp. 71-81, Jan. 2006.
56. S. Lin and D. J. Costello, Jr., Error Control Coding: Fundamentals and Applications, 2nd ed. Upper Saddle River, NJ: Prentice-Hall, 2004.
57. T. Etzion, A. Trachtenberg, and A. Vardy, "Which codes have cycle-free Tanner graphs?," IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 2173-2181, Sep. 1999.
58. W. W. Peterson and E. J. Weldon, Jr., Error Correcting Codes, 2nd ed. Cambridge, MA: MIT Press, 1972.
59. R. D. Carmichael, Introduction to the Theory of Groups of Finite Order. New York: Dover, 1956.
60. H. B. Mann, Analysis and Design of Experiments. New York: Dover, 1949.
61. I. Blake and R. C. Mullin, The Mathematical Theory of Coding. New York: Academic, 1975.
62. C. J. Colbourn and H. J. Dinitz, The CRC Handbook of Combinatorial Designs. Boca Raton, FL: CRC, 1996.
63. H. Tang, "Codes on Finite Geometries," Ph.D. dissertation, Dept. Elec. Comp. Eng, Univ.California, Davis, 2002.
64. J. L. Massey, Threshold Decoding. Cambridge, MA: MIT Press, 1963.
65. Z. Liu and D. A. Pados, "Low complexity decoding of finite geometry LDPC codes," in Proc. IEEE Int. Conf. Communications, Anchorage, AK, May 2003, vol. 4, pp. 2713-2717.
66. M. Shan, C. Zhao, and M. Jiang, "An improved weighted bit-flipping algorithm for decoding LDPC codes," Proc. IEE-Commun., vol. 152, no. 6, pp. 919-922, Dec. 2005.
67. T. J. Richardson, "Error floors of LDPC codes," in Proc. 41st Allerton Conf. Communications, Control and Computing, Monticello, IL, Oct. 2003, pp. 1426-1435.