A clustered base transceiver station (BTS) coordination strategy is proposed for a large cellular MIMO network, which includes full intra-cluster coordination to enhance the sum rate and limited inter-cluster coordination to reduce interference for the cluster edge users. Multi-cell block diagonalization is used to coordinate the transmissions across multiple BTSs in the same cluster. To satisfy per-BTS power constraints, three combined precoder and power allocation algorithms are proposed with different performance and complexity tradeoffs. For inter-cluster coordination, the coordination area is chosen to balance fairness for edge users and the achievable sum rate. It is shown that a small cluster size (about 7 cells) is sufficient to obtain most of the sum rate benefits from clustered coordination while greatly relieving channel feedback requirement. Simulations show that the proposed coordination strategy efficiently reduces interference and provides a considerable sum rate gain for cellular MIMO networks.
With BTSs coordinating for transmission, it forms an effective MU-MIMO broadcast channel, for which DPC has been shown to be an optimal precoding technique @cite_20 @cite_39 @cite_46 @cite_19 @cite_6 . DPC, while theoretically optimal, is an information theoretic concept that is difficult to implement in practice. A more practical precoding technique for broadcast MIMO channels is @cite_23 @cite_7 @cite_49 @cite_8 @cite_47 , which provides each user an interference-free channel with properly designed linear precoding matrices. In addition, it was shown in @cite_29 that BD can achieve a significant part of the ergodic sum capacity of DPC. Therefore, we will apply BD in the multi-cell scenario as the precoding technique for the proposed BTS coordination.
@cite_47 @cite_7 @cite_8 @cite_29 @cite_6 @cite_39 @cite_19 @cite_23 @cite_49 @cite_46 @cite_20
2101790209 2098126478 2166579323 2030546921 2111451941 2156004493 2103749601 2151795416
Block diagonalization is one approach for linear preceding in the multiple-input multiple-output broadcast channel that sends multiple interference free data streams to different users in the same cell. Unfortunately, block diagonalization neglects other-cell interference (OCI), which limits the performance of users at the edge of the cell. This paper presents an OCI-aware enhancement to block diagonalization that uses a whitening filter for interference suppression at the receiver and a novel precoder using the interference-plus-noise covariance matrix for each user at the transmitter. For complex Gaussian matrix channels, the asymptotic sum rate of the proposed system is analyzed under a large antenna assumption for isotropic inputs and compared to conventional block diagonalization. The capacity loss due to OCI is quantified in terms of results from single-user MIMO capacity. Several numerical examples compare achievable sum rates, the proposed asymptotic rates, and the capacity loss, in low and high interference regimes. The use of space-division multiple access (SDMA) in the downlink of a multiuser multiple-input, multiple-output (MIMO) wireless communications network can provide a substantial gain in system throughput. The challenge in such multiuser systems is designing transmit vectors while considering the co-channel interference of other users. Typical optimization problems of interest include the capacity problem - maximizing the sum information rate subject to a power constraint-or the power control problem-minimizing transmitted power such that a certain quality-of-service metric for each user is met. Neither of these problems possess closed-form solutions for the general multiuser MIMO channel, but the imposition of certain constraints can lead to closed-form solutions. This paper presents two such constrained solutions. The first, referred to as "block-diagonalization," is a generalization of channel inversion when there are multiple antennas at each receiver. It is easily adapted to optimize for either maximum transmission rate or minimum power and approaches the optimal solution at high SNR. The second, known as "successive optimization," is an alternative method for solving the power minimization problem one user at a time, and it yields superior results in some (e.g., low SNR) situations. Both of these algorithms are limited to cases where the transmitter has more antennas than all receive antennas combined. In order to accommodate more general scenarios, we also propose a framework for coordinated transmitter-receiver processing that generalizes the two algorithms to cases involving more receive than transmit antennas. While the proposed algorithms are suboptimal, they lead to simpler transmitter and receiver structures and allow for a reasonable tradeoff between performance and complexity. The sum capacity of a Gaussian broadcast MIMO channel can be achieved with dirty paper coding (DPC). However, algorithms that approach the DPC sum capacity do not appear viable in the forseeable future, which motivates lower complexity interference suppression techniques. Block diagonalization (BD) is a linear preceding technique for downlink multiuser MIMO systems. With perfect channel knowledge at the transmitter, BD can eliminate other users' interference at each receiver. In this paper, we study the sum capacity of BD with and without receive antenna selection. We analytically compare BD without receive antenna selection to DPC for a set of given channels. It is shown that (1) if the user channels are orthogonal to each other, then BD achieves the same sum capacity as DPC; (2) if the user channels lie in the same subspace, then the gain of DPC over BD can be upper bounded by the minimum of the number of transmit and receive antennas. These observations also hold for BD with receive antenna selection. Further, we study the ergodic sum capacity of BD with and without receive antenna selection 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 proposed for easy estimation of the gap between the sum capacity of DPC and BD without receive antenna selection. The Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC) is considered. The dirty-paper coding (DPC) rate region is shown to coincide with the capacity region. To that end, a new notion of an enhanced broadcast channel is introduced and is used jointly with the entropy power inequality, to show that a superposition of Gaussian codes is optimal for the degraded vector broadcast channel and that DPC is optimal for the nondegraded case. Furthermore, the capacity region is characterized under a wide range of input constraints, accounting, as special cases, for the total power and the per-antenna power constraints We introduce a transmit preprocessing technique for the downlink of multiuser multiple-input multiple-output (MIMO) systems. It decomposes the multiuser MIMO downlink channel into multiple parallel independent single-user MIMO downlink channels. Some key properties are that each equivalent single-user MIMO channel has the same properties as a conventional single-user MIMO channel, and that increasing the number of transmit antennas of the multiuser system by one increases the number of spatial channels to each user by one. Simulation results are also provided and these results demonstrate the potential of our technique in terms of performance and capacity. This paper addresses the problem of performing orthogonal space-division multiplexing (OSDM) for downlink, point-to-multipoint communications when multiple antennas are utilized at the base station (BS) and (optionally) all mobile stations (MS). Based on a closed-form antenna weight solution for single-user multiple-input multiple-output communications in the presence of other receiver points, we devise an iterative algorithm that finds the multiuser antenna weights for OSDM in downlink or broadcast channels. Upon convergence, each mobile user will receive only the desired activated spatial modes with no cochannel interference. Necessary and sufficient conditions for the existence of OSDM among the number of mobile users, the number of transmit antennas at the BS, and the number of receive antennas at the MS, are also derived. The assumption for the proposed method is that the BS knows the channels for all MS's and that the channel dynamics are quasi-stationary. We characterize the sum capacity of the vector Gaussian broadcast channel by showing that the existing inner bound of Marton and the existing upper bound of Sato are tight for this channel. We exploit an intimate four-way connection between the vector broadcast channel, the corresponding point-to-point channel (where the receivers can cooperate), the multiple-access channel (MAC) (where the role of transmitters and receivers are reversed), and the corresponding point-to-point channel (where the transmitters can cooperate). A Gaussian broadcast channel (GBC) with r single-antenna receivers and t antennas at the transmitter is considered. Both transmitter and receivers have perfect knowledge of the channel. Despite its apparent simplicity, this model is, in general, a nondegraded broadcast channel (BC), for which the capacity region is not fully known. For the two-user case, we find a special case of Marton's (1979) region that achieves optimal sum-rate (throughput). In brief, the transmitter decomposes the channel into two interference channels, where interference is caused by the other user signal. Users are successively encoded, such that encoding of the second user is based on the noncausal knowledge of the interference caused by the first user. The crosstalk parameters are optimized such that the overall throughput is maximum and, surprisingly, this is shown to be optimal over all possible strategies (not only with respect to Marton's achievable region). For the case of r>2 users, we find a somewhat simpler choice of Marton's region based on ordering and successively encoding the users. For each user i in the given ordering, the interference caused by users j>i is eliminated by zero forcing at the transmitter, while interference caused by users j<i is taken into account by coding for noncausally known interference. Under certain mild conditions, this scheme is found to be throughput-wise asymptotically optimal for both high and low signal-to-noise ratio (SNR). We conclude by providing some numerical results for the ergodic throughput of the simplified zero-forcing scheme in independent Rayleigh fading.