Structured low-density parity-check codes

IEEE Signal Processing Magazine

Volumn 21, Issue 1, 2004, Pages 42-55

  Moura, José M F ^a   Lu, Jin ^a   Zhang, Haotian ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIT ERROR RATE; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; DECODING; GRAPH THEORY; MATRIX ALGEBRA; TURBO CODES;

BIPARTITE GRAPHS; GALLAGER CODES; LOW DENSITY PARITY CHECK CODES; TANNER GRAPHS;

BLOCK CODES;

EID: 85032752045     PISSN: 10535888     EISSN: None     Source Type: Journal    
DOI: 10.1109/MSP.2004.1267048     Document Type: Article

References (46)

1. R.G. Gallager, Low-Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
2. G. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding: Turbo codes," in Proc. 1993 Int. Conf. Comm., Geneva, Switzerland, May 1993, pp. 1064-1070.
3. D.J.C. Mackay and R.M. Neal, "Good codes based on very sparse matrices," in Cryptography and Coding, 5th IMA Conference (Lecture Notes in Computer Science), C. Boyd, Ed. 1995, vol. 1025, pp. 110-111.
4. C.E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., pp. 372-423, 623-656, 1948.
5. E.A. Lee and D.G. Messerschmitt, Digital Communication. Boston/Dordrecht/London: Kluwer, 1994.
6. S.G. Wilson, Digital Modulation and Coding. Englewood Cliffs, NJ: Prentice Hall, 1996.
7. T.J. Richardson, M.A. Shokrollahi, and R.L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
8. R.M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, no. 5, pp. 533-547, Sept. 1981.
9. F.R. Kschischang, B.J. Frey, and H.A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
10. H. Song and B.V.K.V. Kumar, "Low density parity check codes for partial response channels," IEEE Signal Processing Mag., vol. 21, no. 1, pp. 56-66, Jan 2004.
11. F.R. Kschischang and B.J. Frey, "Iterative decoding of compound codes by probability propagation in graphical models," IEEE J. Select. Areas Commun., vol. 16, no. 2, pp. 219-230, Feb. 1998.
12. T. Etzion, A. Trachtenberg, and A. Vardy, "Which codes have cycle-free Tanner graphs?," IEEE Trans. Inform. Theory, vol. 45, no. 6, pp. 2173-2181, Sept. 1999.
13. R.J. McEliece, D.J.C. Mackay, and J.F. Cheng, "Turbo decoding as an instance of Pearl's "belief propagation" algorithm," IEEE J. Select. Areas Commun., vol. 16, no. 2, pp. 140-152, Feb. 1998.
14. J. Campello, D.S. Modha, and S. Rajagopalan, "Designing LDPC codes using bit-filling," in Proc. ICC 2001, Helsinki, Finland, June 2001, vol. 1, pp. 55-59.
15. J. Campello and D.S. Modha, "Extended bit-filling and LDPC code design," in IEEE Globecom 2001, San Antonio, TX, Nov. 2001, vol. 2, pp. 985-989.
16. Y. Mao and A.H. Banihashemi, "A heuristic search for good LDPC codes at short block lengths," in Proc. ICC 2001, Helsinki, Finland, June 2001, vol. 1, pp. 41-44.
17. Yu Kou, Shu Lin, and M.P.C. Fossorier, "Low-density parity-check codes based on finite geometries: a rediscovery and new results," IEEE Trans. Inform. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001.
18. Y. Kou, S. Lin, and M.P.C. Fossorier, "Low density parity check codes: Construction based on finite geometries," in Proc. IEEE Globecom 2000, San Francisco, CA, Nov. 2000, vol. 2, pp. 825-829.
19. W.T. Fishback, Projective and Euclidean Geometry. New York/London/Sydney/Toronto: Wiley, 1969.
20. S. Lin and D.J. Costello Jr., Error Control Coding: Fundamentals and Applications. Englewood Cliffs, NJ: Prentice Hall, 1983.
21. L.M. Batten, Combinatorics of Finite Geometries. Cambridge, UK: Cambridge Univ. Press, 1986.
22. D.J.C. Mackay and M.C. Davey, "Evaluation of Gallager codes for short block length and high rate applications," in Codes, Systems and Graphical Models; IMA Volumes in Mathematics and Its Applications, B. Marcus and J. Rosenthal, Eds. New York: Springer-Verlag, 2000, vol. 123, pp. 113-130.
23. S.J. Johnson and S.R. Weller, "Regular low-density parity-check codes from combinatorial design," in Proc. Inf. Tech. Workshop (ITW) 2001, Cairns, Australia, Sept. 2001.
24. S.J. Johnson and S.R. Weller, "Construction of low-density parity-check codes from Kirkman triple systems," in Proc. IEEE Globecom 2001, San Antonio, TX, Nov. 2001, vol. 2, pp. 970-74.
25. B. Vasic, "Structured iteratively decodable codes based on Steiner systems and their application in magnetic recording," in Proc. IEEE Globecom 2001, San Antonio, TX, Nov. 2001, vol. 5, pp. 2954-2960.
26. B. Vasic, E.M. Kurtas, and A.V. Kuznetsov, "LDPC codes based on mutually orthogonal Latin rectangles and their application in perpendicular magnetic recording," IEEE Trans. Magnetics, vol. 38, no. 5, pp. 2346-2348, Sept. 2002.
27. B. Vasic, "High-rate low-density parity check codes based on anti-Pasch affine geometries," in Proc. ICC 2002, Washington, DC, Apr. 28-May 2 2002, vol. 3, pp. 1332-1336.
28. B. Vasic, E.M. Kurtas, and A.V. Kuznetsov, "Kirkman systems and their application in perpendicular magnetic recording," IEEE Trans. Magn., vol. 38, no. 4, pp. 1705-1710, July 2002.
29. J.H. Dinitz and D.R. Stinson, "A brief introduction to design theory," in Contemporary Design Theory: A Collection of Surveys, J.H. Dinitz and D.R. Stinson, Eds. New York: wiley, 1992, chap. 1, pp. 1-12.
30. C.C. Lindner and C.A. Rodger, Design Theory. Boca Raton, London, New York, Washington, DC: CRC, 1997.
31. H.J. Ryser, Combinatorial Mathematics. Washington, DC: Mathematical Assoc. America, 1963.
32. D.R. Stinson, R. Wei, and L. Zhu, "New constructions for perfect hash families and related structures using combinatorial designs and codes," J. Combinatorial Designs, vol. 8, p. 189-200, 2000.
33. A.C. Ling, C.J. Colbourn, M.J. Grannell, and T.S. Griggs, "Construction techniques for anti-Pasch Steiner triple systems," J. London Math. Society, vol. 61, no. 43, pp. 641-657, June 2000.
34. G.A. Margulis, "Explicit constructions of graphs without short cycles and low density codes," Combinatorica, vol. 2, no. 1, pp. 71-78, 1982.
35. A. Lubotzky, R. Phillips, and P. Sarnak, "Ramanujan graphs," Combinatorica, vol. 8, no. 3, pp. 261-277, 1988.
36. J. Rosenthal and P.O. Vontobel, "Constructions of LDPC codes using Ramanujan graphs and ideas from Margulis," in Proc. 38th Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2000, pp. 248-257.
37. R.M. Tanner, D. Srikdhara, and T. Fuja, "A class of group-structured ldpc codes," in The Proc. ISTA, Ambleside, England, 2001.
38. X.Y. Hu, E. Eleftheriou, and D.M. Arnold, "Progressive edge-growth tanner graphs," in Proc. IEEE GLOBECOM, San Antonio, TX, Nov. 2001.
39. H. Zhang and J.M.F. Moura, "Large-girth LDPC codes based on graphical models," in Proc. IEEE Signal Processing and Wireless Communications (SPAWC) Workshop, Rome, Italy, June 2003.
40. H. Zhang and J.M.F. Moura, "Structured regular LDPC codes with large girth," in IEEE Globecom 2003, San Francisco, CA, Dec 2003.
41. H. Song, "Iterative soft detection and decoding for data storage channels," Ph.D. dissertation, Dept. of Elec. Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, 2003.
42. J. Lu and J.M.F. Moura, "Turbo like decoding of LDPC codes," in Proc. IEEE INTERMAG 2003, Boston, MA, Apr. 2003.
43. J. Lu and J.M.F. Moura, "Turbo design for LDPC codes with large girth," in Proc. IEEE Signal Processing and Wireless Communications (SPAWC) Workshop, Rome, Italy, June 2003.
44. L. Ping and K.Y. Wu, "Concatenated tree codes: A low-complexity, high-performance approach," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 791-799, Feb. 2001.
45. H. Behairy and S.-C. Chang, "Parallel concatenated Gallager codes for CDMA applications," in IEEE Globecom 2001, San Antonio, TX, Nov. 2001, vol. 2, pp. 1002-1006.
46. D.J.C. Mackay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.