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

Upper and lower boundsDirty paper codingTelecommunications linkLinear network codingComputer scienceCoding (social sciences)Base stationLimit (mathematics)Forcing (mathematics)Scheme (mathematics)Topology (electrical circuits)Mathematical optimizationMathematicsComputer networkMIMOStatisticsCombinatorics

Affiliated Institutions

Related Publications

Publication Info

Year
2006
Type
article
Pages
4333-4338
Citations
141
Access
Closed

External Links

Download PDF (Free) View on DOI.org Semantic Scholar

Social Impact

Altmetric
PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

141
OpenAlex
5
Influential
95
CrossRef

Cite This

M. Kemal Karakayali, G.J. Foschini, R. Valenzuela et al. (2006). On the Maximum Common Rate Achievable in a Coordinated Network. 2006 IEEE International Conference on Communications , 4333-4338. https://doi.org/10.1109/icc.2006.255762

Identifiers

DOI
10.1109/icc.2006.255762

Data Quality

Data completeness: 77%