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

具有协调的MIMO多址信道的功率分配博弈

Power Allocation Games for MIMO Multiple Access Channels with Coordination

Elena Veronica Belmega, Samson Lasaulce, Merouane Debbah

摘要:

利用博弈论方法推导了在快衰落多址信道中发射机和接收机均配备多个天线的最优分散功率分配(PA)。参与者(移动终端)可以自由地选择其PA,以便最大化其各自的传输速率(特别地,它们可以忽略某些指定的集中式策略)。介绍了一种简单的用户间协调机制。这种机制的性质和影响进行了详细研究。协调信号向用户指示接收机应用连续干扰消除的顺序以及使用该顺序的频率。两种不同的游戏进行了研究:用户可以适应他们的时间PA到他们的解码秩在接收机或优化他们的发射天线之间的空间PA。对于这两个游戏的网络纳什均衡的存在性,唯一性和总效率进行了深入的分析。分析和仿真结果提供了分散网络的性能和其等效的虚拟多输入多输出系统,这是在某些情况下为零,一般相对较小的差距进行评估。

英文摘要:

A game theoretic approach is used to derive the optimal decentralized power allocation (PA) in fast fading multiple access channels where the transmitters and receiver are equipped with multiple antennas. The players (the mobile terminals) are free to choose their PA in order to maximize their individual transmission rates (in particular they can ignore some specified centralized policies). A simple coordination mechanism between users is introduced. The nature and influence of this mechanism is studied in detail. The coordination signal indicates to the users the order in which the receiver applies successive interference cancellation and the frequency at which this order is used. Two different games are investigated: the users can either adapt their temporal PA to their decoding rank at the receiver or optimize their spatial PA between their transmit antennas. For both games a thorough analysis of the existence, uniqueness and sum-rate efficiency of the network Nash equilibrium is conducted. Analytical and simulation results are provided to assess the gap between the decentralized network performance and its equivalent virtual multiple input multiple output system, which is shown to be zero in some cases and relatively small in general.

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

↑