Regular and irregular progressive edge-growth tanner graphs

IEEE Transactions on Information Theory

Volumn 51, Issue 1, 2005, Pages 386-398

  Hu, Xiao Yu ^a   Eleftheriou, Evangelos ^a   Arnold, Dieter M ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

Girth; LDPC codes over GF(q); Low density parity check (LDPC) codes; PEG Tanner graphs; Progressive edge growth (PEG)

Indexed keywords

ALGORITHMS; BIT ERROR RATE; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; ENCODING (SYMBOLS); GRAPH THEORY; SIGNAL TO NOISE RATIO;

LOW DENSITY PARITY CHECK (LDPC) CODES; PROGRESSIVE EDGE GROWTH (PEG) ALGORITHMS; TANNER GRAPHS;

CODES (SYMBOLS);

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

References (56)

1. R.M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 6, pp. 533-547, Sep. 1981.
2. N. Wiberg, H.-A. Loeliger, and R. Kötter, "Codes and iterative decoding on general graphs," Europ. Trans. Telecommun., vol. 6, pp. 513-526, Sep. 1995.
3. M. Sipser and D. A. Spielman, "Expander codes," IEEE Trans. Inf. Theory, vol. 42. no. 6, pp. 1710-1722. Nov. 1996.
4. N. Alon and M. Luby, "A linear-time erasure-resilient code with nearly optimal recovery," IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1732-1736, Nov. 1996.
5. R. J. McEliece, D. J. C. MacKay, and J.-F. Cheng, "Turbo decoding as an instance of Pearl's belief propagation algorithm," IEEE J. Sel. Areas Commun., vol. 16, pp. 140-152, Feb. 1998.
6. F.R. Kschischang and B. J. Frey, "Iterative decoding of compound codes by probability propagation in graphical models," IEEE J. Selected Areas Commun., vol. 16, no. 2, pp. 219-230, Feb. 1998.
7. R. Kötter and A. Vardy, "Factor graphs: Construction, classification, and bounds," in Proc. 1998 IEEE Int. Symp Information Theory, Cambridge, MA, Aug. 1998, p. 14.
8. 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.
9. A. R. Calderbank, G. D. Forney, and A. Vardy, "Minimal tail-biting trellises: The Golay code and more," IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1435-1455, Jul. 1999.
10. Y. Weiss, "Correctness of local probability propagation in graphical models with loops," Neural Computat., vol. 12, pp. 1-41, 2000.
11. S.M. Aji and R. J. McEliece, "The generalized distributive law," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 325-343, Mar. 2000.
12. G. D. Forney, "Codes on graphs: News and views," in Proc. 2nd Int. Symp. Turbo Codes & Related Topics, Brest, France, Sep. 2000, pp. 9-16.
13. "Special issue on codes and graphs and iterative algorithms," IEEE Trans. Inf. Theory, vol. 47, no. 2, Feb. 2001.
14. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963, Monograph.
15. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo codes," in Proc. 1993 IEEE Int. Conf. Communication, Geneva, Switzerland, May 1993, pp. 1064-1070.
16. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
17. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, " Analysis of low-density codes and improved designs using irregular graphs," in Proc. 30th ACM STOC, Dallas, TX, 1998, pp. 249-258.
18. T. Richardson and R. 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.
19. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of provably good low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
20. S.-Y. Chung, G. D. Forney, Jr., T. J. 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.
21. C. Di, D. Proietti, I. E. Telatar, T. Richardson, and R. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inf. Theory, vol. 48. no. 6, pp. 1570-1579, Jun. 2002.
22. Y. Kou. S. Lin, and M. P. C. 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. Y. Kou., S. Lin Fossorier M.P.C.
23. R. M. Tanner, D. Sridhara, and T. Fuja, "A class of group-structured LDPC codes," in Proc. ICSTA 2001. Ambleside, UK, 2001.
24. J. L. Fan, "Array codes as low-density parity-check codes," in Proc. 2nd Int. Symp. Turbo Codes & Related Topics, Brest, France, Sep. 2000, pp. 543-546.
25. B. Vasić, "Combinatorial constructions of structured low-density parity-check codes for iterative decoding," manuscript, submitted for publication.
26. 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.
27. G. A. Margulis, "Explicit constructions of graphs without short cycles and low density codes," Combinatorica, vol. 2, no. 1, pp. 71-78, 1982.
28. G. A. Margulis, "Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators," Probl. Inf. Transm., vol. 24, no. 1, pp. 39-46, Jan.-March 1988. Translated from Probl. Pered. Inf., vol. 24, no. 1, pp. 51-60, Jan.-Mar. 1988.
29. A. Lubotzky, R. Phillips, and P. Sarnak, "Ramanujan graphs," Combinatorica, vol. 8, no. 3, pp. 261-277, 1988.
30. P. Erdös and H. Sachs, "Reguläre Graphen gegebener Taillenweite mit minimaler Knotenzahl," Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Naturwiss. Reine, vol. 12, pp. 251-257, 1963.
31. J. Rosenthal and P. O. Vontobel, "Construction of LDPC codes using Ramanujan graphs and ideas from Margulis," in Proc. 38th Annu. Allerton Conf. Communication, Computing and Control, Monticello, IL, Oct. 2000, pp. 248-257.
32. P. O. Vontobel and R. M. Tanner, "Construction of codes based on finite generalized quadrangles for iterative decoding," in Proc. IEEE Intl. Symp. Information Theory, Washington, DC, Jun. 2001, p. 223.
33. L. Bazzi, T. Richardson, and R. Urbanke, "Exact thresholds and optimal codes for the binary symmetric channel and Gallager's decoding algorithm A," IEEE Trans. Inf. Theory, vol. 50, no. 9, pp. 2010-2021, Sep. 2004.
34. M. A. Shokrollahi, "New sequence of linear rime erasure codes approaching the channel capacity," in Proc. 13th Int. Symp. Applied Algebra, Algebraic Algorithm and Error-Correcting Codes, 1999, pp. 65-76.
35. G. Richter, "Construction of completely regular LDPC codes with large girth," in Proc. ETH Zurich 2003 Winter School on Coding and Information Theory, Ascona, Switzerland, Feb. 2003. Available [Online] at http://www.isi.ee.ethz.ch/winterschool/docs/richter.pdf.
36. X.-Y. Hu, E. Eleftheriou, and D.-M. Arnold, "Progressive edge-growth Tanner graphs," in Proc. IEEE Global Telecommunications Conf. (GLOBECOM), San Antonio, TX, Nov. 2001. CD Proceedings, paper no. 0-7803-7208-5/01.
37. X.-Y. Hu, E. Eleftheriou and D.-M. Arnold, "Irregular progressive edge-growth Tanner graphs," in Proc. IEEE Intl. Symp. Information Theory, Lausanne, Switzerland, Jun./Jul. 2002, p. 480.
38. J. Campello, D. S. Modha, and S. Rajagopalan, "Designing LDPCcodes using bit-filling," in Proc. IEEE Int. Conf Communications, Helsinki, Finland, Jun. 2001, pp. 55-59.
39. X.-Y. Hu, "Low-delay low-complexity error-correcting codes on sparse graphs," Ph.D. dissertation, Swiss Federal Institute of Technology Lausanne (EPFL), Lausanne, Switzerland, 2002.
40. T. Tian, C. Jones, J. D. Vilasenor, and R. D. Wesel, "Construction of irregular LDPC codes with low error floors," in Proc. IEEE Int. Conf. Communications, vol. 5, Anchorage, AK, May 2003, pp. 3125-3129.
41. H. Xiao and A. H. Banihashemi, "Improved progressive-edge-growth (PEG) construction of irregular LDPC codes," IEEE Commun. Lett., to be published.
42. M.R. Yazdani and A. H. Banihashemi, "On construction of rate-compatible low-density parity-check codes," IEEE Commn. Lett., vol. 8, no. 3, pp. 159-161, Mar. 2004.
43. R. M. Tanner, "Minimum distance bounds by graph analysis," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 808-821, Feb. 2001.
44. M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman, and V. Stemann, "Practical loss-resilient codes," in Proc. 29th ACM Symp. Theory of Computing, El Paso, TX, May 1997, pp. 150-159.
45. D. Spielman, "Linear-time encodeable and decodable error-correcting codes," IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1723-1731, Nov. 1996.
46. D.J.C. MacKay, S. T. Wilson, and M. C. Davey, "Comparison of construction of irregular Gallager codes," IEEE Trans. Commun., vol. 47, no. 10. pp. 1449-1454, Oct. 1999.
47. L. Ping, W. K. Leung, and N. Phamdo, "Low density parity check codes with semi-random parity check matrix," IEE Electron. Lett., vol. 35, pp. 38-39, Jan. 1999.
48. H. Jin. A. Khandekar, and R. J. McEliece, "Irregular repeat-accumulate codes," in Proc. 2nd Int. Symp. Turbo Codes & Related Topics, Brest, France, Sep. 2000, pp. 1-8.
49. T. Richardson and R. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inf Theory, vol. 47, no. 2, pp. 638-656, Feb. 2001.
50. D.J.C. MacKay. Online Database of Low-Density Parity-Check Codes. Online. Available: http://wol.ra.phy.cam.uk/mackay/codes/data.html
51. Y. Mao and A. Banihashemi, "A heuristic search for good low-density parity-check codes at short block lengths," in Proc. Int. Conf. Communications, vol. 1, Helsinki, Finland, Jun. 2001, pp. 41-44.
52. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, "Improved low-density parity-check codes and using irregular graphs and belief propagation," in Proc. 1998 IEEE Int. Symp. Information Theory, Cambridge, MA, Aug. 1998, p. 117.
53. M. C. Davey, "Error-correction using low-density parity-check codes," Ph.D. dissertation. Univ. Cambridge, Cambridge, U.K., 1999.
54. M. C. Davey and D. MacKay, "Low-density parity-check codes over GF (q)," IEEE Commun. Lett., vol. 2, no. 6, pp. 165-167, Jun. 1998.
55. C. Schlegel and L. Perez, "On error bounds and turbo-codes," IEEE Commun. Lett., vol. 3, pp. 205-207, Jul. 1999.
56. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.