一种TD-SCDMA系统局部最优化码规划算法  

A Local Optimized Code Planning Algorithm in TD-SCDMA System

作　　者：高志斌[1] 黄联芬[1] 

机构地区：[1]厦门大学信息科学与技术学院,福建厦门361005

出　　处：《厦门大学学报（自然科学版）》2013年第3期321-325,共5页Journal of Xiamen University：Natural Science

基　　金：国家自然科学基金项目(61172097)

摘　　要：时分同步码分多址(TD-SCDMA)系统的扩频码和扰码均为短码,其复合扩频码出现高概率的强相关性,易造成较大干扰,影响网络尤其是数据业务的服务质量.在分析码资源相关性及复合码字分组的基础上,提出一种基于图论的TD-SCDMA系统局部最优化码规划算法,对网络中各小区可用的下行同步码及扰码择优分配,以降低相邻小区间干扰.利用该方法对某现网案例进行重新码规划,比原规划方案干扰概率大为降低,在TD-SCDMA网络码规划中具备较高应用价值.The short orthogonal variable spreading factor codes and scrambling codes,and high probability of strong correlation of complex spreading codes, could easily lead to greater interference in TD-SCDMA system. Specially, the quality of data service could be affected in the network. Based on analysis of code resources and complex spreading code grouping,a local optimized code planning aL gorithm is proposed in this paper. Based on graph theory,the allocation of downlink synchronization codes and the scrambling code of each cell in the network could be optimized to reduce interference among adjacent cells. In this paper, a case to re-plan the codes of some existing network is shown. The probability of interference is greatly reduced than the original planning, indicating that the algo- rithm proposed is engineering applied in TD-SCDMA network.

关 键 词：TD-SCDMA 码规划 复合扩频码 优化 

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