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

TL;DR

This paper introduces a low-complexity, distributed rotation-based implementation of the dynamic decode-and-forward protocol for relays, achieving near-optimal performance with minimal delay and decoding complexity.

Contribution

It presents the first minimal-delay implementation of the DDF protocol using distributed rotations, enabling cooperative diversity without complex space-time coding.

Findings

Performance close to optimal in outage probability analysis

Lower-bound on DMT reaches optimal DDF DMT with infinite frame length

Small number of rotations suffices for good performance

Abstract

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.