基于路损的DCA算法的研究及实现  

Research and realization of DCA algorithm based on path loss

作　　者：唐宏[1] 赵林君[1] 舒刚[1] 赵超颖[1] 

机构地区：[1]重庆邮电大学移动通信技术重庆市重点实验室,重庆400065

出　　处：《电子测量技术》2011年第10期30-33,共4页Electronic Measurement Technology

基　　金：国家863课题2009AA011302;教育部春晖计划Z2007-1-63002

摘　　要：DCA算法实现了上行基于ISCP及下行基于TxCP的载波和时隙的优先级排序。上行采用时隙的ISCP反映了邻小区对本小区的干扰程度,但是下行基于TxCP的优先级排序,不能体现用户与邻小区的距离关系,影响算法的规模应用。在DCA算法的基础上,根据用户上报的P_CCPCH RSCP测量值计算出路损信息,对原有算法进行优化,体现了用户与邻小区的关系,有利于为用户选择更合适的载波和时隙,提高DCA算法中载波和时隙排序的准确度,改善网络指标。DCA algorithm is realized the priority of the carrier and timeslot based on ISCP uplink and TxCP downlink.By the ISCP uplink reflects the degree of interference neighbor cell to current cell,but the priority order of the TxCP downlink,can＇t reflect the distance relationship between current cell and neighbor cell,influencing the scale application of the algorithm.This paper is based on the DCA algorithm,calculate the path loss according to the P_CCPCH RSCP reported by UE,combined with the path loss infomation,optimize the old algorithm,reflecting the distance relationship between current cell and neighbor cell,is good for UE to select the carrier and timeslot more appropriate,improve the accuracy of the carrier and the timeslot in DCA algorithm and improve the network index.

关 键 词：路损 DCA 载波 时隙 

分 类 号：TN923[电子电信—通信与信息系统]