中继网络波束形成权重的分布式盲自适应计算

C. Tsinos, Evangelos Vlachos, K. Berberidis
{"title":"中继网络波束形成权重的分布式盲自适应计算","authors":"C. Tsinos, Evangelos Vlachos, K. Berberidis","doi":"10.1109/PIMRC.2013.6666201","DOIUrl":null,"url":null,"abstract":"In the present paper, we propose two novel algorithms which enable the relay cooperation for the distributed computation of the beamforming weights in a blind and adaptive manner, without the need to forward the data to a fusion center. In the first scheme, the beamforming vector is computed through minimization of the total transmit power subject to a receiver quality-of-service constraint (QoS). In the second scheme, the beamforming weights are obtained through maximization of the receiver signal-to-noise-ratio (SNR) subject to a total transmit power constraint. The proposed approaches distribute the computational overhead equally among the relay nodes and achieve close performance to the one of the optimal beamforming solutions. Note, that the aforementioned optimal solutions are derived assuming perfect channel state information at the relays' side. In order to verify the performance of the proposed approaches, indicative simulations were carried out for static and time-varying channels.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"329 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Distributed blind adaptive computation of beamforming weights for relay networks\",\"authors\":\"C. Tsinos, Evangelos Vlachos, K. Berberidis\",\"doi\":\"10.1109/PIMRC.2013.6666201\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the present paper, we propose two novel algorithms which enable the relay cooperation for the distributed computation of the beamforming weights in a blind and adaptive manner, without the need to forward the data to a fusion center. In the first scheme, the beamforming vector is computed through minimization of the total transmit power subject to a receiver quality-of-service constraint (QoS). In the second scheme, the beamforming weights are obtained through maximization of the receiver signal-to-noise-ratio (SNR) subject to a total transmit power constraint. The proposed approaches distribute the computational overhead equally among the relay nodes and achieve close performance to the one of the optimal beamforming solutions. Note, that the aforementioned optimal solutions are derived assuming perfect channel state information at the relays' side. In order to verify the performance of the proposed approaches, indicative simulations were carried out for static and time-varying channels.\",\"PeriodicalId\":210993,\"journal\":{\"name\":\"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)\",\"volume\":\"329 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIMRC.2013.6666201\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2013.6666201","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

在本文中,我们提出了两种新的算法,使中继协作能够以盲和自适应的方式进行波束形成权重的分布式计算,而无需将数据转发到融合中心。在第一种方案中,根据接收机服务质量约束(QoS),通过最小化总发射功率来计算波束形成矢量。在第二种方案中,在总发射功率约束下,通过最大化接收机信噪比(SNR)来获得波束形成权重。所提出的方法在中继节点之间平均分配计算开销,并获得接近最优波束形成方案的性能。注意,上述最优解是在假定中继端的信道状态信息完美的情况下推导出来的。为了验证所提方法的性能,对静态信道和时变信道进行了指示性仿真。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Distributed blind adaptive computation of beamforming weights for relay networks
In the present paper, we propose two novel algorithms which enable the relay cooperation for the distributed computation of the beamforming weights in a blind and adaptive manner, without the need to forward the data to a fusion center. In the first scheme, the beamforming vector is computed through minimization of the total transmit power subject to a receiver quality-of-service constraint (QoS). In the second scheme, the beamforming weights are obtained through maximization of the receiver signal-to-noise-ratio (SNR) subject to a total transmit power constraint. The proposed approaches distribute the computational overhead equally among the relay nodes and achieve close performance to the one of the optimal beamforming solutions. Note, that the aforementioned optimal solutions are derived assuming perfect channel state information at the relays' side. In order to verify the performance of the proposed approaches, indicative simulations were carried out for static and time-varying channels.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Experimental validation of fog models for FSO under laboratory controlled conditions EWMA-triggered waterfilling for reduced-complexity resource management in ad-hoc connections Sleep scheduling in IEEE 802.16j relay networks A comparison of implicit and explicit channel feedback methods for MU-MIMO WLAN systems Optimization of collaborating secondary users in a cooperative sensing under noise uncertainty
×
引用
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