一种完全互补序列的简单构造方法  

Research of Simple Constructing Method of Complete Complementary Sequences

作　　者：贾志成[1] 葛玲[1] 王婧[1] 李树峰[1] 

机构地区：[1]河北工业大学信息工程学院,天津300401

出　　处：《河北工业大学学报》2007年第4期1-5,共5页Journal of Hebei University of Technology

基　　金：国家自然科学基金项目(69972042)

摘　　要：针对Suehiro的完全互补序列的构造方法比较繁琐的缺点,本文提出了一种名为"生成树"的完全互补序列的构造方法.该方法首先选择一组基础码组,之后通过矩阵的简单递推就能构造完全互补序列,而且选择的基础码组不同,构造的完全互补序列也不同,这样能同时扩展生成完全互补序列的数目和长度.该方法与Suehiro的构造方法比较,灵活、简单、易行,是一个构造完全互补序列的好方法.For the defects of constructing method of complete complementary sequences presented by Suehiro, such as so complex, a simple method of constructing complete complementary sequences based on a method of generating LS codes named ＇generating tree＇ is presented, which can be worked by recursion of matrix. The number and length of complete complementary sequences can also be increased when different base code pair be selected, It shows that ＇generating tree＇ is a good method for constructing complete complementary sequences which is simple and flexible.

关 键 词：完全互补序列 LS码 非循环自相关 非循环互相关 

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