低重分配概率的OVSF码重分配算法  

OVSF code reassignment algorithm with low reassignment probability

作　　者：樊江[1] 黄爱苹[1] 杨恺[1] 刘中立[1] 

机构地区：[1]浙江大学信息与通信工程研究所,浙江杭州310027

出　　处：《无线电通信技术》2006年第5期21-24,共4页Radio Communications Technology

基　　金：国家自然科学基金(60472080);华为基金(YJCB2004021WL)联合资助课题

摘　　要：在采用正交可变长扩频因子(OVSF)码作为信道化码的直接序列扩频码分多址系统中,提出用重分配概率作为重分配算法的一个新的评价指标,重分配概率越小,系统的计算复杂度越低。进而提出一种低重分配概率的、基于空码容量的重分配算法,在解决本次码阻塞的同时,兼顾对未来高数据速率的呼叫的支持能力,减少未来码阻塞发生。仿真证实,重分配概率比已有2种重分配算法都小。Orthogonal variable spreading factor （OVSF） code is used as channelization codes in direct sequence code division multiple access （DS-CDMA） systems. We propose to use reassignment probability for evaluating reassignment algorithm; the algorithms with low reassignment probability have lower computational complexity. Then a novel reassignment algorithm based on the capacity of idle codes is proposed, and its reassignment probability is lower, Using the algorithm, the current code blocking is e ＂hminated, meanwhile the ability of supporting future calls with high data rates is enhanced, thus the probabihty of future code blocking decreases, Simulation results show that the reassignment probability of this algorithm is lower than those of two existing algorithms.

关 键 词：直接序列扩频码分多址 正交可变长扩频因子 码阻塞 重分配 重分配概率 

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