By Topic

Optimized IR-HARQ Schemes Based on Punctured LDPC Codes Over the BEC

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Iryna Andriyanova ; ETIS-UMR8051 group, ETIS-UMR8051 Group, ENSEA/University of Cergy-Pontoise/CNRS, 95015 Cergy, France ; Emina Soljanin

We study incremental redundancy hybrid automatic repeat request (IR-HARQ) schemes based on punctured, finite-length, low-density, parity-check (LDPC) codes. The transmission is assumed to take place over time-varying binary erasure channels, such as mobile wireless channels at the application 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.

Published in:

IEEE Transactions on Information Theory  (Volume:58 ,  Issue: 10 )