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

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

Upper Bounds of Maximum Likelihood (ML) Decoding Performance of a few Irregular LDPC Codes

몇 개의 불규칙한 LDPC 부호의 Maximum Likelihood(ML) 복호에 대한 성능의 상향 한계와 정점 성능 감쇠 분석

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

Abstract

This paper presents upper bounds of Maximum Likelihood (ML) decoding performance of a few irregular LDPC codes using the simple bound and ML input output weight distributions and it is shown that contrary to general opinion that as block length becomes longer, BP decoding performance becomes simply closer to ML decoding performance, before peak degradation, as block length becomes longer, BP decoding performance falls behind ML decoding performance more and after peak degradation, general opinion holds.

본 논문에서는 기존의 단순 한계와 Maximum Likelihood (ML) 추정 입력 출력 무게 분포를 사용하여 몇 개의 불규칙한 LDPC 부호의 ML 복호에 대한 성능의 상향 한계를 구하고 부호의 길이가 길어지면 Belief-Propagation (BP) 복호의 성능이 ML 복호 성능에 단순하게 근접해 간다는 일반적인 견해와는 상반되게 정점 성능 감쇠(Peak Degradation)에 다다르기 이전에는 부호의 길이가 길어지면 오히려 BP 복호의 성능이 ML 복호 성능으로부터 성능 감쇠 폭이 증가하고 정점 성능 감쇠를 지난 후에 일반적인 견해가 적용되는 것을 보인다.

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: turbo-codes,' 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 https://doi.org/10.1109/ISIT.1997.613021
  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. 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
  7. 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 https://doi.org/10.1109/JCN.2008.6388322
  8. 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