Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

Design of Non-Binary Quasi-Cyclic LDPC Codes Based on Multiplicative Groups and Euclidean Geometries

  • Jiang, Xueqin (Department of Communications and Electronic Engineering, Donghua University) ;
  • Lee, Moon-Ho (Department of Communications and Electronic Engineering of Electronics, Chonbuk National University)
  • Received : 2009.04.13
  • Accepted : 2009.12.18
  • Published : 2010.10.31
Download PDF
⟨ Previous Next ⟩

Abstract

This paper presents an approach to the construction of non-binary quasi-cyclic (QC) low-density parity-check (LDPC) codes based on multiplicative groups over one Galois field GF(q) and Euclidean geometries over another Galois field GF($2^S$). Codes of this class are shown to be regular with girth $6{\leq}g{\leq}18$ and have low densities. Finally, simulation results show that the proposed codes perform very wel with the iterative decoding.

Keywords

References

  1. R. G. Gallager, "Low density parity check codes," IRE Trans. Inf. Theory, IT-8, pp. 21-88, Jan. 1962.
  2. M. Davey and D. MacKay, "Low density parity check codes over GF(q)," IEEE Commun. Lett., vol. 2, no. 6, pp. 165-167, June 1998. https://doi.org/10.1109/4234.681360
  3. M. E. O'Sullivan, J. Brevik, and R. Wolski, "The performance of LDPC codes with large girth," in Proc. 43rd Ann. Allerton Conf. Commun., Control, and Computing, Monticello, IL, Sept. 2005.
  4. M. E. O'Sullivan "Algebraic construction of sparse matrices with large girth," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp, 718-727, Feb. 2006. https://doi.org/10.1109/TIT.2005.862120
  5. B. Zhou, J. Kang, Y. Y. Tai, Q. Huang, and S. Lin, "High performance nonbinary quasi-cyclic LDPC codes on Euclidean geometries," in Proc. IEEE MILCOM, Orlando, Florida, Oct. 29-31, 2007, pp. 1-8.
  6. X. Jiang, C. Huang, Y. Guo, and M. Lee, "Non-binary LDPC codes design based on Euclidean geometries," in Proc. IEEE ICITA, pp. 452-456, Queensland, Australia, June 23-26, 2008.
  7. S. Lin and D. J. Costello, Jr., Error Control coding: Fundamentals and Applications, 2nd ed. Englewood Cliffs, NJ: USA, Prentice-Hall, 2004.
  8. M. P. C. Fossorier, "Quasi-cyclic low-density parity-check codes from circulant permutation matrices," IEEE Trans. Inf. Theory, vol. 50, no. 8, pp. 1788-1793, Aug. 2004. https://doi.org/10.1109/TIT.2004.831841
  9. S. Myung, K. Yang, and J. Kim, "Quasi-cyclic LDPC codes for fast encoding," IEEE Trans. Inf. Theory, vol. 51, no. 8, pp. 2894-2901, Aug. 2005. https://doi.org/10.1109/TIT.2005.851753
  10. L. Barnault and D. Declercq, "Fast decoding algorithm for LDPC over GF($2^q$)," in Proc. ITW, Paris, France, Mar. 31-Apr. 4, 2003, pp. 70-73.
  11. D. Declercq and M. Fossorier, "Decoding algorithms for nonbinary LDPC codes over GF(q)," IEEE Trans. Commun., vol. 55, no. 4, pp. 633-643, Apr. 2007. https://doi.org/10.1109/TCOMM.2007.894088
  12. C. E. Shannon, R. G. Gallager, and E. R. Berlekamp, "Lower bounds to error probability for coding on discrete memoryless channels," Inf. Contr., pt. I, vol. 10, no. 1, pp. 65-103, Feb. 1967. https://doi.org/10.1016/S0019-9958(67)90052-6