Advertisement

Finite Geometry Low Density Parity-Check Codes: Construction, Structure, and Decoding

  • S. Lin
  • Y. Kou
  • M. P. C. Fossorier
Part of the The Kluwer International Series in Engineering and Computer Science book series (SECS, volume 670)

Abstract

This paper present an algebraic and systematic method for constructing low density parity-check (LDPC) codes from a geometric point of view. LDPC codes are constructed based on the lines and points of a finite geometry. Two classes of LDPC codes are constructed based on the well known Euclidean and projective geometries over finite fields. Codes of these two classes are cyclic and they have good minimum distances and structural properties. They can be decoded in various ways and perform very well with the iterative decoding based on belief propagation (IDBP). These finite geometry LDPC codes can be extended and shortened in various ways. Extension by splitting columns of the parity-check matrices of these codes results in good extended finite geometry LDPC codes. Long extended finite geometry LDPC codes have been constructed and they achieve an error performance only a few tenths of a dB away from the Shannon limit with IDBP. Finite geometry LDPC codes are strong competitors to turbo codes for error control in communication and digital data storage systems.

Five different decoding algorithms are described in this paper and they range from low to high decoding complexity and from reasonably good to very good decoding performance.

Keywords

Error Performance LDPC Code Turbo Code Iterative Decode Incidence Vector 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    R. G. Gallager, “Low Density Parity-Check Codes,” IRE Transactions on Information Theory, IT-8, pp. 21–28, January 1962.MathSciNetCrossRefGoogle Scholar
  2. [2]
    R. G. Gallager, Low Density Parity-Check Codes, MIT Press, Cambridge, MA, 1963.Google Scholar
  3. [3]
    R. M. Tanner, “A Recursive Approach to Low Complexity Codes,” IEEE Transactions on Information Theory, IT-27, pp. 533–547, Sep. 1981.MathSciNetCrossRefGoogle Scholar
  4. [4]
    D. J. C. MacKay and R. M. Neal, “Near Shannon Limit Performance of Low Density Parity-Check Codes,” Electronics Letters, vol. 32 no. 18, pp. 1645–1646, 1996.CrossRefGoogle Scholar
  5. [5]
    M. Sipser and D. Spielman, “Expander Codes,” IEEE Transactions on Information Theory, vol. 42, no. 6, pp. 1710–1722, Nov. 1996.MathSciNetMATHCrossRefGoogle Scholar
  6. [6]
    D. Spielman, “Linear-time Encodable Error-correcting Codes,” IEEE Transactions on Information Theory, vol. 42, no. 6, pp. 1723–1731, Nov. 1996.MathSciNetMATHCrossRefGoogle Scholar
  7. [7]
    M. C. Davey and D. J. C. MacKay, “Low Density Parity Check Codes over GF(q),” IEEE Communications Letters, June 1998.Google Scholar
  8. [8]
    M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, “Improved Low-Density Parity-Check Codes Using Irregular Graphs and Belief Propagation,” Proceedings of 1998 IEEE International Symposium on Information Theory, p. 171, Cambridge, MA, Aug 1998.Google Scholar
  9. [9]
    D. J. C. Mackay, “Gallager Codes that are Better Than Turbo Codes,” Proceedings of the 36th Allerton Conference on Communication, Control, and Computing, Monticello, IL, Sep. 1998.Google Scholar
  10. [10]
    D. J. C. MacKay, “Good Error-Correcting Codes Based on Very Sparse Matrices,” IEEE Transactions on Information Theory, vol. IT-45, pp. 399–432, Mar. 1999.MathSciNetCrossRefGoogle Scholar
  11. [11]
    D. J. C. Mackay, “Sparce Graph Codes,” Proceedings of the 5th International Symposium on Communication Theory and Applications, Ambleside, UK, pp. 2–4, July 1999.Google Scholar
  12. [12]
    T. Richardson, A. Shokrollahi, and R. Urbanke, “Design of Capacity-Approaching Irregular Low-Density Parity-Check Codes,” IEEE Transactions on Information Theory, vol. IT-47, pp. 619–638, Feb. 2001.MathSciNetCrossRefGoogle Scholar
  13. [13]
    T. Richardson and R. Urbanke, “The Capacity of Low-Density Parity-Check Codes under Message-Passing Decoding,” IEEE Transactions on Information Theory, vol. IT-47, pp. 599–618, Feb. 2001.MathSciNetCrossRefGoogle Scholar
  14. [14]
    Y. Kou, S. Lin and M. Fossorier, “Low Density Parity-Check Codes based on Finite Geometries: A Rediscovery,” Proceedings of the IEEE International Symposium on Information Theory, Sorrento, Italy, June 2000.Google Scholar
  15. [15]
    S. Lin and Y. Kou, “A Geometric Approach to the Construction of Low Density Parity-Check Codes,” presented at the IEEE 29th Communication Theory Workshop, Haines City, FL, May 2000.Google Scholar
  16. [16]
    J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufmann, San Mateo, 1988.Google Scholar
  17. [17]
    S. L. Lauritzen and D. J. Spiegelhalter, “Local Computations with Probabilities on Graphical Structures and Their Application to Expert Systems,” Journal of the Royal Statistical Society B, vol 50, pp. 157–224, 1988.MathSciNetMATHGoogle Scholar
  18. [18]
    N. Wiberg, H.-A. Loeliger, and R. Kötter, “Codes and Iterative Decoding on General Graphs,” European Transactions on Telecommunications, vol. 6, pp. 513–526, 1955.CrossRefGoogle Scholar
  19. [19]
    R. J. McEliece, D. J. C. MacKay, and J.-F. Cheng, “Turbo Decoding as an Instance of Pearl’s Belief Propagation Algorithm,” IEEE Journal on Selected Areas, vol. 16, pp. 140–152, Feb. 1998.CrossRefGoogle Scholar
  20. [20]
    F. R. Kschischang and B. J. Frey, “Iterative Decoding of Compound Codes by Probability Propagation in General Models,” IEEE Journal on Selected Areas in Communications, vol. 16, no. 12, pp. 219–230, Feb. 1998.CrossRefGoogle Scholar
  21. [21]
    F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, “Factor Graphs and the Sum-Product Algorithm,” IEEE Transactions on Information Theory, vol. IT-47, pp. 498–519, Feb. 2001.MathSciNetCrossRefGoogle Scholar
  22. [22]
    M. Fossorier, M. Mihaljevic, and H. Imai, “Reduced Complexity Iterative Decoding of Low Density Parity-Check Codes,” IEEE Transactions on Communications, vol. 47, pp. 673–680, May 1999.CrossRefGoogle Scholar
  23. [23]
    R. Lucas, M. Fossorier, Y. Kou, and S. Lin, “Iterative Decoding of One-Step Majority Logic Decodable Codes Based on Belief Propagation,” accepted by IEEE Transactions on Communications, 1999.Google Scholar
  24. [24]
    C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon Limit Error-Correcting Coding and Decoding: Turbo Codes,” Proc. 1993 IEEE International Conference on Communications, Geneva, Switzerland, pp. 1064–1070, May 1993.Google Scholar
  25. [25]
    C. Berrou and A. Glavieux, “Near Optimum Error Correcting Coding and Decoding: Turbo-Codes,” IEEE Transactions on Communications, vol. 44, pp. 1261–1271, Oct. 1996.CrossRefGoogle Scholar
  26. [26]
    S. Benedetto and G. Montorsi, “Unveiling Turbo Codes: Some Results on Parallel Concatenated Coding Schemes,” IEEE Transactions on Information Theory, vol. 42, no. 2, pp. 409–428, Mar. 1996.MATHCrossRefGoogle Scholar
  27. [27]
    J. Hagenauer, E. Offer, and L. Papke, “Iterative Decoding of Binary Block and Convolutional Codes,” IEEE Transactions on Information Theory, vol. 42, pp. 429–445, Mar. 1996.MATHCrossRefGoogle Scholar
  28. [28]
    W. W. Peterson and E. J. Weldon, Jr., Error-Correcting Codes, 2nd ed., MIT Press, Cambridge, MA, 1972.MATHGoogle Scholar
  29. [29]
    S. Lin and D. J. Costello Jr., Error Control Coding: Fundamentals and Applications, Prentice Hall, Englewood Cliffs, NJ, 1983.Google Scholar
  30. [30]
    R. C. Bose and D. J. Ray-Chaudhuri, “On a Class of Error Correcting Binary Group Codes,” Information and Control, no. 3, pp 68–79, Mar. 1960.MathSciNetMATHCrossRefGoogle Scholar
  31. [31]
    E. R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, NY, 1968.MATHGoogle Scholar
  32. [32]
    J. L. Massey, Threshold Decoding, MIT Press, Cambridge, MA 1963.Google Scholar
  33. [33]
    N. Deo, Graph Theory with Applications to Engineering and Computer Science, Prentice Hall, Englewood Cliffs, NJ, 1974.MATHGoogle Scholar
  34. [34]
    N. Wiberg, “Codes and Decoding on General Graphs,” Ph.D Dissertation, Department of Electrical Engineering, University of Linköping, Linköping, Sweden, April 1996Google Scholar
  35. [35]
    Tuvi Etzion, Ari Trachtenberg, and A. Vardy, “Which Codes Have Cycle-Free Tanner Graphs,” IEEE Transactions on Information Theory, vol. 45, no. 6, pp. 2173–2181, Sep. 1999.MathSciNetMATHCrossRefGoogle Scholar
  36. [36]
    G. D. Forney, Jr., “Codes on Graphs: A Survey for Algebraists,” Proc. 13-th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Honolulu, HI, Nov. 1999.Google Scholar
  37. [37]
    G. D. Forney, Jr., “Codes on Graphs: Normal Realizations,” submitted to IEEE Transactions on Information Theory, 1998.Google Scholar
  38. [38]
    R. D. Carmichael, Introduction to the Theory of Groups of Finite Order, Dover Publications, Inc., New York, NY, 1956.MATHGoogle Scholar
  39. [39]
    A. P. Street and D. J. Street, Combinatorics of Experimental Design, Oxford Science Publications, Clarendon Press, Oxford, 1987.MATHGoogle Scholar
  40. [40]
    E. J. Weldon, Jr., “Euclidean Geometry Cyclic Codes,” Proceedings of the Symp. Combinatorial Math, University of North Carolina, Chapel Hill, NC, 1967.Google Scholar
  41. [41]
    T. Kasami, S. Lin, and W. W. Peterson, “Polynomial Codes,” IEEE Transactions on Information Theory, vol. 14, pp. 807–814, 1968.MathSciNetMATHCrossRefGoogle Scholar
  42. [42]
    S. Lin, “On a Class of Cyclic Codes,” Error Correcting Codes, (Edited by H. B. Mann), John Wiley & Sons, Inc., New York, 1968.Google Scholar
  43. [43]
    S. Lin, “On the Number of Information Symbols in Polynomial Codes,” IEEE Transactions on Information Theory, vol. IT-18, pp. 785–794, Nov. 1972.CrossRefGoogle Scholar
  44. [44]
    T. Kasami and S. Lin, “On Majority-Logic Decoding for Duals of Primitive Polynomial Codes,” IEEE Transactions on Information Theory, vol. IT-17, no. 3, pp. 322–331, May 1971.MathSciNetCrossRefGoogle Scholar
  45. [45]
    E. J. Weldon, Jr., “New Generations of the Reed-Muller Codes, Part II: Non-primitive Codes,” IEEE Transactions on Information Theory, vol. IT-14, pp. 199–205, May 1968.MathSciNetCrossRefGoogle Scholar
  46. [46]
    L. D. Rudolph, “A Class of Majority Logic Decodable Codes,” IEEE Transactions on Information Theory, vol. IT-13, pp. 305–307, April 1967.CrossRefGoogle Scholar
  47. [47]
    E. J. Weldon, Jr., “Difference-Set Cyclic Codes,” Bell System Technical Journal, vol. 45, pp. 1045–1055, Sep. 1966.MathSciNetMATHGoogle Scholar
  48. [48]
    F. L. Graham and J. MacWilliams, “On the Number of Parity-Checks in Difference-Set Cyclic Codes,” Bell System Technical Journal, vol. 45, pp. 1056–1070, Sep. 1966.MathSciNetGoogle Scholar
  49. [49]
    I. S. Rees, “A Class of Multiple-Error-Correcting Codes and the Decoding Scheme,” IRE Transactions, vol. IT-4, pp. 38–49, Sep. 1954.Google Scholar
  50. [50]
    V. D. Kolesnik, “Probability Decoding of Majority Codes,” Prob. Peredachi Inform, vol. 7, pp. 3–12, July 1971.MathSciNetMATHGoogle Scholar
  51. [51]
    L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate,” IEEE Transactions on Information Theory, vol. 20, pp. 284–287, Mar. 1974.MathSciNetMATHCrossRefGoogle Scholar
  52. [52]
    R. Lucas, M. Bossert, and M. Breitbach, “On Iterative Soft-Decision Decoding of Linear Block Codes and Product Codes,” IEEE Journal on Selected Areas in Communications, vol. 16, pp. 276–296, Feb. 1998.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • S. Lin
    • 1
  • Y. Kou
    • 1
  • M. P. C. Fossorier
    • 2
  1. 1.Department of Electrical and Computer EngineeringUniversity of California, DavisDavisUSA
  2. 2.Department of Electrical EngineeringUniversity of Hawaii at ManoaHonoluluHIUSA

Personalised recommendations