Performance of Min-Sum for Decoding Fountain Codes over BIAWGN Channels

In this paper, we extend the min-sum (MS) and its two improved algorithms (i.e., the normalized MS algorithm and the offset MS algorithm) to decode fountain codes over the binary input additive white Gaussian noise (BIAWGN) channel. We use Gaussian approximation method to analyze the asymptotic performance of fountain codes under various decoding algorithms and optimize the parameters of the two improved MS algorithms. Both the theoretical analysis and simulation results demonstrate that the normalized MS decoding with optimal parameter has better bit error performance than the offset MS decoding with optimal parameter.

[1]  Yongyi Mao,et al.  Rateless coding over fading channels , 2006, IEEE Communications Letters.

[2]  Achilleas Anastasopoulos,et al.  A comparison between the sum-product and the min-sum iterative detection algorithms based on density evolution , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

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

[4]  Zhong Cheng,et al.  On the Design of Raptor Codes for Binary-Input Gaussian Channels , 2007, 2007 IEEE International Symposium on Information Theory.

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

[6]  Jinghu Chen,et al.  Near optimum universal belief propagation based decoding of low-density parity check codes , 2002, IEEE Trans. Commun..

[7]  Harry Leib,et al.  Fixed-Rate Raptor Codes Over Rician Fading Channels , 2008, IEEE Transactions on Vehicular Technology.

[8]  Joong Bum Rhim,et al.  Fountain Codes , 2010 .

[9]  Masoud Ardakani,et al.  A more accurate one-dimensional analysis and design of irregular LDPC codes , 2004, IEEE Transactions on Communications.

[10]  Jinghu Chen,et al.  Density evolution for two improved BP-Based decoding algorithms of LDPC codes , 2002, IEEE Communications Letters.

[11]  Evangelos Eleftheriou,et al.  Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.

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

[13]  Hideki Imai,et al.  Reduced complexity iterative decoding of low-density parity check codes based on belief propagation , 1999, IEEE Trans. Commun..