A Systematic Approach to Incremental Redundancy over Erasure Channels

Heidarzadeh, Anoosheh and Chamberland, Jean-Francois and Parag, Parimal and Wesel, Richard D (2018) A Systematic Approach to Incremental Redundancy over Erasure Channels. In: IEEE International Symposium on Information Theory (ISIT), JUN 17-22, 2018, Vail, CO, pp. 1176-1180.

PDF ISIT_1176_2018.pdf - Published Version Restricted to Registered users only Download (700kB) | Request a copy

Abstract

As sensing and instrumentation play an increasingly important role in systems controlled over wired and wireless networks, the need to better understand delay-sensitive communication becomes a prime issue. Along these lines, this article studies the operation of data links that employ incremental redundancy as a practical means to protect information from the effects of unreliable channels. Specifically, this work extends a powerful methodology termed sequential differential optimization to choose near-optimal block sizes for hybrid ARQ over erasure channels. Furthermore, results show that the impact of the coding strategy adopted and the propensity of the channel to erase symbols naturally decouple when analyzing throughput. Overall, block size selection is motivated by normal approximations on the probability of decoding success at every stage of the incremental transmission process. This novel perspective, which rigorously bridges hybrid ARQ and coding, offers a pragmatic means to select code rates and blocklengths for incremental redundancy.

Item Type:	Conference Proceedings
Series.:	IEEE International Symposium on Information Theory
Publisher:	IEEE
Additional Information:	Copy right for this article belong to IEEE
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	22 Nov 2018 15:03
Last Modified:	22 Nov 2018 15:03
URI:	http://eprints.iisc.ac.in/id/eprint/61132

Actions (login required)

View Item