Proportional fair scheduling algorithm for SC-FDMA in LTE uplink

In uplink 3GPP LTE, SC-FDMA has been regarded as an attractive alternative to OFDMA due to lower Peak-to-Average Power Ratio (PAPR) characteristic. However, in order to get the benefit of PAPR, it requires a contiguous assignment of resource blocks to a single user. In this paper, we suggest heuristic algorithm for proportional fair (PF) scheduling which is known to be NP-hard problem. Under the contiguity constraint, conventional heuristic algorithms assign resource block to a user who has the highest metric and keep on doing assignment according to greedy selection but without any examination of prior selected choice. Our work differs from the conventional works in considering user selection based on PF metric difference and comparison of marginal scheduling metric for examination of selected choice. In simulation results, we demonstrated that the proposed scheme shows better fairness in terms of CDF of normalized throughput and Jain´s fairness index.