Power allocation strategies for distributed space-time codes in two-way relay networks

  • Authors:

  • Wenjin Wang;Shi Jin;Xiqi Gao;Kai-Kit Wong;Matthew R. McKay

  • Affiliations:

  • National Mobile Communications Research Laboratory, Southeast University, Nanjing, China;National Mobile Communications Research Laboratory, Southeast University, Nanjing, China;National Mobile Communications Research Laboratory, Southeast University, Nanjing, China;Department of Electrical and Electronic Engineering University College London, London, UK;Department of Electronic and Computer Engineering, Hong Kong University of Science and Technology, Kowloon, Hong Kong

  • Venue:
  • IEEE Transactions on Signal Processing
  • Year:
  • 2010

Quantified Score

Hi-index 35.68

Visualization

Abstract

We study a two-way relay network (TWRN), where distributed space-time codes are constructed across multiple relay terminals in an amplify-and-forward mode. Each relay transmits a scaled linear combination of its received symbols and their conjugates, with the scaling factor chosen based on automatic gain control. We consider equal power allocation (EPA) across the relays, as well as the optimal power allocation (OPA) strategy given access to instantaneous channel state information (CSI). For EPA, we derive an upper bound on the pairwise-error-probability (PEP), from which we prove that full diversity is achieved in TWRNs. This result is in contrast to one-way relay networks, in which case a maximum diversity order of only unity can be obtained. When instantaneous CSI is available at the relays, we show that the OPA which minimizes the conditional PEP of the worse link can be cast as a generalized linear fractional program, which can be solved efficiently using the Dinkelback-type procedure. We also prove that, if the sum-power of the relay terminals is constrained, then the OPA will activate at most two relays.