Analysis of a distributed coded cooperation scheme for multi-relay channels

Mohamed Elfituri, Walaa Hamouda, Ali Ghrayeb

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

In this paper, we consider a coded cooperation diversity scheme suitable for relay channels. The proposed scheme is based on convolutional coding, where each codeword of the source node is partitioned into two parts. The first part is transmitted from the source to the relays and destination. The second part is transmitted simultaneously from the source and relay nodes to the destination. All the relay nodes are assumed to be operating in the decode-and-forward (DF) mode. At the destination, the two replicas of the second sub-codeword are combined using maximum ratio combining (MRC). The entire codeword is decoded via the Viterbi algorithm. We analyze the proposed scheme for L-relay channels in terms of its probability of symbol error and outage probability. In that, explicit upper bounds are obtained assuming M-ary phase shift keying (M-PSK) transmission. Our analytical results show that the maximum diversity order is achieved provided that the source-relay link is more reliable than the other links. Otherwise, the diversity degrades. However, in both cases, it is shown that substantial performance improvements are possible to achieve over noncooperative coded systems. Several numerical and simulation results are presented to demonstrate the efficiency of the proposed scheme.

Original languageEnglish
Title of host publicationISSPIT 2007 - 2007 IEEE International Symposium on Signal Processing and Information Technology
Pages454-459
Number of pages6
DOIs
Publication statusPublished - 2007
Externally publishedYes
EventISSPIT 2007 - 2007 IEEE International Symposium on Signal Processing and Information Technology - Cairo, Egypt
Duration: 15 Dec 200718 Dec 2007

Other

OtherISSPIT 2007 - 2007 IEEE International Symposium on Signal Processing and Information Technology
CountryEgypt
CityCairo
Period15/12/0718/12/07

Fingerprint

Viterbi algorithm
Phase shift keying
Outages

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Vision and Pattern Recognition
  • Information Systems
  • Signal Processing

Cite this

Elfituri, M., Hamouda, W., & Ghrayeb, A. (2007). Analysis of a distributed coded cooperation scheme for multi-relay channels. In ISSPIT 2007 - 2007 IEEE International Symposium on Signal Processing and Information Technology (pp. 454-459). [4458084] https://doi.org/10.1109/ISSPIT.2007.4458084

Analysis of a distributed coded cooperation scheme for multi-relay channels. / Elfituri, Mohamed; Hamouda, Walaa; Ghrayeb, Ali.

ISSPIT 2007 - 2007 IEEE International Symposium on Signal Processing and Information Technology. 2007. p. 454-459 4458084.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Elfituri, M, Hamouda, W & Ghrayeb, A 2007, Analysis of a distributed coded cooperation scheme for multi-relay channels. in ISSPIT 2007 - 2007 IEEE International Symposium on Signal Processing and Information Technology., 4458084, pp. 454-459, ISSPIT 2007 - 2007 IEEE International Symposium on Signal Processing and Information Technology, Cairo, Egypt, 15/12/07. https://doi.org/10.1109/ISSPIT.2007.4458084
Elfituri M, Hamouda W, Ghrayeb A. Analysis of a distributed coded cooperation scheme for multi-relay channels. In ISSPIT 2007 - 2007 IEEE International Symposium on Signal Processing and Information Technology. 2007. p. 454-459. 4458084 https://doi.org/10.1109/ISSPIT.2007.4458084
Elfituri, Mohamed ; Hamouda, Walaa ; Ghrayeb, Ali. / Analysis of a distributed coded cooperation scheme for multi-relay channels. ISSPIT 2007 - 2007 IEEE International Symposium on Signal Processing and Information Technology. 2007. pp. 454-459
@inproceedings{2123e23135f94296a89c5fb1e29c7de8,
title = "Analysis of a distributed coded cooperation scheme for multi-relay channels",
abstract = "In this paper, we consider a coded cooperation diversity scheme suitable for relay channels. The proposed scheme is based on convolutional coding, where each codeword of the source node is partitioned into two parts. The first part is transmitted from the source to the relays and destination. The second part is transmitted simultaneously from the source and relay nodes to the destination. All the relay nodes are assumed to be operating in the decode-and-forward (DF) mode. At the destination, the two replicas of the second sub-codeword are combined using maximum ratio combining (MRC). The entire codeword is decoded via the Viterbi algorithm. We analyze the proposed scheme for L-relay channels in terms of its probability of symbol error and outage probability. In that, explicit upper bounds are obtained assuming M-ary phase shift keying (M-PSK) transmission. Our analytical results show that the maximum diversity order is achieved provided that the source-relay link is more reliable than the other links. Otherwise, the diversity degrades. However, in both cases, it is shown that substantial performance improvements are possible to achieve over noncooperative coded systems. Several numerical and simulation results are presented to demonstrate the efficiency of the proposed scheme.",
author = "Mohamed Elfituri and Walaa Hamouda and Ali Ghrayeb",
year = "2007",
doi = "10.1109/ISSPIT.2007.4458084",
language = "English",
isbn = "9781424418350",
pages = "454--459",
booktitle = "ISSPIT 2007 - 2007 IEEE International Symposium on Signal Processing and Information Technology",

}

TY - GEN

T1 - Analysis of a distributed coded cooperation scheme for multi-relay channels

AU - Elfituri, Mohamed

AU - Hamouda, Walaa

AU - Ghrayeb, Ali

PY - 2007

Y1 - 2007

N2 - In this paper, we consider a coded cooperation diversity scheme suitable for relay channels. The proposed scheme is based on convolutional coding, where each codeword of the source node is partitioned into two parts. The first part is transmitted from the source to the relays and destination. The second part is transmitted simultaneously from the source and relay nodes to the destination. All the relay nodes are assumed to be operating in the decode-and-forward (DF) mode. At the destination, the two replicas of the second sub-codeword are combined using maximum ratio combining (MRC). The entire codeword is decoded via the Viterbi algorithm. We analyze the proposed scheme for L-relay channels in terms of its probability of symbol error and outage probability. In that, explicit upper bounds are obtained assuming M-ary phase shift keying (M-PSK) transmission. Our analytical results show that the maximum diversity order is achieved provided that the source-relay link is more reliable than the other links. Otherwise, the diversity degrades. However, in both cases, it is shown that substantial performance improvements are possible to achieve over noncooperative coded systems. Several numerical and simulation results are presented to demonstrate the efficiency of the proposed scheme.

AB - In this paper, we consider a coded cooperation diversity scheme suitable for relay channels. The proposed scheme is based on convolutional coding, where each codeword of the source node is partitioned into two parts. The first part is transmitted from the source to the relays and destination. The second part is transmitted simultaneously from the source and relay nodes to the destination. All the relay nodes are assumed to be operating in the decode-and-forward (DF) mode. At the destination, the two replicas of the second sub-codeword are combined using maximum ratio combining (MRC). The entire codeword is decoded via the Viterbi algorithm. We analyze the proposed scheme for L-relay channels in terms of its probability of symbol error and outage probability. In that, explicit upper bounds are obtained assuming M-ary phase shift keying (M-PSK) transmission. Our analytical results show that the maximum diversity order is achieved provided that the source-relay link is more reliable than the other links. Otherwise, the diversity degrades. However, in both cases, it is shown that substantial performance improvements are possible to achieve over noncooperative coded systems. Several numerical and simulation results are presented to demonstrate the efficiency of the proposed scheme.

UR - http://www.scopus.com/inward/record.url?scp=71549136209&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=71549136209&partnerID=8YFLogxK

U2 - 10.1109/ISSPIT.2007.4458084

DO - 10.1109/ISSPIT.2007.4458084

M3 - Conference contribution

AN - SCOPUS:71549136209

SN - 9781424418350

SP - 454

EP - 459

BT - ISSPIT 2007 - 2007 IEEE International Symposium on Signal Processing and Information Technology

ER -