首页> 外文期刊>Communications, IET >Joint base stations clustering and feedback bits allocation for multi-cell coordinated beamforming systems
【24h】

Joint base stations clustering and feedback bits allocation for multi-cell coordinated beamforming systems

机译:多小区协作波束成形系统的联合基站聚类和反馈比特分配

获取原文
获取原文并翻译 | 示例
       

摘要

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.
机译:在这项研究中,作者研究了在考虑实际的延迟有限反馈和受限回程的情况下,在多小区协作波束成形系统中最大化平均速率的问题。为了解决这个难题,他们首先导出了由于集群协调和不完美的信道反馈而导致的平均速率损失上限的解析表达式。特别地,该上限定量地揭示了在减小与较大的基站(BS)集群的小区间干扰与减小与较小的BS集群的用户间干扰但提高了信道状态信息准确性之间的关键权衡。有鉴于此,他们共同优化了BS的聚类和反馈比特分配(BCFA),目的是使平均速率损失的上限最小化,这等效于最大化平均速率的问题。利用松弛和舍入方法,设计了一种性能良好,复杂度低的基站聚类和反馈比特分配算法,称为BCFA。最后,提供了广泛的仿真结果以证明该算法的优势。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号