Duality, achievable rates, and sum-rate capacity of gaussian mimo broadcast channels
Top Cited Papers
- 14 October 2003
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 49 (10) , 2658-2668
- https://doi.org/10.1109/tit.2003.817421
Abstract
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.Keywords
This publication has 15 references indexed in Scilit:
- Sum capacity of the vector Gaussian broadcast channel and uplink–downlink dualityIEEE Transactions on Information Theory, 2003
- On the duality of Gaussian multiple-access and broadcast channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On the achievable throughput of a multiantenna Gaussian broadcast channelIEEE Transactions on Information Theory, 2003
- Trellis precoding for the broadcast channelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Iterative water-filling for Gaussian vector multiple access channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Capacity of Multi‐antenna Gaussian ChannelsEuropean Transactions on Telecommunications, 1999
- Determinant Maximization with Linear Matrix Inequality ConstraintsSIAM Journal on Matrix Analysis and Applications, 1998
- Multiple-access channels with memory with and without frame synchronismIEEE Transactions on Information Theory, 1989
- Writing on dirty paper (Corresp.)IEEE Transactions on Information Theory, 1983
- An outer bound to the capacity region of broadcast channels (Corresp.)IEEE Transactions on Information Theory, 1978