Please use this identifier to cite or link to this item:
|Title:||Min-max fair coordinated beamforming via large systems analysis||Authors:||Zakhour, R.
|Issue Date:||2011||Citation:||Zakhour, R.,Hanly, S. (2011). Min-max fair coordinated beamforming via large systems analysis. IEEE International Symposium on Information Theory - Proceedings : 1990-1994. ScholarBank@NUS Repository. https://doi.org/10.1109/ISIT.2011.6033901||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 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. © 2011 IEEE.||Source Title:||IEEE International Symposium on Information Theory - Proceedings||URI:||http://scholarbank.nus.edu.sg/handle/10635/83959||ISBN:||9781457705953||ISSN:||21578104||DOI:||10.1109/ISIT.2011.6033901|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 23, 2019
checked on May 21, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.