Performance Bounds for Bidirectional Coded Cooperation Protocols

  • Authors:

  • Sang Joon Kim;P. Mitran;V. Tarokh

  • Affiliations:

  • Sch. of Eng. & Appl. Sci., Harvard Univ., Cambridge, MA;-;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2008

Quantified Score

Hi-index 754.84

Visualization

Abstract

In coded bidirectional cooperation, two nodes wish to exchange messages over a shared half-duplex channel with the help of a relay. In this correspondence, we derive performance bounds for this problem for each of three decode-and-forward protocols. The first protocol is a two phase protocol where both users simultaneously transmit during the first phase and the relay alone transmits during the second. In this protocol, our bounds are tight. The second protocol considers sequential transmissions from the two users followed by a transmission from the relay while the third protocol is a hybrid of the first two protocols and has four phases. In the latter two protocols the bounds are not identical. Numerical evaluation shows that in some cases of interest our bounds do not differ significantly. Finally, in the Gaussian case with path loss, we derive achievable rates and compare the relative merits of each protocol. This case is of interest in cellular systems. Surprisingly, we find that in some cases, the achievable rate region of the four phase protocol contains points that are outside the outer bounds of the other two protocols.