TY - JOUR
T1 - Capacity-fairness controllable scheduling algorithms for single-carrier FDMA
AU - Iwata, Takayoshi
AU - Miyazaki, Hiroyuki
AU - Adachi, Fumiyuki
PY - 2014/7
Y1 - 2014/7
N2 - Scheduling imposes a trade-off between sum capacity and fairness among users. In some situations, fairness needs to be given the first priority. Therefore, a scheduling algorithm which can flexibly control sum capacity and fairness is desirable. In this paper, assuming the single-carrier frequency division multiple access (SC-FDMA), we propose three scheduling algorithms: modified max-map, proportional fairness (PF)-map, and max-min. The available subcarriers are grouped into a number of subcarrier-blocks each having the same number of subcarriers. The scheduling is done on a subcarrier-block by subcarrier-block basis to take advantage of the channel frequency-selectivity. The same number of noncontiguous subcarrier-blocks is assigned to selected users. The trade-off between sum capacity and fairness is controlled by changing the number of simultaneously scheduling users per time-slot. Capacity, fairness, and peak-to-average power ratio (PAPR) when using the proposed scheduling algorithms are examined by computer simulation.
AB - Scheduling imposes a trade-off between sum capacity and fairness among users. In some situations, fairness needs to be given the first priority. Therefore, a scheduling algorithm which can flexibly control sum capacity and fairness is desirable. In this paper, assuming the single-carrier frequency division multiple access (SC-FDMA), we propose three scheduling algorithms: modified max-map, proportional fairness (PF)-map, and max-min. The available subcarriers are grouped into a number of subcarrier-blocks each having the same number of subcarriers. The scheduling is done on a subcarrier-block by subcarrier-block basis to take advantage of the channel frequency-selectivity. The same number of noncontiguous subcarrier-blocks is assigned to selected users. The trade-off between sum capacity and fairness is controlled by changing the number of simultaneously scheduling users per time-slot. Capacity, fairness, and peak-to-average power ratio (PAPR) when using the proposed scheduling algorithms are examined by computer simulation.
KW - Max-map
KW - Maxmin
KW - Multi-user scheduling
KW - PF-map
KW - SC-FDMA
UR - http://www.scopus.com/inward/record.url?scp=84903746289&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84903746289&partnerID=8YFLogxK
U2 - 10.1587/transcom.E97.B.1474
DO - 10.1587/transcom.E97.B.1474
M3 - Article
AN - SCOPUS:84903746289
SN - 0916-8516
VL - E97-B
SP - 1474
EP - 1482
JO - IEICE Transactions on Communications
JF - IEICE Transactions on Communications
IS - 7
ER -