Low complexity scheduling algorithms for the LTE uplink
Uplink scheduling in LTE systems is considered. Two low complexity heuristic algorithms for suboptimal subcarrier allocation are proposed and compared to other algorithms in the literature. Throughput and fairness analysis of the different algorithms are performed via Monte-Carlo simulations. The pr...
Saved in:
| Published in | 2009 IEEE Symposium on Computers and Communications pp. 266 - 270 |
|---|---|
| Main Authors | , , |
| Format | Conference Proceeding |
| Language | English |
| Published |
IEEE
01.07.2009
|
| Subjects | |
| Online Access | Get full text |
| ISBN | 9781424446728 1424446724 |
| ISSN | 1530-1346 |
| DOI | 10.1109/ISCC.2009.5202296 |
Cover
| Summary: | Uplink scheduling in LTE systems is considered. Two low complexity heuristic algorithms for suboptimal subcarrier allocation are proposed and compared to other algorithms in the literature. Throughput and fairness analysis of the different algorithms are performed via Monte-Carlo simulations. The proposed algorithms are utility maximizing algorithms that can be used with various utility functions. Simulations show the superiority of the proposed algorithms and that promising results can be achieved by linear complexity algorithms. |
|---|---|
| ISBN: | 9781424446728 1424446724 |
| ISSN: | 1530-1346 |
| DOI: | 10.1109/ISCC.2009.5202296 |