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

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

LDPC Codes' Upper Bounds over the Waterfall Signal-to-Noise Ratio (SNR) Region

  • 정규혁 (단국대학교 공과대학 컴퓨터학부 컴퓨터공학)
  • 발행 : 2008.11.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

This paper presents LDPC codes' upper bounds over the waterfall SNR region. The previous researches have focused on the average bound or ensemble bound over the whole SNR region and showed the performance differences for the fixed block size. In this paper, the particular LDPC codes' upper bounds for various block sizes are calculated over the waterfall SNR region and are compared with BP decoding performance. For different block sizes the performance degradation of BP decoding is shown.

키워드

참고문헌

  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
  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