Resource allocation for MIMO multi-relay systems with zero-forcing relaying

Xueyi Li, Liping Luo, Guangchi Zhang, Qi Zhang, J. Qin
{"title":"Resource allocation for MIMO multi-relay systems with zero-forcing relaying","authors":"Xueyi Li, Liping Luo, Guangchi Zhang, Qi Zhang, J. Qin","doi":"10.1109/SOLI.2013.6611399","DOIUrl":null,"url":null,"abstract":"In this paper, we consider a two-hop multiple-input multiple-output (MIMO) multiple relays communication networks, where each relay employs the zero-forcing (ZF) relaying scheme, we assume that the perfect channel state information (CSI) is available at the source, the destination and the relays. We propose a total relays power allocation (PA) scheme with the sum relays transmit power constraint to maximize the average system capacity. Since the original PA optimization problem is not convex, it is difficult to derive an analytical solution, so we propose to simplify the problem by employing the relaxed power constraint which is slightly higher than the actual sum relays power, then we derive the closed-form solution. The Monte Carlo simulation results shown that our proposed joint PA scheme significantly improves the system capacity compared with the conventional ZF relaying scheme.","PeriodicalId":147180,"journal":{"name":"Proceedings of 2013 IEEE International Conference on Service Operations and Logistics, and Informatics","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 2013 IEEE International Conference on Service Operations and Logistics, and Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOLI.2013.6611399","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this paper, we consider a two-hop multiple-input multiple-output (MIMO) multiple relays communication networks, where each relay employs the zero-forcing (ZF) relaying scheme, we assume that the perfect channel state information (CSI) is available at the source, the destination and the relays. We propose a total relays power allocation (PA) scheme with the sum relays transmit power constraint to maximize the average system capacity. Since the original PA optimization problem is not convex, it is difficult to derive an analytical solution, so we propose to simplify the problem by employing the relaxed power constraint which is slightly higher than the actual sum relays power, then we derive the closed-form solution. The Monte Carlo simulation results shown that our proposed joint PA scheme significantly improves the system capacity compared with the conventional ZF relaying scheme.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
带零强制中继的MIMO多中继系统资源分配
在本文中,我们考虑了一个两跳多输入多输出(MIMO)多中继通信网络,其中每个中继都采用零强制(ZF)中继方案,我们假设在源、目的和中继上都有完美的信道状态信息(CSI)可用。为了最大限度地提高系统的平均容量,提出了一种具有总中继发送功率约束的总中继功率分配方案。由于原PA优化问题不是凸的,很难推导出解析解,因此我们提出采用略高于继电器实际功率总和的放松功率约束对问题进行简化,然后推导出封闭形式的解。蒙特卡罗仿真结果表明,与传统的ZF继电方案相比,我们提出的联合PA方案显著提高了系统容量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An empirical study of applying Kano model and TRIZ business evolution trends to improve E-commerce service quality Value capture and value creation in high-velocity networked environments Research on personnel assignment in joint operation analysis with a large number of tasks Empirical analysis on operational efficiency and its influential factors of road transportation industry of China Study on revenue sharing contract mechanism in supply chain under non-cooperative decision-making
×
引用
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