Using Distributed Rotations for a Low-Complexity Dynamic Decode-and-Forward Relay Protocol

Details Using Distributed Rotations for a Low-Complexity Dynamic Decode-and-Forward Relay Protocol Using Distributed Rotations for a Low-Complexity Dynamic Decode-and-Forward Relay Protocol

2011-02-21

arxiv.org/abs/1102.4137v1

Computer Science

Information Theory

5 pages, to be presented in ICC 2011 in Kyoto, Japan

Scientific paper

In this paper, we propose to implement the dynamic decode-and-forward (DDF) protocol with distributed rotations. In addition to being the first minimum-delay implementation of the DDF protocol proposed for any number of relays, this technique allows to exploit cooperative diversity without inducing the high decoding complexity of a space-time code. The analysis of outage probabilities for different number of relays and rotations shows that the performance of this technique is close to optimal. Moreover, a lower-bound on the diversity-multiplexing gain tradeoff (DMT) is provided in the case of a single relay and two rotations. This lower-bound reaches the optimal DDF's DMT when the frame-length grows to infinity, which shows that even a small number of rotations is enough to obtain good performance.

Affiliated with

Also associated with

No associations

Rating

Using Distributed Rotations for a Low-Complexity Dynamic Decode-and-Forward Relay Protocol 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 Using Distributed Rotations for a Low-Complexity Dynamic Decode-and-Forward Relay Protocol, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Using Distributed Rotations for a Low-Complexity Dynamic Decode-and-Forward Relay Protocol will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-520088