WCDMA系统中正交可变扩频码的混合分配算法  

Hybrid Allocation Algorithm of Orthogonal Variable-Spreading-Factor Codes for WCDMA

作　　者：赵宇[1] 王鹏[1] 曹达仲[1] 杨嘉琛[1] 

机构地区：[1]天津大学电子信息工程学院,天津300072

出　　处：《天津大学学报》2005年第10期913-918,共6页Journal of Tianjin University(Science and Technology)

摘　　要：针对WCDMA系统中各种正交可变扩频码(OVSF码)的单码分配方案,提出一种混合分配(HA)算法.HA算法分为初始码树划分和OVSF码分配2个阶段.仿真结果表明,HA算法很好地克服了crowded-first算法公平性差和RDA算法呼损率高的缺点,既降低了整个系统的平均呼损率,又对各种业务不失公平性.HA算法不需要码字重分配,极大地降低了算法的复杂度,适用于实时系统共享区域的设置,可以很好地解决不同业务的业务量变化问题.共享区域的容量为系统资源的30%-40%,此时能得到最佳的呼损率.A hybrid allocation （HA） algorithm, including two steps of initial partition of code tree and orthogohal variable-spreading-factor（OVSF） code allocation, is presented for wideband code division multiple access （WCDMA） system focusing on OVSF single-code allocation in this paper. Simulation results show that HA algorithm overcomes low fairness in crowded-first algorithm and high blocking probability in RDA algorithm. Computer simulations also show significant reduction in average blocking probability and excellent fairness for all kinds of services. Nonrearrangement decreases complexity and can be applied to real-time systems by using HA. Sharing area solves the problem of traffic load variation in different services and optimal blocking probability is achieved by setting best proportion of sharing area＇s capacity, i.e. , 30%-40% of the whole system.

关 键 词：正交可变扩频因子 混合分配 共享区域 公平因子 

分 类 号：TN929.533[电子电信—通信与信息系统]