Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2003, Vol. 26 ›› Issue (1): 27-31.

• PAPERS • Previous Articles     Next Articles

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

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

  1. Telecommunication Engineering School, Beijing University of Posts andTelecommunications, Beijing 100876, China
  • Online:2004-01-28

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

CLC Number: