首页> 外文OA文献 >A Low-Complexity Cross-Layer Algorithm for Coordinated Downlink Scheduling and Robust Beamforming Under a Limited Feedback Constraint
【2h】

A Low-Complexity Cross-Layer Algorithm for Coordinated Downlink Scheduling and Robust Beamforming Under a Limited Feedback Constraint

机译:一种有限反馈约束下协调下行调度和鲁棒波束形成的低复杂度跨层算法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Abstract—Coordinated scheduling/beamforming (CS/CB) sub stantially mitigates the intercell interference (ICI), hence increas ing the cell-edge throughput on the downlink (DL) of coordinated multipoint (CoMP) systems. To maximize the DL throughput, the cooperating base stations (BSs) jointly select the best set of users for DL scheduling and then jointly design a set of beamforming (BF) vectors to approach the throughput limit. However, finding the optimal BF vectors requires an exhaustive search and sub stantial channel state information (CSI) feedback, hence resultingin high algorithmic complexity and heavy uplink traffic load. Hence, we conceive a new cross-layer algorithm to achieve high performance at a lower feedback amount and at lower algorithmic complexity. Based on the fact that different BSs usually have different traffic loads, we divide the BSs into two different types, i.e., the master BSs (MBSs) and the slave BSs (SBSs), whereMBSs have a higher transmission priority than SBSs. The scheduling relies on an interference threshold, whereas our robust BF scheme exploits both the channel direction information (CDI), which is quantized using the technique of limited feedback, and the channel quality information (CQI), which is assumed to be fed back accurately. Our numerical results show that the proposed algorithm does not lose much performance compared with that achieved by an exhaustive search, whereas the algorithmic complexity is as low as that of the solutions operating without CoMP.
机译:摘要—协调调度/波束形成(CS / CB)实质上可减轻小区间干扰(ICI),从而增加了协作多点(CoMP)系统的下行链路(DL)上的小区边缘吞吐量。为了使DL吞吐量最大化,协作基站(BS)联合选择最佳用户集合进行DL调度,然后联合设计一组波束成形(BF)向量以接近吞吐量限制。但是,找到最佳BF向量需要详尽的搜索和大量的信道状态信息(CSI)反馈,因此导致算法复杂度高和上行链路业务负载沉重。因此,我们构想出一种新的跨层算法,以较低的反馈量和较低的算法复杂度实现高性能。基于不同的BS通常具有不同的业务负载这一事实,我们将BS分为两种不同的类型,即主BS(MBS)和从BS(SBS),其中MBS的传输优先级高于SBS。调度依赖于干扰阈值,而我们的鲁棒BF方案同时利用了使用有限反馈技术量化的信道方向信息(CDI)和假定可以准确反馈的信道质量信息(CQI) 。我们的数值结果表明,与通过穷举搜索实现的算法相比,所提出的算法不会损失太多性能,而算法的复杂度却与没有CoMP的解决方案一样低。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号