Piggybacking Belief Propagation Decoding for Rateless Codes Based on RA Structure

In this paper, a new Belief Propagation (BP) decoding algorithm named Piggybacking Belief Propagation (PBP) decoding algorithm is proposed for rateless codes based on repeat-accumulate (RA) structure over AWGN channel. The "piggybacking" characteristic of the proposed algorithm is transmitting the Log-Likelihood Ratio (LLR) results calculated from the previous decode attempt to the new decoding process after receiving more information from the channel. Moreover, the proposed algorithm introduces a new stopping criterion to stop the decoding attempt when it is almost impossible to succeed. The stopping criterion is based on the weight change ratio of syndrome. The simulation results show that, compared with the traditional BP decoding algorithm, the proposed algorithm has lower decoding overhead and the a reduced decoding delay.

[1]  Huang-Chang Lee,et al.  Flooding-assisted informed dynamic scheduling for rateless codes , 2012, 2012 IEEE Wireless Communications and Networking Conference (WCNC).

[2]  Yongyi Mao,et al.  Reduced-Complexity Decoding of Raptor Codes over Fading Channels , 2006 .

[3]  Meixiang Zhang,et al.  Soft decoding method for systematic raptor codes , 2015, IET Commun..

[4]  Lutz H.-J. Lampe,et al.  Decoding with Early Termination for Raptor Codes , 2008, IEEE Communications Letters.

[5]  H. Jin,et al.  Irregular repeat accumulate codes , 2000 .

[6]  Nadhir Ibrahim Abdulkhaleq,et al.  A sequential coding approach for short length LT codes over AWGN channel , 2017, 2017 4th International Conference on Electrical and Electronic Engineering (ICEEE).

[7]  Xiao Ma,et al.  Serial Concatenation of RS Codes with Kite Codes: Performance Analysis, Iterative Decoding and Design , 2011, ArXiv.

[8]  U. Sorger,et al.  Turbo decoding: Why stopping-criteria do work , 2008, 2008 5th International Symposium on Turbo Codes and Related Topics.

[9]  Richard D. Wesel,et al.  Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes , 2007, 2007 IEEE International Conference on Communications.

[10]  Xinming Huang,et al.  Soft decoder architecture of LT codes , 2008, 2008 IEEE Workshop on Signal Processing Systems.

[11]  Ajay Dholakia,et al.  Efficient implementations of the sum-product algorithm for decoding LDPC codes , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[12]  J. Sayir,et al.  On the Convergence of Log-Likelihood Values in Iterative Decoding , 2002 .

[13]  Xiaojun Yuan,et al.  Simple capacity-achieving ensembles of rateless erasure-correcting codes , 2010, IEEE Transactions on Communications.

[14]  Javier Valls-Coquillat,et al.  Reduced-Complexity Min-Sum Algorithm for Decoding LDPC Codes With Low Error-Floor , 2014, IEEE Transactions on Circuits and Systems I: Regular Papers.

[15]  Xiao Ma,et al.  Semi-random Kite Codes over Fading Channels , 2011, 2011 IEEE International Conference on Advanced Information Networking and Applications.