a scheduling method

Abstract

The invention discloses a scheduling method which comprises a step of setting the scheduling priority of each user to be scheduled as a highest priority for each user to be scheduled which is not scheduled in a recently specified time range in a current sub frame to be scheduled, a step of determining the initial priority of the user for each user to be scheduled beside the unscheduled user, calculating the relative code rate of the user, and according to a rule of reducing the scheduling priority when the relative code rate is low, determining the scheduling priority of the user according to the relative code rate and the initial priority, and a step of scheduling the user according to the scheduling priority of each user to be scheduled in the current sub frame to be scheduled. By using the scheduling method, the utilization rate of a wireless resource can be improved.

Description

technical field [0001] The invention relates to mobile communication technology, in particular to a scheduling method. Background technique [0002] The most mainstream and widely used MAC layer scheduling algorithm in existing mobile communication systems is the PF scheduling algorithm. This algorithm comprehensively considers user needs, channel quality, service delay, and fairness to obtain user priorities. Prioritize scheduling users. [0003] In the scheduling process, when the amount of scheduled user data is not enough to fill the minimum granularity of scheduling resources, redundant information will inevitably be filled, which causes wireless resources to be wasted. Taking TD-SCDMA system HSDPA scheduling as an example, in order to reduce the inter-code interference between users, the mainstream configuration of the existing network is HS-PDSCH time division multiplexing between users, and the code division function is not enabled. In this case, when scheduling use...

AI Technical Summary

Problems solved by technology

When the user service rate is low, the channel quality at this time indicates that one time slot can transmit N bits, but there are only M bits in the cache, if M<

[0004] For other wireless communication systems, this problem also exists. For example, for the LTE system, the allocation granularity of wireless resources is 2 RB blocks. When the amount of user data is insufficient, there is also a problem of waste of wireless resources.

Images