瑞利衰落信道中机会编码合作的性能分析

Sung-Il Kim, J. Heo
{"title":"瑞利衰落信道中机会编码合作的性能分析","authors":"Sung-Il Kim, J. Heo","doi":"10.1109/ICTC.2010.5674666","DOIUrl":null,"url":null,"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.","PeriodicalId":149198,"journal":{"name":"2010 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Performance analysis of opportunistic coded cooperation in Rayleigh fading channels\",\"authors\":\"Sung-Il Kim, J. Heo\",\"doi\":\"10.1109/ICTC.2010.5674666\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":149198,\"journal\":{\"name\":\"2010 International Conference on Information and Communication Technology Convergence (ICTC)\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Information and Communication Technology Convergence (ICTC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTC.2010.5674666\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Information and Communication Technology Convergence (ICTC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTC.2010.5674666","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了具有编码合作的机会式DF中继的误码概率(BEP),其中通过信道编码方法和中继选择的空间分集来实现合作分集。码字分为源数据和奇偶校验两部分,从源天线或选定的中继天线发射。在该方案中,中继选择在中继子集中进行,中继子集由成功解码源数据的中继节点组成,并从所选中继节点的天线发射奇偶校验。如果所有中继节点都无法解码源的数据,则源将其奇偶校验发送到目的节点,而不是中继节点。在Viterbi上界的基础上,导出了该方案的边界的闭形式。这些结果说明了编码合作中多个中继节点的分集增益,并用数值结果对所提出的方案进行了性能分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Performance analysis of opportunistic coded cooperation in Rayleigh fading channels
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Compatibility analysis of in-band digital radio systems in interference channel environment Load-aware beamforming and association for system-wide utility maximization Experiences with discriminating TCP loss using K-Means clustering Relation between the number of broadcasts of probe packets and energy consumption in multi-hop wireless networks A nondisruptive multi-path handoff scheme for peer-to-peer live video streaming
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1