arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1703.04072cs.ITmath.IT
收藏

全双工基站辅助OFDMA系统的资源分配

Resource Allocation for a Full-Duplex Base Station Aided OFDMA System

Yang You, Chong Qin, Yi Gong

摘要:

在基站(BS)上采用全双工(FD)技术是提高系统性能的一种很有前途的解决方案。受此启发,我们重新审视全双工基站(FD-BS)辅助OFDMA系统,其中包括一个BS,多个上行链路/下行链路用户和多个子载波。考虑子载波、下行链路用户(DUE)、上行链路用户(UUE)之间的联合三维(3D)映射方案以及相关联的功率分配优化。具体地说,我们首先将复杂的三维映射问题分解成三个二维子问题,并分别用迭代匈牙利法求解。然后基于拉格朗日对偶方法,通过固定一个对偶点,依次求解功率分配和三维映射问题。最后利用次梯度法求出最优解。与现有的工作,只解决3D映射或功率分配问题,但具有较高的计算复杂度,我们解决这两个问题,并成功地降低了计算复杂度从指数到多项式阶。数值仿真结果验证了该方案的有效性。

英文摘要:

Exploiting full-duplex (FD) technology on base stations (BSs) is a promising solution to enhancing the system performance. Motivated by this, we revisit a full-duplex base station (FD-BS) aided OFDMA system, which consists of one BS, several uplink/downlink users and multiple subcarriers. A joint 3-dimensional (3D) mapping scheme among subcarriers, down-link users (DUEs), uplink users (UUEs) is considered as well as an associated power allocation optimization. In detail, we first decompose the complex 3D mapping problem into three 2-dimensional sub ones and solve them by using the iterative Hungarian method, respectively. Then based on the Lagrange dual method, we sequentially solve the power allocation and 3- dimensional mapping problem by fixing a dual point. Finally, the optimal solution can be obtained by utilizing the sub-gradient method. Unlike existing work that only solves either 3D mapping or power allocation problem but with a high computation complexity, we tackle both of them and have successfully reduced computation complexity from exponential to polynomial order. Numerical simulations are conducted to verify the proposed scheme.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑