...
首页> 外文期刊>Information Theory, IEEE Transactions on >Interference Alignment-Based Sum Capacity Bounds for Random Dense Gaussian Interference Networks
【24h】

Interference Alignment-Based Sum Capacity Bounds for Random Dense Gaussian Interference Networks

机译:密集密集高斯干扰网络基于干扰对准的总和能力界

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

We consider a dense $K$ user Gaussian interference network formed by paired transmitters and receivers placed independently at random in a fixed spatial region. Under natural conditions on the node position distributions and signal attenuation, we prove convergence in probability of the average per-user capacity $ C_{Sigma }/K$ to $ {{ 1}over { 2}} {BBE } log (1 + 2 {rm {SNR}})$. The achievability result follows directly from results based on an interference alignment scheme presented in recent work of Nazer Our main contribution comes through an upper bound, motivated by ideas of “bottleneck capacity” developed in recent work of Jafar. By controlling the physical location of transmitter–receiver pairs, we can match a large proportion of these pairs to form so-called $epsilon $-bottleneck links, with consequent control of the sum capacity.
机译:我们考虑由成对的发射器和接收器组成的密集的$ K $用户高斯干扰网络,这些成对的发射器和接收器随机独立地放置在固定的空间区域中。在节点位置分布和信号衰减的自然条件下,我们证明了平均每用户容量$ C_ {Sigma} / K $到$ {{1}超过{2}} {BBE} log的概率收敛(1 + 2 {rm {SNR}})$。可实现性的结果直接来自Nazer最近的工作中提出的基于干扰对准方案的结果。我们的主要贡献来自上限,其受到Jafar最近工作中提出的“瓶颈容量”思想的激励。通过控制收发器对的物理位置,我们可以匹配这些对中的很大一部分,以形成所谓的“ε-瓶颈”链接,从而控制总容量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号