We provide an overview of the extensive recent results on the Shannon capacity of single-user and multiuser multiple-input multiple-output (MIMO) channels. Although enormous capacity gains have been predicted for such channels, these predictions are based on somewhat unrealistic assumptions about the underlying time-varying channel model and how well it can be tracked at the receiver, as well as at the transmitter. More realistic assumptions can dramatically impact the potential capacity gains of MIMO techniques. For time-varying MIMO channels there are multiple Shannon theoretic capacity definitions and, for each definition, different correlation models and channel information assumptions that we consider. We first provide a comprehensive summary of ergodic and capacity versus outage results for single-user MIMO channels. These results indicate that the capacity gain obtained from multiple antennas heavily depends

Although the capacity of multiple-input/multiple-output (MIMO) broadcast channels (BCs) can be achieved by dirty paper coding (DPC), it is difficult to implement in practical systems. This paper investigates if, for a large number of users, simpler schemes can achieve the same performance. Specifically, we show that a zero-forcing beamforming (ZFBF) strategy, while generally suboptimal, can achieve the same asymptotic sum capacity as that of DPC, as the number of users goes to infinity. In proving this asymptotic result, we provide an algorithm for determining which users should be active under ZFBF. These users are semiorthogonal to one another and can be grouped for simultaneous transmission to enhance the throughput of scheduling algorithms. Based on the user grouping, we propose and compare two fair scheduling schemes in round-robin ZFBF and proportional-fair ZFBF. We provide numerical results to confirm the optimality of ZFBF and to compare the performance of ZFBF and proposed fair scheduling schemes with that of various MIMO BC strategies.

We show that the Gaussian multipleaccess channel (MAC) and broadcast channel (BC) are duals. The dual channels we consider have the same channel gains and the same noise power at all receivers. We nd an expression for the capacity region of the BC in terms of the capacity region of the dual MAC, and vice versa. Duality applies to many dierent channel models and capacity de nitions.

Abstract—We compare the capacity of dirty-paper coding (DPC)to that of time-division multiple access (TDMA)for a multiple-antenna (multipleinput multiple-output (MIMO)) Gaussian broadcast channel (BC). We find that the sum-rate capacity (achievable using DPC)of the multiple-antenna BC is at most ��� @ A times the largest single-user capacity (i.e., the TDMA sum-rate)in the system, where is the number of transmit antennas and is the number of receivers. This result is independent of the number of receive antennas and the channel gain matrix, and is valid at all signal-to-noise ratios (SNRs). We investigate the tightness of this bound in a time-varying channel (assuming perfect channel knowledge at receivers and transmitters)where the channel experiences uncorrelated Rayleigh fading and in some situations we find that the dirty paper gain is upper-bounded by the ratio of transmit-to-receive antennas. We also show that ��� @ A upper-bounds the sum-rate gain of successive decoding over TDMA for the uplink channel, where is the number of receive antennas at the base station and is the number of transmitters. Index Terms—Broadcast channel (BC), channel capacity, dirty-paper coding (DPC), multiple-input multiple-output (MIMO) systems, timedivision multiple access (TDMA). I.

Abstract — Block diagonalization (BD) is a precoding technique that eliminates inter-user interference in downlink multiuser multiple-input multiple-output (MIMO) systems. With the assumptions that all users have the same number of receive antennas and utilize all receive antennas when scheduled for transmission, the number of simultaneously supportable users with BD is limited by the ratio of the number of basestation transmit antennas to the number of user receive antennas. In a downlink MIMO system with a large number of users, the basestation may select a subset of users to serve in order to maximize the total throughput. The brute-force search for the optimal user set, however, is computationally prohibitive. We propose two low-complexity suboptimal user selection algorithms for multiuser MIMO systems with BD. Both algorithms aim to select a subset of users such that the total throughput is nearly maximized. The first user selection algorithm greedily maximizes the total throughput, whereas the criterion of the second algorithm is based on the channel energy. We show that both algorithms have linear complexity in the total number of users and achieve around 95 % of the total throughput of the complete search method in simulations. I.

Abstract—In multi-user multiple-input multiple-output (MU-MIMO) systems, spatial multiplexing can be employed to increase the throughput without the need for multiple antennas and expensive signal processing at the user equipments. In theory, MU-MIMO is also more immune to most of propagation limitations plaguing single-user MIMO (SU-MIMO) systems, such as channel rank loss or antenna correlation. However, in this paper we show that this is not always true. We compare the capacity and the correlation of measured MU-MIMO channels for both outdoor and indoor scenarios. The measurement data has been acquired using Eurecom’s MIMO Openair Sounder (EMOS). The EMOS can perform real-time MIMO channel measurements synchronously over multiple users. The results show that in most scenarios MU-MIMO provides a higher throughput than SU-MIMO also in the measured channels. However, in outdoor scenarios with a line of sight, the capacity drops significantly when the users are close together, due to high correlation at the transmitter side of the channel. In such a case, the performance of SU-MIMO and MU-MIMO is comparable. I.

In this work we study the capacity of multi-user multiple-input multiple-output (MU-MIMO) downlink channels with codebook-based limited feedback using real measurement data. Several aspects of MU-MIMO channels are evaluated. Firstly, we compare the sum rate of different MU-MIMO precoding schemes in various channel conditions. Secondly, we study the effect of different codebooks on the performance of limited feedback MU-MIMO. Thirdly, we relate the required feedback rate with the achievable rate on the downlink channel. Real multi-user channel measurement data acquired with the Eurecom MIMO OpenAir Sounder (EMOS) is used. To the best of our knowledge, these are the first measurement results giving evidence of how MU-MIMO precoding schemes depend on the precoding scheme, channel characteristics, user separation, and codebook. For example, we show that having a large user separation as well as codebooks adapted to the second order statistics of the channel gives a sum rate close to the theoretical limit. A small user separation due to bad scheduling or a poorly adapted codebook on the other hand can impair the gain brought by MU-MIMO. The tools and the analysis presented in this paper allow the system designer to trade-off downlink rate with feedback rate by carefully choosing the codebook.

Abstract — A multiple transmit antenna, single receive antenna (per receiver) downlink channel with limited channel feedback is considered. Given a constraint on the total system-wide channel feedback, the following question is considered: is it preferable to get low-rate feedback from a large number of receivers or to receive high-rate/high-quality feedback from a smaller number of (randomly selected) receivers? Acquiring feedback from many users allows multi-user diversity to be exploited, while highrate feedback allows for very precise selection of beamforming directions. It is shown that systems in which a limited number of users feedback high-rate channel information significantly outperform low-rate/many user systems. While capacity increases only double logarithmically with the number of users, the marginal benefit of channel feedback is very significant up to the point where the CSI is essentially perfect. I.

It has been shown recently that the dirty-paper coding is the optimal strategy for maximizing the sum rate of multiple-input multiple-output Gaussian broadcast channels (MIMO BC). Moreover, by the channel duality, the nonconvex MIMO BC sum rate problem can be transformed to the convex dual MIMO multiple-access channel (MIMO MAC) problem with a sum power constraint. In this paper, we design an efficient algorithm based on conjugate gradient projection (CGP) to solve the MIMO BC maximum sum rate problem. Our proposed CGP algorithm solves the dual sum power MAC problem by utilizing the powerful concept of Hessian conjugacy. We also develop a rigorous algorithm to solve the projection problem. We show that CGP enjoys provable convergence, nice scalability, and great efficiency for large MIMO BC systems. 1

Abstract — The sum capacity of a Gaussian broadcast MIMO channel can be achieved with Dirty Paper Coding (DPC). Deploying DPC in real-time systems is, however, impractical. Block Diagonalization (BD) is an alternative precoding technique for downlink multiuser MIMO systems, which can eliminate interuser interference at each receiver, at the expense of suboptimal sum capacity vs. DPC. In this paper, we study the sum capacity loss of BD for a fixed channel. We show that 1) if the user channels are orthogonal to each other, then BD achieves the complete sum capacity; and 2) if the user channels lie in a common row vector space, then the gain of DPC over BD can be bounded by the minimum of the number of transmit and receive antennas and the number of users. We also compare the ergodic sum capacity of DPC with that of BD in a Rayleigh fading channel. Simulations show that BD can achieve a significant part of the total throughput of DPC. An upper bound on the ergodic sum capacity gain of DPC over BD is derived, which can be evaluated with a few numerical integrations. With this bound, we can easily estimate how far away BD is from being optimal in terms of ergodic sum capacity, which is useful in directing practical system designs. I.