TY - GEN
T1 - Scheduling for virtual MIMO in single carrier FDMA (SC-FDMA) system
AU - Kim, Jin W.
AU - Hwang, In S.
AU - Kang, Chung G.
PY - 2010
Y1 - 2010
N2 - In this paper, we consider a joint frequency- domain scheduling and user-pairing problem for virtual MIMO in SC-FDMA system, e.g., 3GPP-LTE. Due to the subcarrier adjacency constraint inherent to SC-FDMA, its complexity becomes unmanageable. We propose a greedy heuristic algorithm for PF scheduling to deal with the complexity in this joint problem. It has been shown that its performance can reach up to 90% of its upper bound.
AB - In this paper, we consider a joint frequency- domain scheduling and user-pairing problem for virtual MIMO in SC-FDMA system, e.g., 3GPP-LTE. Due to the subcarrier adjacency constraint inherent to SC-FDMA, its complexity becomes unmanageable. We propose a greedy heuristic algorithm for PF scheduling to deal with the complexity in this joint problem. It has been shown that its performance can reach up to 90% of its upper bound.
KW - Frequency-domain scheduling
KW - Proportional fairness
KW - SC-FDMA
KW - Virtual MIMO
UR - http://www.scopus.com/inward/record.url?scp=78751477353&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78751477353&partnerID=8YFLogxK
U2 - 10.1109/ICTC.2010.5674709
DO - 10.1109/ICTC.2010.5674709
M3 - Conference contribution
AN - SCOPUS:78751477353
SN - 9781424498062
T3 - 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010
SP - 115
EP - 119
BT - 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010
T2 - 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010
Y2 - 17 November 2010 through 19 November 2010
ER -