Fundamental Limits in Correlated Fading MIMO Broadcast Channels: Benefits of Transmit Correlation Diversity

We investigate asymptotic capacity limits of the Gaussian MIMO broadcast channel (BC) with spatially correlated fading to understand when and how much transmit correlation helps the capacity. By imposing a structure on channel covariances (equivalently, transmit correlations at the transmitter side) of users, also referred to as \emph{transmit correlation diversity}, the impact of transmit correlation on the power gain of MIMO BCs is characterized in several regimes of system parameters, with a particular interest in the large-scale array (or massive MIMO) regime. Taking the cost for downlink training into account, we provide asymptotic capacity bounds of multiuser MIMO downlink systems to see how transmit correlation diversity affects the system multiplexing gain. We make use of the notion of joint spatial division and multiplexing (JSDM) to derive the capacity bounds. It is advocated in this paper that transmit correlation diversity may be of use to significantly increase multiplexing gain as well as power gain in multiuser MIMO systems. In particular, the new type of diversity in wireless communications is shown to improve the system multiplexing gain up to by a factor of the number of degrees of such diversity. Finally, performance limits of conventional large-scale MIMO systems not exploiting transmit correlation are also characterized.Comment: 29 pages, 8 figure

Linear Precoding in Cooperative MIMO Cellular Networks with Limited Coordination Clusters

In a cooperative multiple-antenna downlink cellular network, maximization of a concave function of user rates is considered. A new linear precoding technique called soft interference nulling (SIN) is proposed, which performs at least as well as zero-forcing (ZF) beamforming. All base stations share channel state information, but each user's message is only routed to those that participate in the user's coordination cluster. SIN precoding is particularly useful when clusters of limited sizes overlap in the network, in which case traditional techniques such as dirty paper coding or ZF do not directly apply. The SIN precoder is computed by solving a sequence of convex optimization problems. SIN under partial network coordination can outperform ZF under full network coordination at moderate SNRs. Under overlapping coordination clusters, SIN precoding achieves considerably higher throughput compared to myopic ZF, especially when the clusters are large.Comment: 13 pages, 5 figure