On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels

By Kambiz Azarian, Hesham El Gamal, Philip Schniter. IEEE Transactions on Information Theory, 2005

1,192 citations recorded by the source corpus.

We propose novel cooperative transmission protocols for delay-limited coherent fading channels consisting of N (half-duplex and single-antenna) partners and one cell site. In our work, we differentiate between the relay, cooperative broadcast (down-link), and cooperative multiple-access (CMA) (up-link) channels. The proposed protocols are evaluated using Zheng-Tse diversity-multiplexing tradeoff. For the relay channel, we investigate two classes of cooperation schemes; namely, amplify and forward (AF) protocols and decode and forward (DF) protocols. For the first class, we establish an upper bound on the achievable diversity-multiplexing tradeoff with a single relay. We then construct a new AF protocol that achieves this upper bound. The proposed algorithm is then extended to the general case with (N-1) relays where it is shown to outperform the space-time coded protocol of Laneman and Wornell without requiring decoding/encoding at the relays. For the class of DF protocols, we develop a dynamic decode and forward (DDF) protocol that achieves the optimal tradeoff for multiplexing gains 0lesrles1/N. Furthermore, with a single relay, the DDF protocol is shown to dominate the class of AF protocols for all multiplexing gains. The superiority of the DDF protocol is shown to be more significant in the cooperative broadcast channel. The situation is reversed in the CMA channel where we propose a new AF protocol that achieves the optimal tradeoff for all multiplexing gains. A distinguishing feature of the proposed protocols in the three scenarios is that they do not rely on orthogonal subspaces, allowing for a more efficient use of resources. In fact, using our results one can argue that the suboptimality of previously proposed protocols stems from their use of orthogonal subspaces rather than the half-duplex constraint.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/df3b3b996f7c6bba9c2a77d9a08801385636338e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

  1. Robert W. Heath
  2. D. J. Love
  3. Yindi Jing
  4. David Gesbert
  5. Hamid Jafarkhani
  6. Bhaskar D. Rao
  7. Vincent Kin Nang Lau
  8. Matthew Andrews

In Electrical and Electronic Engineering

  1. Robert W. Heath
  2. D. J. Love
  3. David Gesbert
  4. Yindi Jing
  5. Hamid Jafarkhani
  6. A. L. Swindlehurst
  7. Bhaskar D. Rao
  8. Rui Zhang

Citations in the corpus