An Improved Maximum C/I Scheduling Algorithm Combined with HARQ

作     者：CUI Chun feng, DU Lei, JI Yang, ZHANG Ping (Wireless Technology Innovation Labs, Beijing University of Posts & Telecommunications, Beijing 100876, P.R. China) 

作者机构：Wireless Technology Innovation Labs Beijing University of Posts & Telecommunications 北京 100876 

出 版 物：《The Journal of China Universities of Posts and Telecommunications》 (中国邮电高校学报（英文版）)

年 卷 期：2003年第10卷第2期

页      面：16-21页

核心收录：

学科分类：080904[工学-电磁场与微波技术] 0810[工学-信息与通信工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 080402[工学-测试计量技术及仪器] 0804[工学-仪器科学与技术] 081001[工学-通信与信息系统] 

基　　金：ThispaperwassupportedbytheNationalProgram"863"under(2 0 0 1AA1 2 30 1 6) 

主　　题：Maximum C/I scheduling HSDPA HARQ restransmission 

摘      要：It is well known that traffic in downlink will be much greater than that in uplink in 3 G and that beyond. High Speed Downlink Packet Access( HSDPA ) is the solution to transmission for high speed downlink packet service in UMTS , of which Maximum C/I scheduling is one of the important algorithms related to performance enhancement. An improved scheme, Thorough Maximum C/I scheduling algorithm, is presented in this article, in which every transmitted frame has the maximum C/I . The simulation results show that the new Maximum C/I scheme outperforms the conventional scheme in throughput performance and delay performance, and that the FER decreases faster as the maximum number of the retransmission increases.