基于分布式卷积编码的多源协作网络

Renqiu Wang, Wanlun Zhao, G. Giannakis
{"title":"基于分布式卷积编码的多源协作网络","authors":"Renqiu Wang, Wanlun Zhao, G. Giannakis","doi":"10.1109/ACSSC.2005.1599920","DOIUrl":null,"url":null,"abstract":"Cooperative diversity, enabled by communicators willing to collaborate, offers an effective way of mitigating slow fading propagation effects. Recently, multi-source cooperation (MSC) has been introduced to provide higher diversity and code rates relative to cooperative schemes that rely on either amplify-and-forward or regeneration of information at relay nodes. In this paper, we develop a distributed convolutionally coded (DCC) MSC system. We show that in a cooperative network with binary transmission among K active users and M idle users, the maximum diversity order is min(dmin ,α ) for any MSC scheme with code rateR and minimum (free) Hamming distance dmin ,w hereα =1 +� L(1 − R)� is the maximum possible diversity order provided by L independent Rayleigh channel gains. Notice that L = K, if cooperation takes place only between active users; and L = K + M ,i fM idle users also serve as relays. Compared to MSC with block coding, our DCC-MSC scheme is more effective with long codewords, when maximum likelihood decoding can be implemented using Viterbi's algorithm. We also design interleavers to maximize the diversity of the error event with minimum distance. Simu- lations verify that DCC-MSC can improve system performance markedly.","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Multi-Source Cooperative Networks with Distributed Convolutional Coding\",\"authors\":\"Renqiu Wang, Wanlun Zhao, G. Giannakis\",\"doi\":\"10.1109/ACSSC.2005.1599920\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cooperative diversity, enabled by communicators willing to collaborate, offers an effective way of mitigating slow fading propagation effects. Recently, multi-source cooperation (MSC) has been introduced to provide higher diversity and code rates relative to cooperative schemes that rely on either amplify-and-forward or regeneration of information at relay nodes. In this paper, we develop a distributed convolutionally coded (DCC) MSC system. We show that in a cooperative network with binary transmission among K active users and M idle users, the maximum diversity order is min(dmin ,α ) for any MSC scheme with code rateR and minimum (free) Hamming distance dmin ,w hereα =1 +� L(1 − R)� is the maximum possible diversity order provided by L independent Rayleigh channel gains. Notice that L = K, if cooperation takes place only between active users; and L = K + M ,i fM idle users also serve as relays. Compared to MSC with block coding, our DCC-MSC scheme is more effective with long codewords, when maximum likelihood decoding can be implemented using Viterbi's algorithm. We also design interleavers to maximize the diversity of the error event with minimum distance. Simu- lations verify that DCC-MSC can improve system performance markedly.\",\"PeriodicalId\":326489,\"journal\":{\"name\":\"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSSC.2005.1599920\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2005.1599920","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

协作分集是一种有效的缓解慢衰落传播效应的方法,它是由愿意协作的通信人员实现的。最近,多源合作(MSC)被引入,相对于依赖中继节点的信息放大转发或再生的合作方案,它提供了更高的分集和码率。在本文中,我们开发了一个分布式卷积编码(DCC) MSC系统。我们证明了在一个由K个活跃用户和M个空闲用户进行二进制传输的协作网络中,对于任何具有码率和最小(自由)汉明距离dmin的MSC方案,最大分集阶数为min(dmin,α),其中α =1 + L(1−R)是由L个独立瑞利信道增益提供的最大可能分集阶数。注意,如果合作只发生在活跃用户之间,则L = K;L = K + M,i fM空闲用户也作为继电器。与分组编码的MSC相比,当使用Viterbi算法实现最大似然解码时,我们的DCC-MSC方案在长码字时更有效。我们还设计了交织器,使误差事件的多样性以最小的距离最大化。仿真结果表明,DCC-MSC能显著提高系统性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-Source Cooperative Networks with Distributed Convolutional Coding
Cooperative diversity, enabled by communicators willing to collaborate, offers an effective way of mitigating slow fading propagation effects. Recently, multi-source cooperation (MSC) has been introduced to provide higher diversity and code rates relative to cooperative schemes that rely on either amplify-and-forward or regeneration of information at relay nodes. In this paper, we develop a distributed convolutionally coded (DCC) MSC system. We show that in a cooperative network with binary transmission among K active users and M idle users, the maximum diversity order is min(dmin ,α ) for any MSC scheme with code rateR and minimum (free) Hamming distance dmin ,w hereα =1 +� L(1 − R)� is the maximum possible diversity order provided by L independent Rayleigh channel gains. Notice that L = K, if cooperation takes place only between active users; and L = K + M ,i fM idle users also serve as relays. Compared to MSC with block coding, our DCC-MSC scheme is more effective with long codewords, when maximum likelihood decoding can be implemented using Viterbi's algorithm. We also design interleavers to maximize the diversity of the error event with minimum distance. Simu- lations verify that DCC-MSC can improve system performance markedly.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信