On the Maximum Common Rate Achievable in a Coordinated Network
- 1 January 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 9, 4333-4338
- https://doi.org/10.1109/icc.2006.255762
Abstract
We quantify the ultimate performance limits of inter-cell coordinatation in a cellular downlink network. The goal is to achieve fairness by maximizing the minimum rate in the network subject to per base power constraints. We first solve the max-min rate problem for a particular zero-forcing dirty paper coding scheme so as to obtain an achievable max-min rate, which serves as a lower bound on the ultimate limit. We then obtain a simple upper bound on the max-min rate of any scheme, and show that the rate achievable by the zero-forcing dirty paper coding scheme is close to this upper bound. We also extend our analysis to coordinated networks with multiple antennas.Keywords
This publication has 9 references indexed in Scilit:
- The capacity region of the gaussian MIMO broadcast channelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Performance Analysis of Capacity of MIMO Systems under Multiuser Interference Based on Worst-Case Noise BehaviorEURASIP Journal on Wireless Communications and Networking, 2004
- Sum Capacity of Gaussian Vector Broadcast ChannelsIEEE Transactions on Information Theory, 2004
- Convex OptimizationPublished by Cambridge University Press (CUP) ,2004
- Duality, achievable rates, and sum-rate capacity of gaussian mimo broadcast channelsIEEE Transactions on Information Theory, 2003
- On the achievable throughput of a multiantenna Gaussian broadcast channelIEEE Transactions on Information Theory, 2003
- The worst additive noise under a covariance constraintIEEE Transactions on Information Theory, 2001
- On Limits of Wireless Communications in a Fading Environment when Using Multiple AntennasWireless Personal Communications, 1998
- Writing on dirty paper (Corresp.)IEEE Transactions on Information Theory, 1983