The Journal of the Korea institute of electronic communication sciences (한국전자통신학회논문지)

Korea Institute of Electronic Communication Science (한국전자통신학회)
권호 표지
DOI QR코드

DOI QR Code

An Optimized Algorithm for Constructing LDPC Code with Good Performance

고성능 LDPC 코드를 생성하기 위한 최적화된 알고리듬

  • 서희종 (전남대학교 전자통신공학과)
  • Received : 2013.06.10
  • Accepted : 2013.08.23
  • Published : 2013.08.30
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, an algorithm having new edge growth with depth constraints for constructing Tanner graph of LDPC(Low density parity check) codes is proposed. This algorithm reduces effectively the number of small stoping set in the graph and has lower complexity than other algorithm. The simulation results shows the improved performance of the LDPC codes constructed by this algorithm.

본 논문에서, 성능 좋은 LDPC(Low density parity check) 코드을 위한 태너(Tanner) 그래프를 생성하는 알고리듬을 제안한다. 이 알고리듬은 뎁스 컨스트렌트(depth constraints)를 유지하면서 태너 그래프의 새로운 가지를 생성한다. 이 알고리듬은 그래프의 스토핑 �V(stopping set)을 효과적으로 줄이고, 기존의 다른 알고리듬 보다도 낮은 계산복잡도를 갖는다. 모의시험을 통해서 이 알고리듬의 개선된 성능을 확인 할 수 있었다.

Keywords

References

  1. Robert G. Gallager, "Low-density parity-check codes," MIT Press, Cambridge, Mass., 1963.
  2. D. M. Arnold, E. Eleftheriou, and X. Y. Hu, "Progressive edge-growth Tanner graphs," in Proc. IEEE Global Telecommunications Conf., Vol. 2, San Antonio, TX, pp. 995-1001, 2001.
  3. T. Tian, C. Jones, J. D. Villasenor, and R. D. Wesel, "Selective avoidance of cycles in Irregular LDPC code Construction," IEEE Trans. Comm., Vol. 52, pp. 1242-1247, 2004. https://doi.org/10.1109/TCOMM.2004.833048
  4. Hua Xiao, Amir H. Banihashemi, "Improved Progressive-Edge-Growth(PEG) Construction of Irregular LDPC Codes," IEEE Communications Letters, Vol. 8, 2004.
  5. Sung-Hua Kim, Joon-Sung Kim, Dae-Son Kim, "LDPC code Construction with Low Error Floor Based on the IPEG Algorithm," IEEE, Communications Letters, Vol. 11, 2007.
  6. C. Di, D. Proietti, "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, 2002. https://doi.org/10.1109/TIT.2002.1003839
  7. T. Tian, C. R. Jones, "Construction of irregular LDPC codes with low error floors," in Proc. IEEE Int. Conf. Comm, Vol. 5, pp. 3125-3129, 2003.
  8. T, Richardson, A. Shokrollahi, R. Urbanke, "Design of capacity approaching irregular low density parity check codes," IEEE Trans, Information Theory, Vol. 47, pp. 619-637, 2001. https://doi.org/10.1109/18.910578
  9. Hao Chen, H. Suh "An improved Bellman- Ford algorithm based on SPFA", The Journal of The Korea Institute of Electronic Communication Sciences, Vol. 7, No. 4, pp. 721-726, 2012.
  10. Yanji Liu, H. Suh " A Comparison of Raptor Code Using LDGM and LDPC code", The Journal of The Korea Institute of Electronic Communication Sciences, Vol. 8, No. 1, pp. 65-70, 2013. https://doi.org/10.13067/JKIECS.2013.8.1.065
  11. Binbin Hu, H. Suh, "Node monitoring algorithm with piecewise linear function approximation for efficient LDPC decoding", The Journal of The Korea Institute of Electronic Communication Sciences, Vol. 6, No. 1, pp. 20-26, 2011.