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

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

Analysis of Bounding Performance for LDPC codes and Turbo-Like Codes

LDPC 코드와 터보 코드의 성능 상향 한계 분석

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

Abstract

We present upper bounds for the maximum-likelihood decoding performance of particular LDPC codes and turbo-like codes with particular interleavers. Previous research developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption, which bound the performance averaged over all ensemble codes or all interleavers. Proposed upper bounds are based on the simple bound and estimated weight distributions including the exact several smallest distance terms because if either estimated weight distributions on their own or the exact several smallest distance terms only are used, an accurate bound can not be obtained.

본 논문은 특정한 LDPC 코드와 특정한 인터리버를 가진 터보 코드의 맥시멈 라이클리후드(maximum-likelihood) 디코딩 성능의 상향 한계를 보인다. 현재까지의 연구는 균등 인터리버의 가정을 하거나 또는 앙상블 코드를 사용하여 LDPC 코드와 터보 코드의 성능 상향 한계를 계산하였다. 이러한 성능 상향 한계는 모든 코드 또는 모든 인터리버에 대한 평균 성능만을 표시하게 된다. 제안된 성능 상향 한계는 단순 한계(simple bound)와 정확한 짧은 거리의 항들을 포함하는 추정된 무게 분포를 기초하고 있다. 만약 둘 중에 하나만 사용하게 되면 정확한 성능 상향 한계를 얻을 수 가 없다.

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,' Electronic Letters, vol. 33, pp. 457-458, March 1997 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, pp. 1261-1271, October 1996 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, pp. 909-926, May 1998 https://doi.org/10.1109/18.669119
  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, pp. 284-287, March 1974
  6. N. Wiberg, Codes and Decoding on General Graphs(Ph.D. Thesis). PhD thesis, Linkoping University(Sweden), 1996
  7. D. Divsalar and F. Pollara, 'Turbo codes for deep-space communications,' TDA Progress Rep., vol. 42-120, pp. 29-39, February 1995
  8. S. Benedetto and G. Montorsi, 'Design of parallel concatenated convolutional codes,' IEEE Trans. Commun., pp. 591-600, May 1996
  9. S. Benedetto and G. Montorsi, 'Unveiling turbo codes: some results on parallel concatenated coding schemes,' IEEE Trans. Inform. Theory, vol. 42, pp. 408-428, March 1996
  10. T. J. Richardson and R. L. Urbanke, 'The capacity of low-density parity-check codes under message-passing decoding,' IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, February 2001 https://doi.org/10.1109/18.910577
  11. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, 'Design of capacity-approaching irregular low-density paritycheck codes,' IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, February 2001 https://doi.org/10.1109/18.910578
  12. S. Y. Chung, T. J. Richardson, and R. L. Urbanke, 'Analyisis of sum-product decoding of low-density parity-check codes using a gaussian approximation,' IEEE Trans. Inform. Theory, vol. 47, pp. 657-670, February 2001 https://doi.org/10.1109/18.910580
  13. 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 https://doi.org/10.1109/4234.905935
  14. T. M. Duman and M. Salehi, 'New performance bounds for turbo codes,' IEEE Trans. Commun., vol. 46, pp. 565-567, May 1998 https://doi.org/10.1109/26.668715
  15. T. M. Duman and M. Salehi, 'Performance bounds for turbo-coded modulation systems,' IEEE Trans. Commun., vol. 47, pp. 511-521, April 1999 https://doi.org/10.1109/26.764924
  16. G. Poltyrev, 'Bounds on the decoding error probability of binary linear codes via their spectra,' IEEE Trans. Inform. Theory, vol. 40, pp. 1284-1292, July 1994 https://doi.org/10.1109/18.335935
  17. I. Sason and S. Shamai, 'Improved upper bounds on the decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum,' IEEE Trans. Inform. Theory, vol. 46, pp. 24-47, January 2000 https://doi.org/10.1109/18.817506
  18. A. M. Viterbi and A. J. Viterbi, 'Improved union bound on linear codes for the input-binary awgn channel with applications to turbo codes,' Proc. IEEE Symposium on Information Theory, p. 29, August 1998
  19. D. Divsalar, S. Dolinar, and F. Pollara, 'Transfer function bounds on the performance of turbo codes,' TDA Progress Reports 42-122., Jet Propulsion Lab, August 1995
  20. 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
  21. L. Perez, J. Seghers, and D. Costello, 'A distance spectrum interpretation of turbo codes,' IEEE Trans. Inform. Theory, vol. 42, pp. 1698-1709, November 1996 https://doi.org/10.1109/18.556666
  22. S. Benedetto, L. Gaggero, R. Garello, and G. Montorsi, 'On the design of binary serially concatenated convolutional codes,' in Proc. International Conf. Communications, (Vancouver, B.C., Canada), pp. 32-36, 1999. (Comm. Theory Mini-Conf.)
  23. R. Garello, P. Pierleoni, and S. Benedetto, 'Computing the free distance of turbo codes and serially concatenated codes with interleavers: Algorithms and applications,' IEEE J. Select. Areas Commun., vol. 19, pp. 800-812, May 2001 https://doi.org/10.1109/49.924864
  24. E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms. Computer Science Press, 1978
  25. K. Chung and J. Heo, 'Computing the minimum distance of ldpc codes and ra codes.' submitted to IEICE Trans. Commun
  26. S. Crozier, 'New high-spread high-distance interleavers for turbo-codes,' 20th Biennial Symposium on Communications, Kingston, Ontario, Canada, pp. 3-7, May 2000