空间复用系统分组调度机制研究

由于现有的轮询算法系统容量较低,而多用户分集算法无法考虑用户的公平性.在结合了轮询、最优用户分配和最优天线分配算法的基础上,提出了一种新的改进的空间复用系统下行分组调度算法,该算法在轮询的基础上,利用了多用户分集特性,使系统容量得到非线性增长,在用户公平性和系统容量之间取得了较好的折衷.同时提出了“最大删除”算法来完成信道和用户的一一映射,系统容量要略小于穷举法所得到的系统容量,但基站计算的次数由NT!降低到NT次,降低了系统复杂性,这在NT比较大时是非常重要的.

Study of packet scheduling disciplines for spatial multiplexing system

Because the channel capacity of existing round robin scheduling is low,a multi-user diversity algorithm cannot consider the fairness among users.Based on existing scheduling disciplines such as round robin scheduling,optimal user allocation and optimal antenna allocation,an improved spatial multiplexing system downlink packet scheduling discipline is proposed that combines the characteristic of round robin scheduling and multi-user diversity in order to increase channel capacity nonlinearly.Also proposed is a "max-delete" calculation to accomplish the "one-to-one" mapping between antennas and user.Channel capacity was found to be slightly lower than when using an exhausted search method,but the computation times of the base station were reduced from N-T! to N-T.This scheduling discipline reduces the computation complexity of a base station and is important when N-T is large.