首页> 外文期刊>IEEE Transactions on Signal Processing >Traffic Aware Resource Allocation Schemes for Multi-Cell MIMO-OFDM Systems
【24h】

Traffic Aware Resource Allocation Schemes for Multi-Cell MIMO-OFDM Systems

机译:多小区MIMO-OFDM系统的流量感知资源分配方案

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

摘要

We consider a downlink multi-cell multiple-input multiple-output (MIMO) interference broadcast channel (IBC) using orthogonal frequency division multiplexing (OFDM) with multiple users contending for space-frequency resources in a given scheduling instant. The problem is to design precoders efficiently to minimize the number of backlogged packets queuing in the coordinating base stations (BSs). Conventionally, the queue weighted sum rate maximization (Q-WSRM) formulation with the number of backlogged packets as the corresponding weights is used to design the precoders. In contrast, we propose joint space-frequency resource allocation (JSFRA) formulation, in which the precoders are designed jointly across the space-frequency resources for all users by minimizing the total number of backlogged packets in each transmission instant, thereby performing user scheduling implicitly. Since the problem is nonconvex, we use the combination of successive convex approximation (SCA) and alternating optimization (AO) to handle nonconvex constraints in the JSFRA formulation. In the first method, we approximate the signal-to-interference-plus-noise ratio (SINR) by convex relaxations, while in the second approach, the equivalence between the SINR and the mean squared error (MSE) is exploited. We then discuss the distributed approaches for the centralized algorithms using primal decomposition and alternating directions method of multipliers. Finally, we propose a more practical iterative precoder design by solving the Karush–Kuhn–Tucker expressions for the MSE reformulation that requires minimal information exchange for each update. Numerical results are used to compare the proposed algorithms to the existing solutions.
机译:我们考虑使用正交频分复用(OFDM)的下行链路多小区多输入多输出(MIMO)干扰广播信道(IBC),其中多个用户在给定的调度瞬间争夺空频资源。问题是有效地设计预编码器,以最小化在协调基站(BS)中排队的积压包的数量。常规地,以积压的分组的数量作为相应权重的队列加权总和速率最大化(Q-WSRM)公式被用来设计预编码器。相比之下,我们提出了联合时空资源分配(JSFRA)公式,其中通过最小化每个传输瞬间中积压的数据包总数,为所有用户共同设计跨空间频率资源的预编码器,从而隐式执行用户调度。由于问题是非凸的,因此我们使用连续凸逼近(SCA)和交替优化(AO)的组合来处理JSFRA公式中的非凸约束。在第一种方法中,我们通过凸松弛来近似信号干扰加噪声比(SINR),而在第二种方法中,则利用SINR和均方误差(MSE)之间的等价关系。然后,我们讨论使用原始分解和乘法器交替方向方法的集中式算法的分布式方法。最后,我们通过求解Karush–Kuhn–Tucker表达式(针对MSE重新制定)提出了一种更实用的迭代预编码器设计,该表达式对于每次更新都需要最少的信息交换。数值结果用于将所提出的算法与现有解决方案进行比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号