两种应用于HSDPA的最大C/I调度算法的仿真性能分析

北京邮电大学学报 ›› 2003, Vol. 26 ›› Issue (1): 27-31.

两种应用于HSDPA的最大C/I调度算法的仿真性能分析

崔春风, 杜蕾, 纪阳, 张平

北京邮电大学电信工程学院, 北京 100876

出版日期:2004-01-28
作者简介:崔春风(1973—),男,博士生。
基金资助:
国家“863计划”资助项目(2001AA123016)

Simulation Analysis of Two Max C/I Scheduling Algorithms Applied to HSDPA

CUI Chun-feng, DU Lei, JI Yang, ZHANG Ping

Telecommunication Engineering School, Beijing University of Posts andTelecommunications, Beijing 100876, China

Online:2004-01-28

摘要/Abstract

摘要： 高速下行分组接入是UMTS系统为适应高速下行分组业务的需求而提出的解决方案,其调度算法采用最大C/I和RR。对两种不同的最大C/I调度算法——完全的最大C/I算法和重传优先的最大C/I算法进行了性能的仿真,得到了最大重发次数对误帧率影响的曲线。结果表明,重传优先最大C/I算法在最大重发次数低时性能较佳,而完全最大C/I算法在最大重发次数高时性能较佳。分析了仿真结果产生的原因。

关键词: 最大C/I调度算法, 高速下行分组接入, 最大重发次数

Abstract: HSDPA is the solution to the high speed downlink packet services in UMTS. The max C/I scheduling is one of its scheduling algorithms. Two different scheduling algorithms, thorough max C/I and retransmission priority max C/I, were simulated, andthe relation curve of the maximum number of retransmission and FER was obtained. When the maximum number of retransmission is low the performance of thorough max C/I is better than retransmission priority max C/I, and when maximum number of retransmissionis high the performance of retransmission priority max C/I is better than thorough max C/I. The cause of the simulation results was also analyzed.

Key words: max C/I scheduling algorithm, high speed downlink packet access, maximum number of retransmission

中图分类号:

TN929.5

崔春风, 杜蕾, 纪阳, 张平. 两种应用于HSDPA的最大C/I调度算法的仿真性能分析[J]. 北京邮电大学学报, 2003, 26(1): 27-31.

CUI Chun-feng, DU Lei, JI Yang, ZHANG Ping. Simulation Analysis of Two Max C/I Scheduling Algorithms Applied to HSDPA[J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2003, 26(1): 27-31.

[1]	范晨，张琳，杨大成. 一种在混合业务中保证流业务QoS的调度算法[J]. 北京邮电大学学报, 2007, 30(3): 75-78.
[2]	堵久辉, 陈书平, 王文博. TDD-HSDPA系统AMC与HARQ融合机制[J]. 北京邮电大学学报, 2006, 29(6): 120-124.
[3]	李勇，堵久辉，王文博. TDD-HSDPA/SA系统中MCS选择机制的研究[J]. 北京邮电大学学报, 2006, 29(2): 114-117.