By Topic

Distributed Space-Time Code for Amplify-and-Forward Cooperative 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
$33 $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

3 Author(s)
A. Y. Al-nahari ; Dept. of Electron. & Electr. Commun., Menoufia Univ., Menouf, Egypt ; F. A. Abd El-Samie ; M. I. Dessouky

Cooperative diversity using distributed space-time codes has been recently proposed to form virtual antennas in order to achieve diversity gain. In this paper, we propose a distributed space-time coding with amplify-and-forward relaying. Motivated by protocol (III) presented in, we propose a distributed space-time code for an arbitrary number of relay nodes. The pairwise error probability (PEP) is derived and the theory analysis demonstrates that our protocol achieves a diversity of order N + 1 where N is the number of relay nodes. Quasi-orthogonal space-time codes are used as they give much better performance than random linear-dispersion codes. As the transmission power of the source node is a critical parameter in this protocol because it transmits in both phases, the optimal power allocation is derived using numerical and theoretical analysis. Simulation results demonstrate an improvement over the existing orthogonal protocols for different source-destination channel conditions.

Published in:

2010 5th International Conference on Future Information Technology

Date of Conference:

21-23 May 2010