基于离散随机算法的联合MMSE发射分集优化与中继选择

P. Clarke, R. D. Lamare
{"title":"基于离散随机算法的联合MMSE发射分集优化与中继选择","authors":"P. Clarke, R. D. Lamare","doi":"10.1109/GreenCom.2011.6082502","DOIUrl":null,"url":null,"abstract":"This paper presents joint transmit diversity selection (TDS) and relay selection (RS) algorithms based on discrete stochastic optimization for a multi-relay cooperative MIMO system. A two-phase, decode-and-forward (DF) network with a non-negligible direct path is considered where linear minimum mean square error (MMSE) receivers are used at all nodes. TDS and RS are performed jointly with continuous least squares channel estimation and no transmit preprocessing is required. RS removes relays from consideration by TDS and generates an optimized set from which TDS is made, improving the convergence, performance, complexity and energy consumption of the TDS process whilst maintaining low feedback requirements. The performance of the proposed schemes is evaluated via mean square error (MSE), bit-error rate (BER) and complexity comparisons. The results show that the proposed schemes outperform cooperative transmission with and without TDS in terms of diversity, MSE and BER, and match that of the optimum exhaustive solutions whilst making considerable complexity and energy savings.","PeriodicalId":179862,"journal":{"name":"2011 IEEE Online Conference on Green Communications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Joint MMSE transmit diversity optimization and relay selection for cooperative MIMO systems using discrete stochastic algorithms\",\"authors\":\"P. Clarke, R. D. Lamare\",\"doi\":\"10.1109/GreenCom.2011.6082502\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents joint transmit diversity selection (TDS) and relay selection (RS) algorithms based on discrete stochastic optimization for a multi-relay cooperative MIMO system. A two-phase, decode-and-forward (DF) network with a non-negligible direct path is considered where linear minimum mean square error (MMSE) receivers are used at all nodes. TDS and RS are performed jointly with continuous least squares channel estimation and no transmit preprocessing is required. RS removes relays from consideration by TDS and generates an optimized set from which TDS is made, improving the convergence, performance, complexity and energy consumption of the TDS process whilst maintaining low feedback requirements. The performance of the proposed schemes is evaluated via mean square error (MSE), bit-error rate (BER) and complexity comparisons. The results show that the proposed schemes outperform cooperative transmission with and without TDS in terms of diversity, MSE and BER, and match that of the optimum exhaustive solutions whilst making considerable complexity and energy savings.\",\"PeriodicalId\":179862,\"journal\":{\"name\":\"2011 IEEE Online Conference on Green Communications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE Online Conference on Green Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GreenCom.2011.6082502\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE Online Conference on Green Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GreenCom.2011.6082502","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

针对多中继协同MIMO系统,提出了基于离散随机优化的联合发射分集选择(TDS)和中继选择(RS)算法。考虑了一种具有不可忽略直接路径的两相解码转发(DF)网络,其中所有节点都使用线性最小均方误差(MMSE)接收器。TDS和RS结合连续最小二乘信道估计,不需要进行传输预处理。RS将继电器从TDS的考虑中移除,并生成一组优化的TDS,从而提高TDS过程的收敛性、性能、复杂性和能耗,同时保持较低的反馈要求。通过均方误差(MSE)、误码率(BER)和复杂度比较对所提方案的性能进行了评价。结果表明,所提出的方案在分集、MSE和BER方面都优于有TDS和没有TDS的合作传输,并与最优的详尽解决方案相匹配,同时具有相当的复杂性和节能性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Joint MMSE transmit diversity optimization and relay selection for cooperative MIMO systems using discrete stochastic algorithms
This paper presents joint transmit diversity selection (TDS) and relay selection (RS) algorithms based on discrete stochastic optimization for a multi-relay cooperative MIMO system. A two-phase, decode-and-forward (DF) network with a non-negligible direct path is considered where linear minimum mean square error (MMSE) receivers are used at all nodes. TDS and RS are performed jointly with continuous least squares channel estimation and no transmit preprocessing is required. RS removes relays from consideration by TDS and generates an optimized set from which TDS is made, improving the convergence, performance, complexity and energy consumption of the TDS process whilst maintaining low feedback requirements. The performance of the proposed schemes is evaluated via mean square error (MSE), bit-error rate (BER) and complexity comparisons. The results show that the proposed schemes outperform cooperative transmission with and without TDS in terms of diversity, MSE and BER, and match that of the optimum exhaustive solutions whilst making considerable complexity and energy savings.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信