Accumulate rateless codes for AWGN channel

We think about the problem of reliable transmission of information over AWGN channels using rateless codes. We introduce a new family of rateless codes, named the accumulate rateless (AR) codes, which is easy to construct as traditional LT codes but has better performance and lower complexity. We investigate the performance of AR codes over AWGN channels, and simulation results are presented, showing that not only the error floor performance but also the waterfall performance are better than LT codes.

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

[2]  Shlomo Shamai,et al.  Fountain Capacity , 2006, IEEE Transactions on Information Theory.

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

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

[5]  H.-A. Loeliger,et al.  An introduction to factor graphs , 2004, IEEE Signal Process. Mag..

[6]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[7]  Sae-Young Chung,et al.  Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.

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

[9]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[10]  Zhigang Cao,et al.  A Modified PEG Algorithm for Construction of LDPC Codes with Strictly Concentrated Check-Node Degree Distributions , 2007, 2007 IEEE Wireless Communications and Networking Conference.

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

[12]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

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

[14]  Sae-Young Chung,et al.  On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.