Browse > Article

Improved Performance Decoding for LDPC Codes with a Large Number of Short Cycles  

Chung, Kyu-Hyuk (단국대학교 정보컴퓨터학부 컴퓨터과학)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.33, no.2C, 2008 , pp. 173-177 More about this Journal
Abstract
In this paper, we improve performance of Low Density Parity Check (LDPC) codes with adding a large number of short cycles. Short cycles, especially cycles of length 4, degrade performance of LDPC codes if the standard BP (Belief Propagation) decoding is used. Therefore current researches have focused on removing cycles of length 4 for designing good performance LDPC codes. We found that a large number of cycles of length 4 improve performance of LDPC codes if a modified BP decoding is used. We present the modified BP decoding algorithm for LDPC codes with a large number of short cycles. We show that the modified BP decoding performance of LDPC codes with a large number of short cycles is better than the standard BP decoding performance of LDPC codes designed by avoiding short cycles.
Keywords
LDPC 부호;신뢰 전파 복호;짧은 주기;이분 그래프;패리티 검사;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. Y. Chung, G. D. Forney, T. J. Richardson, and R. L. Urbanke, "On the design of low-density parity-check codes within 0.0045 db of the shannon limit," Communication letters, vol. 5, pp. 58-60, February 2001   DOI   ScienceOn
2 D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," Electronic Letters, vol. 33, pp. 457-458, March 1997   DOI   ScienceOn
3 C. Berrou and A. Glavieux, "Near optimum error correcting coding and decoding: turbo-codes," IEEE Trans. Commun., vol. 44, pp. 1261-1271, October 1996   DOI   ScienceOn
4 R. Gallager, "Low density parity check codes," MIT press, 1963
5 M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547. September 1981