### Abstract

This paper considers base station (BS) cooperation in the form of coordinated beamforming, focusing on min-max fairness in the power usage subject to target SINR constraints. We show that the optimal beamforming strategies have an interesting nested zero-forcing structure. We then consider the asymptotic regime where the number of antennas at each BS and the number of users in each cell both grow large with their ratio tending to a finite constant. The limiting optimal beamformer structure is characterized in terms of the solution of a convex optimization problem. The dimensionality of this optimization problem is constant^{1}, as opposed to the problem of solving for the exactly optimal beamformer^{2}, and only knowledge of statistics is required to solve it. These asymptotic results provide insights into the average performance, as well as simple but efficient strategies for the finite system case. In particular, the optimal beamforming strategy from the large systems analysis only requires the base stations to have local instantaneous channel state information; the remaining parameters of the beamformer can be calculated using channel statistics which can easily be shared amongst the base stations.

Language | English |
---|---|

Title of host publication | 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 |

Place of Publication | Piscataway, NJ |

Publisher | Institute of Electrical and Electronics Engineers (IEEE) |

Pages | 1990-1994 |

Number of pages | 5 |

ISBN (Electronic) | 9781457705953, 9781457705946 |

ISBN (Print) | 9781457705960 |

DOIs | |

Publication status | Published - 2011 |

Externally published | Yes |

Event | 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, Russian Federation Duration: 31 Jul 2011 → 5 Aug 2011 |

### Other

Other | 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 |
---|---|

Country | Russian Federation |

City | St. Petersburg |

Period | 31/07/11 → 5/08/11 |

### Fingerprint

### Cite this

*2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011*(pp. 1990-1994). [6033901] Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE). https://doi.org/10.1109/ISIT.2011.6033901

}

*2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011.*, 6033901, Institute of Electrical and Electronics Engineers (IEEE), Piscataway, NJ, pp. 1990-1994, 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russian Federation, 31/07/11. https://doi.org/10.1109/ISIT.2011.6033901

**Min-max fair coordinated beamforming via large systems analysis.** / Zakhour, Randa; Hanly, Stephen.

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

TY - GEN

T1 - Min-max fair coordinated beamforming via large systems analysis

AU - Zakhour, Randa

AU - Hanly, Stephen

PY - 2011

Y1 - 2011

N2 - This paper considers base station (BS) cooperation in the form of coordinated beamforming, focusing on min-max fairness in the power usage subject to target SINR constraints. We show that the optimal beamforming strategies have an interesting nested zero-forcing structure. We then consider the asymptotic regime where the number of antennas at each BS and the number of users in each cell both grow large with their ratio tending to a finite constant. The limiting optimal beamformer structure is characterized in terms of the solution of a convex optimization problem. The dimensionality of this optimization problem is constant1, as opposed to the problem of solving for the exactly optimal beamformer2, and only knowledge of statistics is required to solve it. These asymptotic results provide insights into the average performance, as well as simple but efficient strategies for the finite system case. In particular, the optimal beamforming strategy from the large systems analysis only requires the base stations to have local instantaneous channel state information; the remaining parameters of the beamformer can be calculated using channel statistics which can easily be shared amongst the base stations.

AB - This paper considers base station (BS) cooperation in the form of coordinated beamforming, focusing on min-max fairness in the power usage subject to target SINR constraints. We show that the optimal beamforming strategies have an interesting nested zero-forcing structure. We then consider the asymptotic regime where the number of antennas at each BS and the number of users in each cell both grow large with their ratio tending to a finite constant. The limiting optimal beamformer structure is characterized in terms of the solution of a convex optimization problem. The dimensionality of this optimization problem is constant1, as opposed to the problem of solving for the exactly optimal beamformer2, and only knowledge of statistics is required to solve it. These asymptotic results provide insights into the average performance, as well as simple but efficient strategies for the finite system case. In particular, the optimal beamforming strategy from the large systems analysis only requires the base stations to have local instantaneous channel state information; the remaining parameters of the beamformer can be calculated using channel statistics which can easily be shared amongst the base stations.

UR - http://www.scopus.com/inward/record.url?scp=80054827931&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2011.6033901

DO - 10.1109/ISIT.2011.6033901

M3 - Conference proceeding contribution

SN - 9781457705960

SP - 1990

EP - 1994

BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Piscataway, NJ

ER -