Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010 |
| Pages | 115-119 |
| Number of pages | 5 |
| DOIs | |
| Publication status | Published - 2010 |
| Event | 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010 - Jeju, Korea, Republic of Duration: 2010 Nov 17 → 2010 Nov 19 |
Publication series
| Name | 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010 |
|---|
Other
| Other | 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010 |
|---|---|
| Country | Korea, Republic of |
| City | Jeju |
| Period | 10/11/17 → 10/11/19 |
Keywords
- Frequency-domain scheduling
- Proportional fairness
- SC-FDMA
- Virtual MIMO
ASJC Scopus subject areas
- Information Systems
- Computer Networks and Communications
Fingerprint Dive into the research topics of 'Scheduling for virtual MIMO in single carrier FDMA (SC-FDMA) system'. Together they form a unique fingerprint.
Cite this
Kim, J. W., Hwang, I. S., & Kang, C. G. (2010). Scheduling for virtual MIMO in single carrier FDMA (SC-FDMA) system. In 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010 (pp. 115-119). [5674709] (2010 International Conference on Information and Communication Technology Convergence, ICTC 2010). https://doi.org/10.1109/ICTC.2010.5674709