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

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

DOI QR Code

Analysis of Performance according to LDPC Decoding Algorithms

저밀도 패리티 검사부호의 복호 알고리즘에 따른 성능 비교 분석

  • 윤태현 (경북대학교 전자공학부) ;
  • 박진태 (경북대학교 전자공학부) ;
  • 주언경 (경북대학교 전자공학부)
  • Received : 2012.06.07
  • Accepted : 2012.11.07
  • Published : 2012.11.30
Download PDF
⟨ Previous Next ⟩

Abstract

LDPC (low density parity check) code shows near Shannon limit performance by iterative decoding based on sum-product algorithm (SPA). Message updating procedure between variable and check nodes in SPA is done by a scheduling method. LDPC code shows different performance according to scheduling schemes. The conventional researches have been shown that the shuffled BP (belief propagation) algorithm shows better performance than the standard BP algorithm although it needs less number of iterations. However the reason is not analyzed clearly. Therefore the reason of difference in performance according to LDPC decoding algorithms is analyzed in this paper. 4 cases according to satisfaction of parity check condition are considered and compared. As results, the difference in the updating procedure in a cycle in the parity check matrix is considered to be the main reason of performance difference.

LDPC(low density parity check)부호는 합-곱 알고리즘 기반의 반복복호를 통해 Shannon 한계에 근접하는 성능을 보인다. 합곱 알고리즘에서 체크노드와 비트노드의 확률 및 부가정보의 갱신 순서는 스케쥴링 방법에 따라 달라지며 그에 따라 오류정정능력이나 반복복호의 횟수가 달라진다. 기존에 제안된 순차 BP 알고리즘을 사용한 LDPC의 복호는 표준 BP 알고리즘을 바탕으로 복호를 수행했을 경우에 비해 적은 평균반복복호 횟수에도 불구하고 좋은 성능을 가진다고 알려져 있다. 하지만 기존의 연구들에서는 이러한 성능 차이의 원인에 대한 연구는 미비하다. 따라서 본 논문에서는 두 알고리즘의 적용에 따른 LDPC 복호의 성공 여부에 따라 4가지 경우로 분류하고 각 경우를 비교한다. 이를 통해 두 알고리즘의 성능 차이의 원인을 분석하고 그 결과로 성능 차이의 원인이 패리티 검사행렬 내부의 사이클을 구성하는 비트노드들의 확률 값을 갱신할 때 알고리즘에 따른 갱신 과정의 차이에 있음을 보인다.

Keywords

References

  1. R. G. Gallager, "Low-density parity-check code", IRE Trans. Inform. Theory, vol. 8, no. 1, pp. 21-28, Jan. 1962. https://doi.org/10.1109/TIT.1962.1057683
  2. S. Y. Chung, Jr. G. D. Forney, T. J. Richardson, and R. Urbanke, "On the design of low-density parity check codes within 0.0045dB from the Shannon limit", IEEE Commun. Lett., vol. 5, pp. 58-60, Feb. 2001. https://doi.org/10.1109/4234.905935
  3. D. J. C. Mackay, "Good error-correcting codes based on very sparse matrices", IEEE Trans. Inform. Theory, vol. 45, pp. 399-431, Mar. 1999. https://doi.org/10.1109/18.748992
  4. F. R. Kschischang, "Factor graphs and the sum-product algorithm", IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001. https://doi.org/10.1109/18.910572
  5. J. Jin and C. Y. Tsui, "A low power layered decoding architecture for LDPC decoder implementation for IEEE 802.11n LDPC codes". in Proc. IEEE ISLPED 2008, Bangalore, India, pp. 253-258, Aug. 2008.
  6. X. Y. Hu, E. Eleftheriou, D. M. Arnold and A. Dholakia, "Efficient implementations of the sum-product algorithm for decoding LDPC codes", in Proc. IEEE GLOBECOM 2001, San Antonio, TX, vol. 2, pp. 1036-1036E, Nov. 2001.
  7. J. Zhang and M. P. C. Fossorier, "Shuffled iterative decoding", IEEE Trans. Commun., vol. 53, no. 2, pp. 209-213, Fed. 2005. https://doi.org/10.1109/TCOMM.2004.841982
  8. A. I. V. Casado, M. Griot and R. D. Wesel, "Informed dynamic scheduling for BP decoding of LDPC codes", in Proc. IEEE ICC 2007, Glasgow, Scotland, pp. 932-937, June 2007.
  9. S. K. Yu, S. G. Kang and E. K. Joo, "A modified sum-product algorithm for error floor reduction in LDPC codes", J. KICS, vol. 35, no. 5, pp. 423-431, May. 2010.
  10. J. Zhang, Y. Wang and M. Fossorier, "Replica shuffled iterative decoding", in Proc. IEEE ISIT 2005, Adelaide, Australia, pp. 454-458, Sep. 2005.
  11. Z. C. Gang, Y. J. Sheng, L. X. Hong and L. J. Ru, "Improvement of shuffled iterative decoding", in Proc. IIEEE ITW 2006, Beijing, China, pp. 114-116, Oct. 2006.
  12. A. I. V. Casado, M. Griot and R. D. Wesel, "Improving LDPC decoders via informed dynamic scheduling", in Proc. IIEEE ITW 2007, Lake Tahoe, California, pp. 208-213, Sep. 2007.
  13. G. Han and X. Liu, "An efficient dynamic scheduling for layered belief propagation decoding of LDPC codes", IEEE Commun. Lett., vol. 13, no. 12, Dec. 2009.
  14. J. H. Kim, M. Y. Nam, H. Y. Song and K. M. Lee, "Variable to check residual belief prop-agation for informed dynamic scheduling of LDPC codes", in Proc. IEEE ISITA 2008, Auckland, New Zealand, pp. 1-4, Dec. 2008.
  15. IEEE Standard for local and metropolitan area networks part 16 : Air Interface for fixed and mobile broadband wireless access systems amendment 2 : Physical and medium access control layers for combined fixed and mobile operation in licensed bands and corrigendum 1, IEEE Std. 802.16e, 2005.
  16. IEEE P802.11n/D3.07, Draft amendment to standard for Information exchange between systems local and metropolitan networks specific requirements part 11 : Wireless LAN medium access control (MAC) and physical layer (PHY) specifications : Enhancements for higher throughput, IEEE Std. 802.16n, 2008.
  17. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of probably good low density parity check codes", in Proc. IEEE ISIT 2000, Sorrento, Italy, pp. 202, Jun. 2000.