Low-complexity and QoS-awared scheduling algorithm for LTE
Based on the relaxation based linearization principle and the greedy algorithm,a scheduling algorithm named QPF was designed with low complexity and full QoS-awared.It is divided into two parts:time and frequency domain,which can allocate all resources at once according to two service types:GBR and...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2013-12-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436X.2013.12.020/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Based on the relaxation based linearization principle and the greedy algorithm,a scheduling algorithm named QPF was designed with low complexity and full QoS-awared.It is divided into two parts:time and frequency domain,which can allocate all resources at once according to two service types:GBR and Non-GBR service.By this way the computation complexity decreases from O(M<sup>N</sup>)to O(M lb N).The proposed algorithm has a balanced performance in si-mulation,which can get 10% improvement in some dimensions compared with the references with high load and provide a nice trade-off between the performance and complexity. |
|---|---|
| ISSN: | 1000-436X |