Fast power control for amplify-and-forward multiple-antenna bidirectional relays

E. Zandi, Guido Dartmann, G. Ascheid, R. Mathar
{"title":"Fast power control for amplify-and-forward multiple-antenna bidirectional relays","authors":"E. Zandi, Guido Dartmann, G. Ascheid, R. Mathar","doi":"10.1109/IWCIT.2015.7140217","DOIUrl":null,"url":null,"abstract":"Cooperative relay communication is an interesting area of research, since it is to enhance data rate and coverage in wireless networks. In this paper, we propose a method to optimize power allocation strategy in an amplify-and-forward relay system. Our objective is to attain a max-min fairness within co-channel users. To reduce the complexity we maximize the upper bound on the performance. The reason is that this bound is observed to be tight in low noise conditions. Therefore, one achievement of this work is separating the problem of relay pre-coding design from power allocation. Then, the power control is done iteratively via the proposed low-complexity algorithm whose convergence is proven. The relay precoder can be subsequently designed via existing methods, such as semidefinite programming, nonetheless, it is beyond the main focus of the current work. The optimality of the proposed power allocation algorithm is very hard to mathematically prove. Yet, the simulation results are promising.","PeriodicalId":166939,"journal":{"name":"2015 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Iran Workshop on Communication and Information Theory (IWCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWCIT.2015.7140217","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Cooperative relay communication is an interesting area of research, since it is to enhance data rate and coverage in wireless networks. In this paper, we propose a method to optimize power allocation strategy in an amplify-and-forward relay system. Our objective is to attain a max-min fairness within co-channel users. To reduce the complexity we maximize the upper bound on the performance. The reason is that this bound is observed to be tight in low noise conditions. Therefore, one achievement of this work is separating the problem of relay pre-coding design from power allocation. Then, the power control is done iteratively via the proposed low-complexity algorithm whose convergence is proven. The relay precoder can be subsequently designed via existing methods, such as semidefinite programming, nonetheless, it is beyond the main focus of the current work. The optimality of the proposed power allocation algorithm is very hard to mathematically prove. Yet, the simulation results are promising.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
放大前向多天线双向继电器的快速功率控制
协作中继通信是无线网络中提高数据传输速率和覆盖范围的重要技术之一。本文提出了一种优化放大前向继电器系统功率分配策略的方法。我们的目标是在同信道用户中实现最大最小公平。为了降低复杂度,我们最大化了性能的上界。原因是在低噪声条件下观察到这个界限是紧密的。因此,这项工作的一个成果是将继电器预编码设计问题与功率分配问题分离开来。然后,利用所提出的低复杂度算法进行功率迭代控制,并证明了算法的收敛性。继电预编码器可以通过半确定编程等现有方法进行设计,但这超出了当前工作的重点。所提出的功率分配算法的最优性很难用数学方法证明。然而,仿真结果是有希望的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A novel approach to mathematical multiple criteria decision making methods based on information theoretic measures An iterative bit flipping based decoding algorithm for LDPC codes Statistical characterization of the output of nonlinear power-cubic detection unit for ultrashort light pulse communication in the presence of Gaussian noise Perfect interference alignment utilizing channel structure One-level LDPC lattice codes for the relay channels
×
引用
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