Modeling and analysis of ergodic capacity in network MIMO systems

Kianoush Hosseini, Wei Yu, R. Adve
{"title":"Modeling and analysis of ergodic capacity in network MIMO systems","authors":"Kianoush Hosseini, Wei Yu, R. Adve","doi":"10.1109/GLOCOMW.2014.7063532","DOIUrl":null,"url":null,"abstract":"This paper studies the downlink ergodic capacity of a network multiple-input multiple-output (MIMO) system. The system model includes base-stations (BSs) randomly distributed with a fixed density, each equipped with M antennas, scheduling K single-antenna users, and forming cooperating clusters via perfect backhaul links. Intra-cluster interference is eliminated by joint transmission using zero-forcing beamforming assuming perfect channel state information (CSI), while inter-cluster interference remains. This paper shows that although coordinating a large cluster of BSs eliminates strong interferers, the coordination gain depends on the network load factor, defined as the relative ratio of M and K. In particular, we show that with M = K, increasing the coordination cluster size is only beneficial for the cluster-edge users, while degrading the ergodic capacity of the users located close to the cluster center. In contrast, when M > K, increasing the cluster size potentially improves every user's ergodic capacity. In the second part of this paper, we use tools from stochastic geometry to account for random BS locations in characterizing the performance of network MIMO systems. In this setting, we model the BS locations according to a homogeneous Poisson point process with a fixed density, and propose tractable, yet accurate, distribution functions for the signal and inter-cluster interference powers. We then derive an efficiently computable expression for the user ergodic capacity as a function of the distance between a user and the cluster center.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Globecom Workshops (GC Wkshps)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOMW.2014.7063532","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

This paper studies the downlink ergodic capacity of a network multiple-input multiple-output (MIMO) system. The system model includes base-stations (BSs) randomly distributed with a fixed density, each equipped with M antennas, scheduling K single-antenna users, and forming cooperating clusters via perfect backhaul links. Intra-cluster interference is eliminated by joint transmission using zero-forcing beamforming assuming perfect channel state information (CSI), while inter-cluster interference remains. This paper shows that although coordinating a large cluster of BSs eliminates strong interferers, the coordination gain depends on the network load factor, defined as the relative ratio of M and K. In particular, we show that with M = K, increasing the coordination cluster size is only beneficial for the cluster-edge users, while degrading the ergodic capacity of the users located close to the cluster center. In contrast, when M > K, increasing the cluster size potentially improves every user's ergodic capacity. In the second part of this paper, we use tools from stochastic geometry to account for random BS locations in characterizing the performance of network MIMO systems. In this setting, we model the BS locations according to a homogeneous Poisson point process with a fixed density, and propose tractable, yet accurate, distribution functions for the signal and inter-cluster interference powers. We then derive an efficiently computable expression for the user ergodic capacity as a function of the distance between a user and the cluster center.
网络MIMO系统遍历容量的建模与分析
研究了网络多输入多输出(MIMO)系统的下行遍历容量。系统模型包括固定密度随机分布的基站(BSs),每个基站配置M个天线,调度K个单天线用户,通过完美回程链路形成协作集群。在假设完美信道状态信息(CSI)的情况下,采用零强迫波束形成联合传输消除了簇内干扰,同时保留了簇间干扰。本文表明,虽然协调大型BSs集群可以消除强干扰,但协调增益取决于网络负载因子,即M与K的相对比值。特别是,当M = K时,增加协调集群规模只对集群边缘用户有利,而降低靠近集群中心的用户的遍历能力。相反,当M > K时,增加集群大小可能会提高每个用户的遍历能力。在本文的第二部分,我们使用随机几何的工具来解释网络MIMO系统性能表征中的随机BS位置。在这种情况下,我们根据具有固定密度的齐次泊松点过程对BS位置进行建模,并提出了易于处理且准确的信号和簇间干扰功率分布函数。然后,我们推导出用户遍历能力作为用户到集群中心之间距离的函数的有效可计算表达式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信