JOURNAL OF CHINA UNIVERSITIES OF POSTS AND TELECOM ›› 2016, Vol. 23 ›› Issue (5): 26-31.doi: 10.1016/S1005-8885(16)60054-7

• Wireless • Previous Articles     Next Articles

Performance analysis of complexity reduction BP decoding of rateless codes by deleting low reliable symbols

Lei Weijia, Chen Shengnan   

  • Received:2016-04-29 Revised:2016-09-25 Online:2016-10-30 Published:2016-10-26
  • Contact: Wei-Jia LEI
  • Supported by:
    the National Natural Science Foundation of China (61471076), the Program for Changjiang Scholars , Innovative Research Team in University (IRT1299), the Special Fund of Chongqing Key Laboratory (CSTC)

Abstract: This paper investigates the performance of the method used to reduce the decoding complexity of rateless codes through the deletion of the received symbols with low reliability. In the decoder, the received symbols whose absolute value of logarithm likelihood ratio (LLR) is lower than the threshold are removed, together with their corresponding edges, and thus not involved in the decoding process. The relationship between the deletion probability and the likelihood ratio deletion threshold is derived. The average mutual information per received symbol is analyzed in the case of deletion. The required number of symbols for the decoder to keep the same performance as regular decoding decreases since the average mutual information per symbol increases with the deletion, thus reducing the decoding complexity. This paper analyzes the reduction of decoding computations and the consequent transmission efficiency loss from the perspective of mutual information. The simulation results of decoding performance are consistent with those of the theoretical analysis, which show that the method can effectively reduce the decoding complexity at the cost of a slight loss of transmission efficiency.

Key words: rateless codes, symbols deletion, logarithm likelihood ratio, average mutual information, decoding complexity

CLC Number: