Sub-Optimum Detection Scheme with Double the Full Diversity for Asynchronous Cooperative Relay Network

A. Elazreg, A. Kharaz
{"title":"Sub-Optimum Detection Scheme with Double the Full Diversity for Asynchronous Cooperative Relay Network","authors":"A. Elazreg, A. Kharaz","doi":"10.1109/IWCMC.2019.8766693","DOIUrl":null,"url":null,"abstract":"Distributed space time block coding in wireless cooperative relay networks have attracted significant interest due to its bandwidth efficiency and high reliability. To achieve full diversity and full data transmission rate, most researchers assumed perfect timing synchronization within the network. However, synchronisation in wireless cooperative relay networks is difficult in real environment due to the distributed nature of cooperative relay nodes. This paper first, deals with designing an efficient distributed space time block coding system to obtain double the full diversity and full data transmission rate for asynchronous cooperative relay networks. The second part deal with developing a low-level computational complexity sub-optimum detection scheme to overcome the imperfect synchronisation issues arising among the relay nodes. The computational complexity level depends only upon the constellation size. Analytical analysis and simulation results show that the double the full diversity with full data transmission rate are achieved. The proposed sub-optimum detection scheme can also effectively eliminate the intersymbol interference induced by the lack of synchronisation between the relay nodes at the destination node.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWCMC.2019.8766693","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Distributed space time block coding in wireless cooperative relay networks have attracted significant interest due to its bandwidth efficiency and high reliability. To achieve full diversity and full data transmission rate, most researchers assumed perfect timing synchronization within the network. However, synchronisation in wireless cooperative relay networks is difficult in real environment due to the distributed nature of cooperative relay nodes. This paper first, deals with designing an efficient distributed space time block coding system to obtain double the full diversity and full data transmission rate for asynchronous cooperative relay networks. The second part deal with developing a low-level computational complexity sub-optimum detection scheme to overcome the imperfect synchronisation issues arising among the relay nodes. The computational complexity level depends only upon the constellation size. Analytical analysis and simulation results show that the double the full diversity with full data transmission rate are achieved. The proposed sub-optimum detection scheme can also effectively eliminate the intersymbol interference induced by the lack of synchronisation between the relay nodes at the destination node.
异步协同中继网络的双分集次优检测方案
分布式空时分组编码以其高带宽效率和高可靠性在无线协同中继网络中引起了广泛的关注。为了实现充分的分集和充分的数据传输速率,大多数研究人员都假设网络内的完全定时同步。然而,由于协作中继节点的分布式特性,无线协作中继网络在实际环境中难以实现同步。本文首先设计了一种高效的分布式时空分组编码系统,以实现异步协同中继网络双倍的全分集和全数据传输速率。第二部分涉及开发一种低水平计算复杂性次优检测方案,以克服中继节点之间出现的不完美同步问题。计算复杂度只与星座大小有关。分析和仿真结果表明,该方法在全数据传输速率下实现了双倍的全分集。所提出的次优检测方案还能有效消除目的节点中继节点间不同步所引起的码间干扰。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信