基于块对角化和服务公平性的次最优用户选择方案

该文基于块对角化的思想提出了一种次最优用户选择方案。首先推导出一个和速率容量的上界公式，将其作为该文提出算法的选择准则；然后用此上界公式代替瞬时和容量公式作为自适应准则，得到了所提出算法的简化算法；最后考虑到用户之间服务公平性的因素，把该文的提出算法与比例公平调度机制相结合，使得系统既能获得一定的信道容量增益又能让所有用户均得到公平的服务。仿真结果表明，该文所提出算法具有接近最优的性能，与比例公平调度机制相结合后可以达到系统和容量与服务公平性的折衷。

A Suboptimal User Selection Algorithm Based on Block Diagonalization and Fairness

In this paper, a suboptimal user selection method is proposed based on Block Diagonalization (BD). Firstly, an upper-bound of sum-rate capacity is deduced, and is used as the selection criterion of proposed algorithm. Secondly, the upper-bound is used as the adaptive criterion instead of capacity formula, called simplification of the proposed algorithm. Finally, considering the fairness between users, proposed algorithm is combined with Proportional Fair Scheduling (PFS) method. The simulation results show that proposed algorithm almost achieves the performance of the optimal algorithm and the proposed algorithm with PFS can obtain a tradeoff between the system sum-rate capacity gain and fairness.