Capacity and power scaling laws for finite antenna amplify-and-forward relay networks

D. Simmons, J. Coon, N. Warsi
{"title":"Capacity and power scaling laws for finite antenna amplify-and-forward relay networks","authors":"D. Simmons, J. Coon, N. Warsi","doi":"10.1109/ISIT.2016.7541621","DOIUrl":null,"url":null,"abstract":"A novel framework is presented that can be used to study the capacity and power scaling of linear multiple-input multiple-output (MIMO) d×d antenna amplify-and-forward (AF) relay networks. In particular, we model these networks as random dynamical systems (RDS) and calculate their d Lyapunov exponents. Our framework can be applied to systems with any per-hop channel fading distribution provided the expected logarithm of the channel matrices' norms are finite; in this contribution all of our results relate specifically to Rayleigh fading. Our main results are twofold: 1) the total transmit power at the nth node will follow a deterministic trajectory through the network governed by the network's maximum Lyapunov exponent, 2) the capacity of the ith eigenchannel at the nth node will follow a deterministic trajectory through the network governed by the network's ith Lyapunov exponent. Before concluding, we present some numerical examples to highlight the theory.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2016.7541621","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

A novel framework is presented that can be used to study the capacity and power scaling of linear multiple-input multiple-output (MIMO) d×d antenna amplify-and-forward (AF) relay networks. In particular, we model these networks as random dynamical systems (RDS) and calculate their d Lyapunov exponents. Our framework can be applied to systems with any per-hop channel fading distribution provided the expected logarithm of the channel matrices' norms are finite; in this contribution all of our results relate specifically to Rayleigh fading. Our main results are twofold: 1) the total transmit power at the nth node will follow a deterministic trajectory through the network governed by the network's maximum Lyapunov exponent, 2) the capacity of the ith eigenchannel at the nth node will follow a deterministic trajectory through the network governed by the network's ith Lyapunov exponent. Before concluding, we present some numerical examples to highlight the theory.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
有限天线放大转发中继网络的容量和功率比例规律
提出了一种新的框架,可用于研究线性多输入多输出(MIMO) d×d天线放大前向(AF)中继网络的容量和功率缩放。特别地,我们将这些网络建模为随机动力系统(RDS),并计算它们的d李雅普诺夫指数。我们的框架可以应用于任何每跳信道衰落分布的系统,只要信道矩阵范数的期望对数是有限的;在这个贡献中,我们所有的结果都与瑞利衰落有关。我们的主要结果是双重的:1)第n个节点的总发射功率将遵循由网络最大李雅普诺夫指数控制的网络的确定性轨迹,2)第n个节点的第i个特征信道的容量将遵循由网络第i李雅普诺夫指数控制的网络的确定性轨迹。在结束之前,我们给出了一些数值例子来突出这一理论。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Rank Preserving Code-based Signature Buddhism and the Religious Other Statistical Inference and Exact Saddle Point Approximations Topological structures on DMC spaces A computer-aided investigation on the fundamental limits of caching
×
引用
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