Coding versus feedback: Hybrid ARQ protocols for the packet erasure channel

This paper introduces hybrid ARQ protocols for the packet erasure channel - protocols that enable tradeoffs between complexity of encoding/decoding redundant packets and the amount of feedback needed for re-transmission requests. These protocols use adaptations of Tornado codes for erasure-correction on the forward link, and rate-distortion codes on the reverse link for feeding back the status of received packets. The resulting complexity-feedback tradeoffs are shown to be substantially better (in regimes of practical interest) than a naive protocol that simply time-shares between coding-only and feedback-only approaches.

[1]  Daniel A. Spielman,et al.  Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.

[2]  T.E. Fuja,et al.  Trading off coding complexity and feedback requirements for the packet erasure channel , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

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

[4]  Rüdiger L. Urbanke,et al.  Capacity-achieving ensembles for the binary erasure channel with bounded complexity , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[5]  Amin Shokrollahi,et al.  Capacity-achieving sequences for the erasure channel , 2002, IEEE Trans. Inf. Theory.

[6]  Igal Sason,et al.  Accumulate–Repeat–Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity , 2007, IEEE Transactions on Information Theory.