The Journal of Korean Institute of Communications and Information Sciences (한국통신학회논문지)

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

Estimating BP Decoding Performance of Moderate-Length Irregular LDPC Codes with Sphere Bounds

  • 정규혁 (단국대학교 공과대학 컴퓨터학부 컴퓨터공학)
  • Received : 2010.05.24
  • Accepted : 2010.07.13
  • Published : 2010.07.31
Download PDF
⟨ Previous Next ⟩

Abstract

This paper estimates belief-propagation (BP) decoding performance of moderate-length irregular low-density parity-check (LDPC) codes with sphere bounds. We note that for moderate-length($10^3{\leq}N{\leq}4\times10^3$) irregular LDPC codes, BP decoding performance, which is much worse than maximum likelihood (ML) decoding performance, is well matched with one of loose upper bounds, i.e., sphere bounds. We introduce the sphere bounding technique for particular codes, not average bounds. The sphere bounding estimation technique is validated by simulation results. It is also shown that sphere bounds and BP decoding performance of irregular LDPC codes are very close at bit-error-rates (BERs) $P_b$ of practical importance($10^{-5}{\leq}P_b{\leq}10^{-4}$).

Keywords

References

  1. R. Gallager, "Low density parity check codes," MIT press, 1963.
  2. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," Electronics Letters, Vol.33, March 1997, pp.457-458. https://doi.org/10.1049/el:19970362
  3. C. Berrou and A. Glavieux, "Near optimum error correcting coding and decoding: turbocodes," IEEE Trans. Commun., vol. 44, October 1996, pp.1261-1271. https://doi.org/10.1109/26.539767
  4. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding," IEEE Trans. Inform. Theory, May 1998, pp.909-926.
  5. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol. IT-20, March 1974, pp.284-287.
  6. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Mateo, CA: Morgan Kaufmann, 1988.
  7. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching low-density parity-check codes," IEEE Trans. Inform. Theory, Vol.47, Feb. 2001, pp.619-637. https://doi.org/10.1109/18.910578
  8. D. Divsalar, "A simple tight bound on error probability of block codes with application to turbo codes," TMO Progress Reports 42-139, Jet Propulsion Lab, November 1999.
  9. K. Chung and J. Heo, "Upper bounds for the performance of turbo-like codes and low density parity check codes," KICS Journal of Communications and Networks, Vol.10, No.1, March 2008, pp.5-9.