首页> 外文会议>2012 IEEE International Symposium on Information Theory Proceedings >Throughput penalty of fair scheduling algorithms on multiple antenna broadcast channels
【24h】

Throughput penalty of fair scheduling algorithms on multiple antenna broadcast channels

机译:公平调度算法在多个天线广播信道上的吞吐量损失

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

摘要

Fairness consideration in the wireless resource scheduling is important for enhancing the quality of user experience, despite the consequent throughput loss. This paper analyzes the associated penalty in obtaining a certain fairness criteria for multiple antenna broadcast channels. We define a fairness penalty as the achievable sum-rate difference in the regime of high SNR. We show that the penalty for the max-product fair scheduling criterion is negligible and derive the penalty for the max-min fair scheduling criterion. We analyze ergodic behaviors for the Rayleigh-fading channel both when the average SNRs are homogeneous (identical) and when the SNRs are heterogeneous (different). For the homogeneous case, it is shown that the penalty diminishes as the number of transmit antennas increases. For the heterogeneous case, there is an inevitable bias term which is associated with the users' SNR distribution.
机译:尽管会导致吞吐量损失,但无线资源调度中的公平性考虑对于提高用户体验的质量非常重要。本文分析了获得多个天线广播信道的一定公平性标准时的相关代价。我们将公平性惩罚定义为高SNR方案中可实现的总速率差。我们证明最大产品公平调度标准的惩罚是可以忽略的,并得出最大最小公平调度标准的惩罚。当平均SNR是同质的(相同)和SNR是异构的(不同)时,我们分析瑞利衰落信道的遍历行为。对于同类情况,表明随着发射天线数量的增加,惩罚减少。对于异构情况,存在不可避免的偏差项,该偏差项与用户的SNR分布相关。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号