By Topic

A Turbo-Like Iterative Decoding Algorithm for Network Coded HARQ

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
$31 $31
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

5 Author(s)

This paper proposes a turbo-like decoding algorithm for network coded HARQ (NC-HARQ) retransmission scheme. Instead of retransmission erroneous packets individually, we send a network coded packet formed by XOR of two incorrectly received packets in the NC-HARQ retransmission. With respect to the two initial packets and one network coded packet, this retransmission scheme can be viewed as a product code based on the Turbo coding principle. We develop an iterative decoding algorithm for the proposed NC-HARQ scheme. The algorithm uses the log-likelihood ratios generated by decoding any two packets to calculate a priori information for the third one. This approach is applicable for both Chase Combing (CC) and Incremental Redundancy (IR). Furthermore, a link adaptation algorithm is investigated for the proposed network coded HARQ scheme. LTE link-level simulations confirm the throughput enhancement by the proposed scheme compared to common HARQ transmission. Index Terms ?? Network coding, HARQ, iterative decoding, link adaptation.

Published in:

Systems, Communication and Coding (SCC), Proceedings of 2013 9th International ITG Conference on

Date of Conference:

21-24 Jan. 2013