Low complexity decoding for Raptor codes for hybrid-ARQ systems

In this paper we present a low complexity decoding algorithm for Raptor codes which is used for incremental redundancy hybrid ARQ schemes. Encoding and decoding Raptor codes are the processes of making encoding symbols from the source symbols and the recovery of the source symbols from the received encoding symbols transmitted through an erasure channel, respectively. If the received encoding symbols are insufficient to recover the source symbols, additional encoding symbols are delivered and decoded with the previously received encoding symbols. We propose a low complexity decoding algorithm which efficiently combines the previously received encoding symbols and incremental encoding symbols. The proposed algorithm has excellent potential for realizing low power operation and higher throughput transmission due to its highly reduced computational complexity.

[1]  Wen Xu,et al.  Raptor codes for reliable download delivery in wireless broadcast systems , 2006, CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006..

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

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

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

[5]  Daniel J. Costello,et al.  Error Control Coding, Second Edition , 2004 .