中文摘要：

针对在信道状态信息不完备时，很难兼顾系统容量和公平性这一问题，通过引人公平松弛因子，提出一种公平性可调的遍历容量最大化资源分配算法。为了降低计算复杂度，在利用对偶优化方法求解拉格朗日算子过程中，提出同层循环迭代的搜索方式以代替传统的内外层循环迭代方式。通过仿真和分析表明．该算法在满足公平性的同时实现了遍历容量最大化，且计算复杂度明显降低。

英文摘要：

Existing resource allocation algorithms can＇t balance system capacity and fairness well when the channel state information is imperfect. In order to solve this problem, a fair resource allocation algorithm was proposed to maximize the system ergodic capacity, while the fairness could be adjusted flexibly by introducing the fairness relaxation factor. In order to reduce the complexity in the use of dual optimization method for solving the lagrange operator process, an iteration searching method in the same layer was proposed to replace the traditional multi-layer iteration searching method. Simulation results show that the proposed algorithm can effectively maximize the system ergodic capacity and guarantee the fairness, while the computational complexity was reduced significantly.