A Proof of the Converse for the Capacity of Gaussian MIMO Broadcast Channels

The paper provides a proof of the converse for the capacity region of the Gaussian MIMO broadcast channel under total average transmit power constraint. The proof uses several ideas from earlier works on the problem including the recent converse proof by Weingarten, Steinberg and Shamai. First the duality between Gaussian multiple access and broadcast channels is employed to show that every point on the boundary of the dirty paper coding region can be represented as the optimal solution to a convex optimization problem. Using the optimality conditions for this convex problem, a degraded broadcast channel is constructed for each point. It is then shown that the capacity region for this degraded broadcast channel contains the capacity region of the original channel. Moreover, the same point lies on the boundary of the dirty paper coding region for this degraded channel. Finally, the standard entropy power inequality is used to show that this point lies on the boundary of the capacity region of the degraded channel as well and consequently it is on the boundary of the capacity region of the original channel