arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1407.4177cs.ITmath.IT
收藏

干扰信道和功率约束下和速率最大化的功率控制

Power Control for Sum Rate Maximization on Interference Channels Under Sum Power Constraint

Naveed Ul Hassan, Chau Yuen, Shayan Saeed, Zhaoyang Zhang

摘要:

在本文中,我们考虑了和功率约束下的多个干扰链路(TX-RX对)的和速率最大化的功率控制问题。我们考虑一个单频网络,其中所有对都在相同的频带中操作,从而彼此产生干扰。我们研究的功率分配问题和速率最大化,没有QoS要求的各个环节。当目标仅为和速率最大化而没有QoS保证时,我们给出了一个解析解来确定两个TX-RX对的最优功率分配问题。我们还开发了一个低复杂度的三TX-RX对问题的迭代算法。对于一般的N> 3 TX-RX对问题,我们提出了两种低复杂度的次优功率分配算法。第一种算法是基于两个或三个TX-RX对的集群,然后利用两个和三个TX-RX对问题获得的功率分配结果的想法。第二种算法是通过使用高SINR近似来开发的,并且该算法也可以由各个TX以分布式方式实现。然后,我们考虑同样的问题,但与额外的QoS保证个别链接。我们再次开发了两个TX-RX对问题的解析解,以及N> 2个TX-RX对的分布式算法。

英文摘要:

In this paper, we consider the problem of power control for sum rate maximization on multiple interfering links (TX-RX pairs)under sum power constraint. We consider a single frequency network, where all pairs are operating in same frequency band,thereby creating interference for each other. We study the power allocation problem for sum rate maximization with and without QoS requirements on individual links. When the objective is only sum rate maximization without QoS guarantees, we develop an analytic solution to decide optimal power allocation for two TX-RX pair problem. We also develop a low complexity iterative algorithm for three TX-RX pair problem. For a generic N>3 TX-RX pair problem, we develop two low-complexity sub-optimal power allocation algorithms. The first algorithm is based on the idea of making clusters of two or three TX-RX pairs and then leverage the power allocation results obtained for two and three TX-RX pair problems. The second algorithm is developed by using a high SINR approximation and this algorithm can also be implemented in a distributed manner by individual TXs. We then consider the same problem but with additional QoS guarantees for individual links. We again develop an analytic solution for two TX-RX pair problem, and a distributed algorithm for N>2 TX-RX pairs.

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

↑