.png){kind=icon}
.png){kind=icon}
Return
Capacity Optimizing Power Allocation in Interference Channels
.png){kind=icon}
PRE
AI
DOI：10.1016/j.aeue.2007.11.009.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The interference channel is an essential model in both wireline and wireless communication systems. This article addresses transmit power allocation in interference channels with total transmit power constraint. The optimum power allocation maximizing the sum rate in two user interference channels can be derived analytically. However, the non-convexity of the optimization problem makes it prohibitively complex to obtain the optimum solution either analytically or numerically in general K user scenarios. After reviewing several conventional suboptimum power allocation schemes including equal power allocation, greedy power allocation and waterfilling power allocation, an iterative waterfilling algorithm is proposed and discussed. The performance of various power allocation schemes is evaluated through simulations, which suggests that the proposed iterative waterfilling outperforms other suboptimum power allocation schemes in certain scenarios. (C) 2007 Elsevier GmbH. All rights reserved.
Keywords:
Interference channel
Power allocation
Waterfilling
Iterative waterfilling
Journal
A
IF:
3.2
Papers:
5.6K
Citations:
8.3K