Performance analysis of opportunistic coded cooperation in rayleigh fading channels

Sung Il Kim, Jun Heo

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

Abstract

This paper is on the bit error probability (BEP) of opportunistic decode-and-forward (DF) relaying with coded cooperation, where cooperation diversity is achieved through both channel coding method and spatial diversity of relay selection. Codewords are partitioned into two parts which are source's data and parity, these are transmitted from source's antenna or selected relay's antenna. In this scheme, relay selection is performed in relay subset which consists of relay nodes that successfully decode source's data and parity is transmitted from selected relay node's antenna. If all the relay nodes are fail to decode source's data the source transmits its parity to the destination instead of the relay node. We derive the closed-form of bounds on BEP of this scheme based on Viterbi's upper bound. These results illustrate diversity gain with multiple relay nodes in coded cooperation and present the performance analysis of proposed scheme in numerical results.

Original languageEnglish
Title of host publication2010 International Conference on Information and Communication Technology Convergence, ICTC 2010
Pages234-238
Number of pages5
DOIs
Publication statusPublished - 2010 Dec 1
Event2010 International Conference on Information and Communication Technology Convergence, ICTC 2010 - Jeju, Korea, Republic of
Duration: 2010 Nov 172010 Nov 19

Other

Other2010 International Conference on Information and Communication Technology Convergence, ICTC 2010
CountryKorea, Republic of
CityJeju
Period10/11/1710/11/19

Fingerprint

Rayleigh fading
Fading channels
Antennas
Channel coding
Error probability

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Kim, S. I., & Heo, J. (2010). Performance analysis of opportunistic coded cooperation in rayleigh fading channels. In 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010 (pp. 234-238). [5674666] https://doi.org/10.1109/ICTC.2010.5674666

Performance analysis of opportunistic coded cooperation in rayleigh fading channels. / Kim, Sung Il; Heo, Jun.

2010 International Conference on Information and Communication Technology Convergence, ICTC 2010. 2010. p. 234-238 5674666.

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

Kim, SI & Heo, J 2010, Performance analysis of opportunistic coded cooperation in rayleigh fading channels. in 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010., 5674666, pp. 234-238, 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010, Jeju, Korea, Republic of, 10/11/17. https://doi.org/10.1109/ICTC.2010.5674666
Kim SI, Heo J. Performance analysis of opportunistic coded cooperation in rayleigh fading channels. In 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010. 2010. p. 234-238. 5674666 https://doi.org/10.1109/ICTC.2010.5674666
Kim, Sung Il ; Heo, Jun. / Performance analysis of opportunistic coded cooperation in rayleigh fading channels. 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010. 2010. pp. 234-238
@inproceedings{3caee2a171fd446da31532db616cd77f,
title = "Performance analysis of opportunistic coded cooperation in rayleigh fading channels",
abstract = "This paper is on the bit error probability (BEP) of opportunistic decode-and-forward (DF) relaying with coded cooperation, where cooperation diversity is achieved through both channel coding method and spatial diversity of relay selection. Codewords are partitioned into two parts which are source's data and parity, these are transmitted from source's antenna or selected relay's antenna. In this scheme, relay selection is performed in relay subset which consists of relay nodes that successfully decode source's data and parity is transmitted from selected relay node's antenna. If all the relay nodes are fail to decode source's data the source transmits its parity to the destination instead of the relay node. We derive the closed-form of bounds on BEP of this scheme based on Viterbi's upper bound. These results illustrate diversity gain with multiple relay nodes in coded cooperation and present the performance analysis of proposed scheme in numerical results.",
author = "Kim, {Sung Il} and Jun Heo",
year = "2010",
month = "12",
day = "1",
doi = "10.1109/ICTC.2010.5674666",
language = "English",
isbn = "9781424498062",
pages = "234--238",
booktitle = "2010 International Conference on Information and Communication Technology Convergence, ICTC 2010",

}

TY - GEN

T1 - Performance analysis of opportunistic coded cooperation in rayleigh fading channels

AU - Kim, Sung Il

AU - Heo, Jun

PY - 2010/12/1

Y1 - 2010/12/1

N2 - This paper is on the bit error probability (BEP) of opportunistic decode-and-forward (DF) relaying with coded cooperation, where cooperation diversity is achieved through both channel coding method and spatial diversity of relay selection. Codewords are partitioned into two parts which are source's data and parity, these are transmitted from source's antenna or selected relay's antenna. In this scheme, relay selection is performed in relay subset which consists of relay nodes that successfully decode source's data and parity is transmitted from selected relay node's antenna. If all the relay nodes are fail to decode source's data the source transmits its parity to the destination instead of the relay node. We derive the closed-form of bounds on BEP of this scheme based on Viterbi's upper bound. These results illustrate diversity gain with multiple relay nodes in coded cooperation and present the performance analysis of proposed scheme in numerical results.

AB - This paper is on the bit error probability (BEP) of opportunistic decode-and-forward (DF) relaying with coded cooperation, where cooperation diversity is achieved through both channel coding method and spatial diversity of relay selection. Codewords are partitioned into two parts which are source's data and parity, these are transmitted from source's antenna or selected relay's antenna. In this scheme, relay selection is performed in relay subset which consists of relay nodes that successfully decode source's data and parity is transmitted from selected relay node's antenna. If all the relay nodes are fail to decode source's data the source transmits its parity to the destination instead of the relay node. We derive the closed-form of bounds on BEP of this scheme based on Viterbi's upper bound. These results illustrate diversity gain with multiple relay nodes in coded cooperation and present the performance analysis of proposed scheme in numerical results.

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

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

U2 - 10.1109/ICTC.2010.5674666

DO - 10.1109/ICTC.2010.5674666

M3 - Conference contribution

AN - SCOPUS:78751537439

SN - 9781424498062

SP - 234

EP - 238

BT - 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010

ER -