Sum power iterative water-filling for multi-antenna Gaussian broadcast channels
Sum power iterative water-filling for multi-antenna Gaussian broadcast channels
复制标题
DOI：
10.1109/tit.2005.844082
复制
发表时间：
2005-04-01
影响因子：
2.5
通讯作者：
Goldsmith, A
中科院分区：
文献类型：
--
作者：
Jindal, N;Rhee, W;Goldsmith, A
在这封信中，我们考虑多天线高斯广播信道（BC）的和速率最大化问题。最近发现脏纸编码可实现该信道的容量。为了达到容量，必须根据信道条件和功率约束找到最优传输策略（即最优发射协方差结构）。然而，在采用脏纸编码时获取最优传输策略是一个计算复杂的非凸问题。我们利用对偶性将此问题转化为一个结构良好的凸多址接入信道（MAC）问题。我们利用这个问题的结构，推导出简单快速的迭代算法，为MAC提供最优传输策略，这些策略可以很容易地映射到最优的BC策略。
In this correspondence, we consider the problem of maximizing sum rate of a multiple-antenna Gaussian broadcast channel (BC). It was recently found that dirty-paper coding is capacity achieving for this channel. In order to achieve capacity, the optimal transmission policy (i.e., the optimal transmit covariance structure) given the channel conditions and power constraint must be found. However, obtaining the optimal transmission policy when employing dirty-paper coding is a computationally complex nonconvex problem. We use duality to transform this problem into a well-structured convex multiple-access channel (MAC) problem. We exploit the structure of this problem and derive simple and fast iterative algorithms that provide the optimum transmission policies for the MAC, which can easily be mapped to the optimal BC policies.