获取高斯MIMO广播信道和容量域的一种方法

针对脏纸编码方法很难直接计算广播信道和容量域边界值问题,提出了一种计算多接入信道和容量的迭代注水算法以及获取最大和容量的次优传输策略,利用广播信道与多接入信道的对偶性,将该和容量结果和传输策略通过简单的映射关系转换成广播信道和容量的边界值和优化传输策略。数值结果表明所提的迭代算法简单有效,给出的传输策略可以有效逼近广播信道理论和容量边界,在MIMO下行链路中可得到应用。

Approach towards the achievable sum rates capacity of Gaussian MIMO broadcast channels

Since it is very difficult to compute the sum rates capacity of Gaussian MIMO broadcast channels directly by using dirty paper coding approach,an iterative water-filling algorithm is proposed to obtain the sum capacity bound for multi-access channel and a suboptimal transmission policy to achieve the capacity bound is derived from the algorithm.Based on the duality of multiple-access and broadcast channels,the capacity bound and transmission policy in multi-access channels are mapped into the broadcast channel.Numerical results show that the proposed iterative algorithm is simple and effective to calculate the sum capacity bound,and the capacity achieved by the transmission policy is very close to the theoretical bound.This policy is quite considerable for downlink transmission of MIMO systems.