一种综合E序列的快速算法  

A Fast Algorithem for Synthesizing E-seguences

作　　者：赵霆[1] 

机构地区：[1]中国科学院空间科学与应用研究中心,北京100080

出　　处：《电子学报》1993年第7期107-109,共3页Acta Electronica Sinica

摘　　要：本文从E序列的组合性质出发,把E序列划分为“组”、“群”和“族”,证明了当序列长度大于等于8时,一“族”E序列的不重复性,进而导出了一种简洁,快速,高效的综合E序列的算法。这种算法对于需要产生大量长E序列的工程问题特别有效。A kind of binary sequences called E sequences is discussed.Based on their combinatorial properties,E sequences are divided into 'pack','group' and 'class'.It is proved that when their lengths are longer than or as long as 8,E sequences belonging to the same 'class' can not be identical.Finally a brief,fast and effective algorithm for synthesizing E sequences,especially a large number of long E sequences,is derived.

关 键 词：E序列 二元序列 偶位正交序列 互补序列 

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