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. In this paper, we establish a duality between what is termed the "dirty paper" achievable region (the Caire-Shamai 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.
duality broadcast channel (bc) channel capacity dirty paper coding multiple-input multiple-output (mimo) systems