Cooperative space-time code for amplify-and-forward relay networks
(2010) 18th IEEE Signal Processing and Communications Application Conference p.796-799- Abstract
- In this paper, we propose a distributed space-time coded cooperative protocol with amplify-and-forward relaying. Motivated by protocol (III) presented in , we propose a distributed space-time coding 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... (More)
- In this paper, we propose a distributed space-time coded cooperative protocol with amplify-and-forward relaying. Motivated by protocol (III) presented in , we propose a distributed space-time coding 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. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/3515800
- author
- Al-nahari, Azzam LU ; Abd El-Samie, Fathi and Dessouky, Moawad
- publishing date
- 2010
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- [Host publication title missing]
- pages
- 796 - 799
- conference name
- 18th IEEE Signal Processing and Communications Application Conference
- conference location
- Diyarbakir, Turkey
- conference dates
- 2010-04-22 - 2010-04-24
- external identifiers
-
- scopus:78651418306
- ISBN
- 978-1-4244-9672-3
- DOI
- 10.1109/SIU.2010.5651412
- language
- English
- LU publication?
- no
- id
- 4b8732ee-45c6-485e-b3ad-b7f8699edf73 (old id 3515800)
- date added to LUP
- 2016-04-04 13:42:32
- date last changed
- 2022-01-30 00:45:53
@inproceedings{4b8732ee-45c6-485e-b3ad-b7f8699edf73,
abstract = {{In this paper, we propose a distributed space-time coded cooperative protocol with amplify-and-forward relaying. Motivated by protocol (III) presented in , we propose a distributed space-time coding 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.}},
author = {{Al-nahari, Azzam and Abd El-Samie, Fathi and Dessouky, Moawad}},
booktitle = {{[Host publication title missing]}},
isbn = {{978-1-4244-9672-3}},
language = {{eng}},
pages = {{796--799}},
title = {{Cooperative space-time code for amplify-and-forward relay networks}},
url = {{http://dx.doi.org/10.1109/SIU.2010.5651412}},
doi = {{10.1109/SIU.2010.5651412}},
year = {{2010}},
}