Construction of Short-Length High-Rates LDPC Codes Using Difference Families

Authors

Deny Hamdani, Communication Technology Institute, University of Dortmund, Otto-Hahn-Str. 4, 44221 Dortmund, GermanyFollow
Ery Safrianti, Communication Engineering Laboratory, University of Riau, Pekanbaru 28293, IndonesiaFollow

Abstract

Low-density parity-check (LDPC) code is linear-block error-correcting code defined by sparse parity-check matrix. It is decoded using the massage-passing algorithm, and in many cases, capable of outperforming turbo code. This paper presents a class of low-density parity-check (LDPC) codes showing good performance with low encoding complexity. The code is constructed using difference families from combinatorial design. The resulting code, which is designed to have short code length and high code rate, can be encoded with low complexity due to its quasi-cyclic structure, and performs well when it is iteratively decoded with the sum-product algorithm. These properties of LDPC code are quite suitable for applications in future wireless local area network.

References

1. Gallager, R.G. Low-density parity check codes. 1962. IRE Trans. Inform. Theory, IT-8: 21-28.
2. Berrou, C., Glavieux, A., Thitimajshirna, P. Near Shannon limit error correcting coding and decoding: Turbo codes. 1993. in Proceeding of International Conference on Communications. Geneva, Switzerland: 1064-1070.
3. MacKay, D.J.C., and Neal, R.M. 1995. Good codes based on very sparse matrices. in Colin Boyd, Ed Cryptography and Coding: Proceeding of 5th IMA Conference, Lecture Notes in Computer Science No.1025. Springer-Verlag, Berlin, p. 100-111.
4. Chung, S.-Y., Richardson, T., Urbanke, R. 2001.On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit. IEEE Communications Letters, vol.5 no.2: 58-60.
5. Gallager, R. G. 1963. Low-Density Parity Check Codes. Ph.D dissertation. MIT Press, Cambridge, USA.
6. Luby, M., Mitzenmacher, M., Shokrollahi, M.,Spielman, D. 2001. Efficient erasure correcting codes. IEEE Trans. Inform. Theory, 47: 569-584.
7. Vasic, B., Milenkovic, O. 2004. Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding, accepted for publication in IEEE Transactions on Information Theory.
8. R.L. Townsend and E. Weldon. 1967. Selforthogonal quasi-cyclic codes. IEEE Trans. Inform. Theory, vol. IT-13, 2: 183-195.
9. R.M. Tanner. 1981. A Recursive Approach to Low Complexity Codes. IEEE Trans. Inform. Theory, vol. IT-27, 5: 533-547.
10. Johnson, S.J., Weller, S.R. 2002. Quasi-cyclic LDPC codes from difference families. In Proceeding 3rd AusCTW, Canberra, Australia.

Recommended Citation

Hamdani, Deny and Safrianti, Ery (2007) "Construction of Short-Length High-Rates LDPC Codes Using Difference Families," Makara Journal of Technology: Vol. 11: Iss. 1, Article 5.
DOI: 10.7454/mst.v11i1.438
Available at: https://scholarhub.ui.ac.id/mjt/vol11/iss1/5