Scheduling algorithms for lte downlink
4.0
LTE uplink scheduling can be addressed as an optimization problem, where the de-sired solution is the mapping between the schedulable UEs to schedulable PRBs that maximizes the desired performance target. Solving the scheduling problem can be very complex given the number of factors to take into account, as well as the virtually unlimited number of scheduling patterns to examine. In addition, the packet sched-uler faces the hard-time constraints where the scheduler has only one TTI length to come up with the optimal allocation scheme