二元2~n周期序列谱免疫度的快速算法  

A fast algorithm for spectral immunity of binary 2~n-periodic sequences

作　　者：王宁[1] 顾聪[1] WANG Ning;GU Cong(College of Science, Zhongyuan University of Technology, Zhengzhou 450007, China)

机构地区：[1]中原工学院理学院,河南郑州450007

出　　处：《佛山科学技术学院学报（自然科学版）》2017年第4期23-27,共5页Journal of Foshan University(Natural Science Edition)

基　　金：河南省教育厅科研项目(13A110117)

摘　　要：根据计算二元2~n周期序列的线性复杂度的算法,给出了一个能够快速计算二元2~n周期序列的谱免疫度的新算法,该算法与Games-Chan算法有相同的复杂度,能够同时求出对应的零化序列,并且举例说明了该算法的优越性。According to the algorithm for computing the linear complexity of binary2n-periodic sequences,one new algorithm for fast computing the spectral immunity of binary2nperiodic sequences is provided in this paper which can find the corresponding annihilator simultaneously,and an example is provided to show the efficiency of this new algorithm.

关 键 词：二元序列 线性复杂度 谱免疫度 零化序列 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]