Browse > Article
http://dx.doi.org/10.13067/JKIECS.2011.6.1.020

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

Suh, Hee-Jong (전남대학교 전자통신공학과)
Publication Information
The Journal of the Korea institute of electronic communication sciences / v.6, no.1, 2011 , pp. 20-26 More about this Journal
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.
Keywords
LDPC codes; node monitoring; node-threshold; piecewise linear function approx;
Citations & Related Records
연도 인용수 순위
  • Reference
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.   DOI   ScienceOn
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.   DOI
7 D. H. Kim and S. W. Kim, "Bit-level stopping of turbo decoding," IEEE Communication Lett., vol. 10, pp. 183-185, 2006.   DOI   ScienceOn
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.   DOI   ScienceOn
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.