arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0509043cs.ITmath.IT
收藏

多用户CDMA信道的最优功率控制

Optimal Power Control for Multiuser CDMA Channels

Anke Feiten, Rudolf Mathar

摘要:

在本文中,我们将功率区域定义为K个用户的功率分配集合,使得每个用户都满足最小信号干扰比(SIR)。在具有固定线性接收机和签名序列的多用户CDMA系统中,SIR被建模。我们证明了幂区域在线性和对数尺度上是凸的。此外,它还有一个分量最小元素。功率约束被包括在与所有可行功率调整的集合的交集中。在这个框架中,我们的目标是通过最小化一个分量单调泛函来最小化总功耗。如果可行功率域非空,则达到最小值。否则,作为一种解决方案,以平衡冲突的利益,我们建议的最低点在功率区域的投影到一组可行的功率设置。最后,通过适当的效用函数,最小化总消耗功率的问题可以看作是寻找纳什讨价还价的解决方案,这从博弈论的角度揭示了权力分配。凸性和分量单调性是这一结果的必要前提。

英文摘要:

In this paper, we define the power region as the set of power allocations for K users such that everybody meets a minimum signal-to-interference ratio (SIR). The SIR is modeled in a multiuser CDMA system with fixed linear receiver and signature sequences. We show that the power region is convex in linear and logarithmic scale. It furthermore has a componentwise minimal element. Power constraints are included by the intersection with the set of all viable power adjustments. In this framework, we aim at minimizing the total expended power by minimizing a componentwise monotone functional. If the feasible power region is nonempty, the minimum is attained. Otherwise, as a solution to balance conflicting interests, we suggest the projection of the minimum point in the power region onto the set of viable power settings. Finally, with an appropriate utility function, the problem of minimizing the total expended power can be seen as finding the Nash bargaining solution, which sheds light on power assignment from a game theoretic point of view. Convexity and componentwise monotonicity are essential prerequisites for this result.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑