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

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

2010-09-13

arxiv.org/abs/1009.2370v2

Computer Science

Information Theory

IEEE Transactions on Information Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Optimized IR-HARQ Schemes Based on Punctured LDPC Codes over the BEC does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimized IR-HARQ Schemes Based on Punctured LDPC Codes over the BEC, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimized IR-HARQ Schemes Based on Punctured LDPC Codes over the BEC will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-337585