This paper investigates the resource allocation problem in orthogonal frequency division multiple access networks with multiple users. Different from most works that perform resource allocation based on each subcarrier, we consider the subcarriers are grouped into chunks due to simplicity of implementation. The objective is to maximize the users’ minimal transmission rate by adjusting the transmission power allocation and chunk allocation while taking into account several important constraints. The problem is formulated as a mixed integer nonlinear programming problem, which is generally hard to solve. By binary relaxation, the problem is transformed to be a convex problem. By exploiting the special structure of the relaxed problem, a barrier method based fast algorithm is proposed. To achieve binary chunk allocation, a low complexity suboptimal algorithm is proposed further. When the number of chunks is less than the number of users, it is necessary to consider the joint admission control and resource allocation problem. To solve this problem, a fast algorithm based on bisection search and Hungarian method is designed. Simulations are carried out to validate the superior performance of the proposed algorithms in terms of the users’ minimal transmission rate and running time comparing with benchmark algorithms under different conditions.

本文研究了多用户正交频分多址网络中的资源分配问题。与大多数基于每个子载波执行资源分配的工作不同，由于实现的简单性，我们认为子载波被分组为大块。目的是在考虑几个重要约束的同时，通过调整传输功率分配和组块分配来最大化用户的最小传输速率。该问题被表述为通常难以解决的混合整数非线性规划问题。通过二元松弛，该问题转化为凸问题。通过利用松弛问题的特殊结构，提出了一种基于屏障方法的快速算法。为了实现二进制块分配，进一步提出了一种低复杂度次优算法。当组块数量小于用户数量时，有必要考虑联合接纳控制和资源分配问题。为了解决这个问题，设计了一种基于二等分搜索和匈牙利方法的快速算法。通过仿真来验证所提出算法在不同条件下与基准算法相比用户的最小传输速率和运行时间方面的优越性能。