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

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

On the Design of Block Lengths for Irregular LDPC Codes Based on the Maximum Variable Degree

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

초록

This paper presents the design of block lengths for irregular low-density parity-check (LDPC) codes based on the maximum variable degree $d_{{\upsilon},max}$. To design a block length, the performance degradation of belief-propagation (BP) decoding performance from upper bounds on the maximum likelihood (ML) decoding performance is used as an important factor. Since for large block lengths, the performance of irregular LDPC codes is very close to the Shannon limit, we focus on moderate block lengths ($5{\times}10^2\;{\leq}\;N\;{\leq}\;4{\times}10^3$). Given degree distributions, the purpose of our paper is to find proper block lengths based on the maximum variable degree $d_{{\upsilon},max}$. We also present some simulation results which show how a block length can be optimized.

키워드

참고문헌

  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. 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
  4. 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
  5. 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.
  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.