m序列复合码的一种快速相关算法  

A fast correlation algorithm for multiple PN code of m^- sequence

作　　者：刘震昆[1] 黄顺吉[1] 

机构地区：[1]电子科技大学电子工程系,四川成都610054

出　　处：《信号处理》2006年第2期215-218,共4页Journal of Signal Processing

摘　　要：在直扩系统中,PN码的快速捕获十分重要。由于m序列的优选对有限,故在实际应用中采用复合码作为PN 码。常用的复合码主要有Gold序列和Kasami小集合序列。本文提出了一种利用快速沃尔什变换(FWT)实现对复合码进行快速相关的算法。这种算法适用于由两个m序列模2加形成的复合码,并原则上可以推广到Kasami大集合序列的捕获上。分析表明,我们提出的算法与传统相关算法相比,降低了算法的时间复杂度。In DS-CDMA systems ,it is very important to fast capture PN code. In practice, because the number of m^- sequences＇ preferred pair is very little, so people usually use multiple code as PN code. Gold sequences and Kasami small set sequences are in common. In this article,we propose a fast correlation algorithm of multiple PN code by Fast Walsh Transform（FWT）. Our proposed algorithm is adaptive any multiple code synthesized by two m^- sequences model 2 add, and it can be extended to Kasami large set sequences. Our analysis shows that the correlative time of proposed algorithm is shorter than that of slide-correlation.

关 键 词：直扩系统 算法 快速沃尔什变换 GOLD序列 Kasami序列 

分 类 号：TN914.4[电子电信—通信与信息系统] TP391.41[电子电信—信息与通信工程]