Improved decoding for Raptor codes with short block-lengths over BIAWGN channel

Decoding of Raptor codes consists of decoding of both the LT part and the precode part of the codes. When LT decoding is performed, a scenario may arise where the message passing-based decoding process is unable to provide non-zero log-likelihood ratio (LLR) updates to a fraction of input symbols even if it is mathematically possible to do so. The problem is even more critical for codes with short block-lengths and for smaller overheads. We show that this problem degrades the overall decoding performance of Raptor codes over binary input additive white Gaussian noise (BIAWGN) channel. To combat this problem, the Gauss-Jordan elimination (GJE) is used to assist decoding so that the decoder can continuously provide non-zero LLR updates to all the input symbols connected in the decoding graph. Through simulation results we show that the GJE-assisted method provides significantly better bit error rate (BER) performance of Raptor codes than the traditional method across a wide range of signal to noise ratio (SNR) and transmission overheads.

[1]  Masoud Ardakani,et al.  On Raptor Code Design for Inactivation Decoding , 2012, IEEE Transactions on Communications.

[2]  Lei Cao,et al.  Decoding of short LT codes over BIAWGN channels with Gauss-Jordan elimination-assisted belief propagation method , 2015, 2015 Wireless Telecommunications Symposium (WTS).

[3]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[4]  Toshiaki Koike-Akino,et al.  Ripple Design of LT Codes for BIAWGN Channels , 2014, IEEE Transactions on Communications.

[5]  Yong Liang Guan,et al.  A Design of Physical-Layer Raptor Codes for Wide SNR Ranges , 2014, IEEE Communications Letters.

[6]  Ming Xiao,et al.  Error Floor Analysis of LT Codes over the Additive White Gaussian Noise Channel , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[7]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[8]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

[9]  Omid Etesami,et al.  Raptor codes on binary memoryless symmetric channels , 2006, IEEE Transactions on Information Theory.

[10]  Jonathan S. Yedidia,et al.  Rateless codes on noisy channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[11]  Liang Zhang,et al.  Belief propagation with gradual edge removal for Raptor codes over AWGN channel , 2013, 2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC).

[12]  Branka Vucetic,et al.  A Physical-Layer Rateless Code for Wireless Channels , 2013, IEEE Transactions on Communications.

[13]  Joachim Hagenauer,et al.  Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.

[14]  Jianfei Cai,et al.  LT-W: Improving LT Decoding With Wiedemann Solver , 2013, IEEE Transactions on Information Theory.