By Topic

Optimal Distributed Space-Time Coding Strategy for Two-Way Relay Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Wenjin Wang ; Nat. Mobile Commun. Res. Lab., Southeast Univ., Nanjing, China ; Shi Jin ; Xiqi Gao ; Kai-Kit Wong
more authors

In this paper, we consider optimal power allocation (OPA) for distributed space-time coded two-way relay networks. Each relay transmits a scaled version of the linear combinations of the received symbols and their conjugates, and the scaling factor is based on automatic gain control (AGC) at the relays. We show that solving the OPA across relays to minimize the average conditional PEP of the destination terminals is a generalized linear fractional programming problem, which can be resolved by the Dinkelbach-type procedure. We also prove that at most two relays are active while the others keep silent if the sum power constraint is made across the relays. This motivates us to propose a new low-complexity relaying scheme that uses distributed Alamouti codes on the selected two-best relay nodes. Simulation results show that the distributed space-time codes (DSTC) with the OPA and the proposed scheme have significant performance gains over the DSTC with the equal power allocation.

Published in:

Wireless Communications and Networking Conference (WCNC), 2010 IEEE

Date of Conference:

18-21 April 2010