Cooperative Balanced Space-Time Block Codes for Relay Networks

A. Eksim, M. Çelebi
{"title":"Cooperative Balanced Space-Time Block Codes for Relay Networks","authors":"A. Eksim, M. Çelebi","doi":"10.1109/SIU.2007.4298836","DOIUrl":null,"url":null,"abstract":"In this paper, a novel coding method for cooperative relay networks is proposed, which guarantees full diversity for any number of mobile relays with minimal delay, provided that few bits of feedback from the destination to the source and relays are available. As in the case of orthogonal space-time block codes, all transmitted symbols are separately decoded both in the relays and the destination. So, decoding complexity grows linearly. Many of the proposed solutions in the literature are distributed space-time codes which are designed limited number of relays. The proposed scheme has better signal-to-noise ratio improvement with respect to relay selection scheme for N relays present in the wireless system. Moreover, it requires minimal amount of delay. Lastly, the new method satisfies power consumption fairness among relay terminals and requires no knowledge of topology information.","PeriodicalId":315147,"journal":{"name":"2007 IEEE 15th Signal Processing and Communications Applications","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE 15th Signal Processing and Communications Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIU.2007.4298836","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, a novel coding method for cooperative relay networks is proposed, which guarantees full diversity for any number of mobile relays with minimal delay, provided that few bits of feedback from the destination to the source and relays are available. As in the case of orthogonal space-time block codes, all transmitted symbols are separately decoded both in the relays and the destination. So, decoding complexity grows linearly. Many of the proposed solutions in the literature are distributed space-time codes which are designed limited number of relays. The proposed scheme has better signal-to-noise ratio improvement with respect to relay selection scheme for N relays present in the wireless system. Moreover, it requires minimal amount of delay. Lastly, the new method satisfies power consumption fairness among relay terminals and requires no knowledge of topology information.
中继网络协同均衡空时分组码
本文提出了一种新颖的中继网络编码方法,该方法可以保证任意数量的移动中继在最小延迟的情况下具有完全的分集性,且目标端到源端和中继端的反馈信息较少。在正交空时分组码的情况下,所有传输的符号在中继和目的地都是分开解码的。所以,解码复杂度是线性增长的。文献中提出的许多解决方案是分布式空时码,设计了有限数量的继电器。相对于无线系统中存在的N个中继的中继选择方案,本方案具有更好的信噪比改善。此外,它需要最小的延迟。最后,该方法满足了中继终端间的功耗公平性,且不需要了解拓扑信息。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信