Journal of South China University of Technology (Natural Science Edition) ›› 2013, Vol. 41 ›› Issue (1): 47-51.doi: 10.3969/j.issn.1000-565X.2013.01.007

• Electronics, Communication & Automation Technology • Previous Articles     Next Articles

Fast Belief Propagation Decoding in the Short Length LT Codes

Qi-cong Zhan   

  • Received:2012-05-18 Revised:2012-09-28 Online:2013-01-25 Published:2012-12-03
  • Contact: 杜明辉(1964-),男,教授,博士生导师,主要从事医学信号处理、图像重建等研究. E-mail:ecmhdu@scut.edu.cn
  • About author:詹奇聪(1986-),男,博士,主要从事信道编码及视频传输研究. E-mail:zhan.qicong@mail.scut.edu.cn
  • Supported by:

    国家自然科学基金资助项目(60972133);广东省自然科学基金团队项目(9351064101000003);广东省能源技术重点实验室项目(2008A060301002)

PDF

782

Abstract:

In wireless transmission, the sudden declination of channel quality would result in the rise of error percentage, when a certain number of coded symbols have been received the input symbols are used to be decoded, which would slow down the decoding speed. Hence, to improve the success probability and speed of partial decoding of short code length LT codes, in this paper, we propose the Fast Belief Propagation (FBP) decoding algorithm, which uses the swap heuristic method and the transformation of the triangular matrix not only to enhance the decoding success proportions but also to reduce the decoding delay. According to analysis and experiment, FBP decoding algorithm is better than the conventional methods, Belief Propagation (BP) and Gaussian Elimination (GE). In the simulation, while the length of the source symbols is 128 bits, the probability of the FBP decoding is 48.09 percent higher than traditional ones at the most and its decoding complexity and time consumption are less than GE.

Key words: rateless codes, LT codes, belief propagation, gaussian elimination

CLC Number: