Accessibility navigation

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

Wang, W., Jin, S., Gao, X., Wong, K.-K. and McKay, M. R. (2010) Power allocation strategies for distributed space-time codes in two-way relay networks. IEEE Transactions on Signal Processing, 58 (10). pp. 5331-5339. ISSN 1053-587X

Full text not archived in this repository.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

To link to this item DOI: 10.1109/TSP.2010.2055561


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.

Item Type:Article
Divisions:Faculty of Science
ID Code:31758
Uncontrolled Keywords:Distributed space-time codes, power allocation, two-way relay channel.

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation