Open AccessJoint base stations clustering and feedback bits allocation for multi‐cell coordinated beamforming systems
Author(s) -
Du Pengfei,
Yang Qinghai,
He Qingsu,
Kwak Kyung Sup
Publication year - 2017
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2017.0044
Subject(s) - backhaul (telecommunications) , base station , beamforming , computer science , cluster analysis , channel state information , upper and lower bounds , mathematical optimization , relaxation (psychology) , interference (communication) , channel (broadcasting) , algorithm , wireless , mathematics , telecommunications , artificial intelligence , psychology , mathematical analysis , social psychology
In this study, the authors investigate the problem of maximising the mean rate in a multi‐cell coordinated beamforming system considering practical delayed limited feedback and constrained backhaul. To tackle this hard problem, they first derive the analytical expression of the upper bound on the mean rate loss due to the clustered coordination and the imperfect channel feedback. Particularly, this upper bound quantitatively reveals a key tradeoff between decreasing inter‐cell interference with larger base station (BS) cluster and decreasing inter‐user interference with smaller BS cluster but improved channel state information accuracy. In light of this, they jointly optimise the BSs clustering and feedback bits allocation (BCFA) with the objective of minimising the upper bound on mean rate loss, which is equivalent to the problem of maximising the mean rate. Utilising the relaxation‐and‐rounding approach, a BSs clustering and feedback bits allocation algorithm, referred to as BCFA, is designed, which has good performance with low complexity. Finally, extensive simulation results are provided to demonstrate the advantages of the proposed algorithm.