W-CDMA系统中辅同步信道捕获的改进  

AN IMPROVED SCHEME FOR SECONDARY SYNCHRONOUS CHANNEL ACQUISITION IN W-CDMA SYSTEM

作　　者：牛凯[1] 朱春梅[1] 吴伟陵[1] 

机构地区：[1]北京邮电大学信息工程学院,北京100876

出　　处：《电子与信息学报》2003年第1期106-111,共6页Journal of Electronics & Information Technology

基　　金：国家自然科学基金(No.69896243)

摘　　要：W-CDMA系统中,各基站之间是异步时序关系。为了快速识别基站,3GPP协议引入了三步同步的小区搜索算法。第二步对辅同步信道的搜索是极其重要的。采用传统的匹配滤波器组结构运算复杂度比较大。该文分析了辅同步信道的结构,根据其构造特性提出了部分快速哈达玛变换(PFHT)的快速算法。理论分析证明该算法减少了接近70％的运算量。同时,针对辅同步信道的RS码表搜索,提出了一种分布式子图搜索算法,与穷举搜索相比,大幅度降低了复杂度。经过这两方面的改进,使辅同步信道捕获的硬件设计复杂度大大降低,对于工程应用具有重要价值。The timing relationship between base stations is asynchronous in W-CDMA system. So the three-step cell search algorithm is introduced in 3GPP protocols in order to identify the special base station quickly. The second step, Secondary Synchronous CHannel(S-SCH) acquisition, is much critical, but the computing complexity of the conventional matched filter bank method is very large. This paper proposes Partial Fast Hadamard Transform(PFHT) according to the S-SCH structural property, which extremely reduces the computing complexity to almost 70%. On the other hand, a distributed sub-graph search algorithm is put forward to save more complication than RS code table brute-force search. In a word, the hardware complexity is dramatically cut down by the improved scheme, which is valuable for engineering applications.

关 键 词：W-CDMA系统 同步 信道 捕获 匹配滤波器组 哈达玛变换 穷举搜索算法 分布式子图搜索算法 码分多址 

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