Skip to main navigation Skip to search Skip to main content

On the maximum common rate achievable in a coordinated network

  • M. K. Karakayali
  • , G. J. Foschini
  • , R. A. Valenzuelat
  • , R. D. Yates

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original languageEnglish (US)
Title of host publication2006 IEEE International Conference on Communications, ICC 2006
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages4333-4338
Number of pages6
ISBN (Print)1424403553, 9781424403554
DOIs
StatePublished - 2006
Event2006 IEEE International Conference on Communications, ICC 2006 - Istanbul, Turkey
Duration: Jul 11 2006 → Jul 15 2006

Publication series

NameIEEE International Conference on Communications
Volume9
ISSN (Print)0536-1486

Other

Other2006 IEEE International Conference on Communications, ICC 2006
Country/TerritoryTurkey
CityIstanbul
Period7/11/06 → 7/15/06

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'On the maximum common rate achievable in a coordinated network'. Together they form a unique fingerprint.

Cite this