一种生成p元d型序列的快速算法  

An algorithm for accelerating constructing p-ary d-form sequences

作　　者：陈嘉兴[1] 周廷显[1] 许成谦[2] 王永建[1] 

机构地区：[1]哈尔滨工业大学通信技术研究所,哈尔滨150001 [2]燕山大学信息科学与工程学院,河北秦皇岛066004

出　　处：《哈尔滨工业大学学报》2006年第12期2019-2021,共3页Journal of Harbin Institute of Technology

基　　金：国家自然科学基金资助项目(60272026)

摘　　要：p元d型序列是一类和级联GMW序列一样具有理想自相关性能的序列.它原有的迹函数生成方法需要大量非线性运算,并且需要掌握较多的有限域知识,不利于工程人员快速方便的进行序列的软硬件实现.通过对p元d型序列和移位序列的研究,提出了一种快速生成p元d型序列的算法,该算法借助m序列和相应内部序列的移位序列能够快速生成p元d型序列,比以往的生成方法简单易行且易于理解.p-ary d-form sequences have optimal correlation properties like cascade GMW sequences. The original method of constructing these sequences needs lots of nonlinear operations. Engineers must master much limited field knowledge and have difficulty in implementing these sequences with software and hardware. By studying p-ary d-form sequences and shift sequences, a new algorithm for accelerating constructing p-ary d-form sequences is presented. Using m sequences and shift sequences of the inner sequences we can getp-ary d-form sequences quickly and this method is easy to understand and implement.

关 键 词：移位序列 M序列 m序列和序列 p元d型序列 内部序列 

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