Gaussian MIMO Broadcast Channel Research Articles

Practical Vector Dirty Paper Coding for MIMO Gaussian Broadcast Channels

Recently, the vector dirty paper coding (DPC) achievable rate region has been shown to be the capacity region of a multiple-input multiple-output Gaussian broadcast channel (MIMO GBC). With DPC, the multiuser interference noncausally known at the transmitter can be completely removed. In this paper, we present a vector DPC structure for MIMO GBC. It is a generalization of the single antenna superposition dirty paper coding for the scalar Gaussian dirty paper problem proposed by Bennatan et al. In a theoretical random code setting, this construction is shown to be able to achieve the promised rate performance of the MIMO GBC. We also implement it with existing vector quantizer and capacity-achieving channel coding. Combined with iterative decoding, a design example validates the effectiveness of our methods.

Sum capacity of MIMO gaussian broadcast channels with channel energy constraints

The motivation of this paper is to find the class of channels that provides the best sum capacity of a MIMO Gaussian broadcast channel with both transmit power and channel energy constraints when NtgesKNr, where Nt, Nr, and K denote the number of transmit antennas, the number of receive antennas, and the number of users in the system, respectively. The best sum capacity is achieved when the user channels are mutually orthogonal to each other. For each individual user, equal energy is distributed to all non-zero spatial eigenmodes. Further, we optimize the number of non-zero eigenmodes for all users and the optimal power distribution among users. Although, we only study the case of NtgesKN r in this paper, we conjecture that similar results still hold for Nt<KNr. The characteristics of the optimal channels can be used to direct antenna configurations

Duality, achievable rates, and sum-rate capacity of gaussian mimo broadcast channels

We consider a multiuser multiple-input multiple- output (MIMO) Gaussian broadcast channel (BC), where the transmitter and receivers have multiple antennas. Since the MIMO BC is in general a nondegraded BC, its capacity region remains an unsolved problem. We establish a duality between what is termed the "dirty paper" achievable region (the Caire-Shamai (see Proc. IEEE Int. Symp. Information Theory, Washington, DC, June 2001, p.322) achievable region) for the MIMO BC and the capacity region of the MIMO multiple-access channel (MAC), which is easy to compute. Using this duality, we greatly reduce the computational complexity required for obtaining the dirty paper achievable region for the MIMO BC. We also show that the dirty paper achievable region achieves the sum-rate capacity of the MIMO BC by establishing that the maximum sum rate of this region equals an upper bound on the sum rate of the MIMO BC.