一种快速生成p元级联统一序列的迭代算法  

Iterative Method for Accelerating Constructing p-ary Cascade Unified Sequences

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

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

出　　处：《南京理工大学学报》2006年第1期57-60,共4页Journal of Nanjing University of Science and Technology

基　　金：国家自然科学基金(60272026)

摘　　要：通过对级联统一序列和移位序列的研究,提出了一种快速生成p元级联统一序列的算法,该算法采用迭代的方式,借助级联GMW序列和相应内部序列的移位序列能够快速生成级联统一序列,该算法克服了迹函数算法复杂的弊端,降低了运算复杂度,比以往的生成方法简单易行且易于理解,有利于工程人员快速方便地进行序列的软硬件实现。By studying cascade unified sequences and shift sequences, a new iterative algorithm for accelecrating constructing p-ary cascade unified sequences is presented. Using cascade GMW sequences and shift sequences of the inner sequences, cascade unified sequences can be quickly constructed. This algorithm conquers the shortcoming of trace function algorithm and its calculation complexity is reduced mostly. The method is easy for understanding and implementation comparing with the conventional method. Engineers can implement softwares and hardwares with these sequences quickly.

关 键 词：移位序列 内部序列 级联GMW序列 级联统一序列 

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