The Journal of the Korea institute of electronic communication sciences (한국전자통신학회논문지)

Korea Institute of Electronic Communication Science (한국전자통신학회)
권호 표지
DOI QR코드

DOI QR Code

Node Monitoring Algorithm with Piecewise Linear Function Approximation for Efficient LDPC Decoding

Node Monitoring 알고리듬과 NP 방법을 사용한 효율적인 LDPC 복호방법

  • 서희종 (전남대학교 전자통신공학과)
  • Received : 2010.12.12
  • Accepted : 2011.02.09
  • Published : 2011.02.28
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we propose an efficient algorithm for reducing the complexity of LDPC code decoding by using node monitoring (NM) and Piecewise Linear Function Approximation (NP). This NM algorithm is based on a new node-threshold method, and the message passing algorithm. Piecewise linear function approximation is used to reduce the complexity for more. This algorithm was simulated in order to verify its efficiency. Simulation results show that the complexity of our NM algorithm is reduced to about 20%, compared with thoes of well-known method.

본 논문에서는 NM(node monitoring) 알고리듬과 NP(Piecewise Linear Function Approximation)를 사용해서 LDPC 코드 복호의 복잡도를 감소시키기 위한 효율적인 알고리듬을 제안한다. 이 NM 알고리듬은 새로운 node-threshold 방법과 message passing 알고리듬에 근거해서 제안되었는데, 이에 NP 방법을 사용해서 알고리듬의 복잡도를 더 줄일 수 있었다. 이 알고리듬의 효율성을 입증하기 위해서 모의 실험을 하였다. 모의실험결과, 기존에 잘 알려진 방법에 비해서 20% 정도 더 효율적이었다.

Keywords

References

  1. R. G. Gallager, Low-Density Parity-Check Codes. MIT Press, 1963.
  2. John R. Barry, "Low-Density Parity-Check Codes," Georgia Institute of Technology, 2001.
  3. G. Fettweis, E. Zimmermann, and W. Rave, "Forced convergence decoding of LDPC codes: EXIT chart analysis and combination with node complexity reduction techniques," in Proc. 11th European Wireless Conference 2005.
  4. J. Zhang, M. Fossorier, D. Gu, and J. Zhang, "Two-dimensional correction for min-sum decoding of irregular LDPC codes," IEEE Communication Lett., vol. 10, pp. 180-182, 2006. https://doi.org/10.1109/LCOMM.2006.1603377
  5. Y. Wang, J. Zhang, M. Fossorier, and J. Yedidia, "Reduced latency iterative decoding of LDPC codes," IEEE Global Telecommunication Conf. 2005.
  6. D. Levin, E. Sharon, and S. Litsyn, "Lazy Scheduling for LDPC Decoding," IEEE Communication Lett., vol. 11, pp. 70-72, Jan. 2007. https://doi.org/10.1109/LCOMM.2007.061454
  7. D. H. Kim and S. W. Kim, "Bit-level stopping of turbo decoding," IEEE Communication Lett., vol. 10, pp. 183-185, 2006. https://doi.org/10.1109/LCOMM.2006.1603378
  8. T. J. Richardson and R. Urbanke, "The capacity of low-density parity check codes under message passing decoding," IEEE Trans. Inf. Theory, vol. 47, pp. 599-618, 2001. https://doi.org/10.1109/18.910577
  9. X. Y. Hu, E. Eleftheriou, D.-M. Arnold, and A. Dholakia. Efficient Implementations of the Sum-Product Algorithm for Decoding LDPC Codes. Proceedings of the IEEE Globe Com 2001, pp. 1036-1036E, 2001.