Optimized IR-HARQ Schemes Based on Punctured LDPC Codes Over the BEC
From MaRDI portal
Publication:2989736
DOI10.1109/TIT.2012.2203580zbMATH Open1364.94338arXiv1009.2370OpenAlexW1699687879MaRDI QIDQ2989736FDOQ2989736
Authors: Iryna Andriyanova, Emina Soljanin 
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: We study incremental redundancy hybrid ARQ (IR-HARQ) schemes based on punctured, finite-length, LDPC codes. The transmission is assumed to take place over time varying binary erasure channels, such as mobile wireless channels at the applications layer. We analyze and optimize the throughput and delay performance of these IR-HARQ protocols under iterative, message-passing decoding. We derive bounds on the performance that are achievable by such schemes, and show that, with a simple extension, the iteratively decoded, punctured LDPC code based IR-HARQ protocol can be made rateless, and operating close to the general theoretical optimum for a wide range of channel erasure rates.
Full work available at URL: https://arxiv.org/abs/1009.2370
Cited In (1)
This page was built for publication: Optimized IR-HARQ Schemes Based on Punctured LDPC Codes Over the BEC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989736)
