首页> 外文会议> >Iterative Power Control and Resource Allocation for General Interference Functions - A Superlinearly Convergent Algorithm
【24h】

Iterative Power Control and Resource Allocation for General Interference Functions - A Superlinearly Convergent Algorithm

机译:通用干扰函数的迭代功率控制和资源分配-一种超线性收敛算法。

获取原文

摘要

We consider a multiuser wireless network, where users are coupled by interference. Thus, transmission powers should be optimized jointly with the receive strategy, like beamforming, CDMA, base station assignment, etc. We study the problem of minimizing the total transmission power while maintaining individual QoS values for all users. This problem can be solved by the fixed-point iteration proposed by R. D. Yates (1995) as well as by a recently proposed matrix-based iteration by the authors (2006). It was observed by numerical simulations that the matrix-based iteration has interesting numerical properties, and achieves the global optimum in only a few steps. However, an analytical investigation of the convergence behavior has been an open problem so far. In this paper, we show that the matrix-based iteration can be reformulated as a Newton-type iteration of a convex function, which is not continuously differentiable. This property is caused by ambiguous receive strategies, resulting in ambiguous representations of the interference functions. By exploiting the special structure of the problem, we show that the iteration has super-linear convergence
机译:我们考虑一个多用户无线网络,用户之间会受到干扰。因此,传输功率应与诸如波束成形,CDMA,基站分配等接收策略一起进行优化。我们研究了在使所有用户保持单独的QoS值的同时最小化总传输功率的问题。这个问题可以通过R. D. Yates(1995)提出的定点迭代以及作者(2006)最近提出的基于矩阵的迭代来解决。通过数值模拟观察到,基于矩阵的迭代具有有趣的数值属性,并且仅需几个步骤即可实现全局最优。但是,到目前为止,对收敛行为的分析研究一直是一个悬而未决的问题。在本文中,我们表明基于矩阵的迭代可以重新构造为凸函数的牛顿型迭代,这是无法连续微分的。此属性是由模糊的接收策略引起的,从而导致了干扰函数的模糊表示。通过利用问题的特殊结构,我们表明迭代具有超线性收敛

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号