Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Dynamic Decode-and-Forward Relaying using Raptor Codes

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

3 Author(s)
Ravanshid, A. ; Inst. for Inf. Transm., Univ. of Erlangen-Nurnberg, Erlangen, Germany ; Lampe, L. ; Huber, J.B.

Dynamic decode-and-forward (DDF) is a version of decode-and-forward relaying in which the duration of the listening phase at relays is not fixed. In this paper, we investigate half-duplex DDF relaying based on rateless codes. The use of rateless codes allows relays to autonomously switch from listening to the source node to transmitting to the destination node. We first revisit different signal combining strategies applied at the destination node, namely energy and information combining known from literature, and propose a new combining method which we refer to as mixed combining. The different combining methods give rise to different achievable rates, i.e., constrained channel capacities, for which we provide analytical expressions. The capacity analysis reveals the conditions under which mixed combining is superior and how it can be optimized. We then consider Raptor codes as a specific implementation of rateless codes and develop a density-evolution approximation to predict the data-rate performance of these codes in DDF relaying. Furthermore, we devise an optimization of the output symbol degree distribution of Raptor codes that is mainly used to benchmark the performance of Raptor codes with a fixed degree distribution. Numerical results for exemplary three-node and four-node relay networks show that the proposed mixed combining provides significant gains in achievable data rate and that Raptor codes with a fixed degree distribution are able to realize these gains and to approach closely the constrained-capacity limits.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:10 ,  Issue: 5 )