二元互补序列的两个重要性质的研究  

The Study of Two Important Properties About Binary Complementary Series

作　　者：王晓燕[1] 郭黎利[1] 

机构地区：[1]哈尔滨工程大学信息与通信工程学院,哈尔滨150001

出　　处：《通信技术》2003年第3期90-91,共2页Communications Technology

基　　金：黑龙江省自然科学基金资助;项目编号:F200037。

摘　　要：就互补序列的两个重要性质———频域互补性与保密性进行了深入研究与分析,提出了一种衡量互补序列结构复杂性的抽象概念———线性复杂度,且利用LFSR(Berlakamp-Massylinearfeedbackshiftregister)合成算法计算出了从长为4到长为32768的互补序列的线性复杂度,结果证明二元互补序列具有良好的非线性,适用于保密通信和扩频通信系统。This paper deeply analyzes two important properties of complementary se ries---complementary property in frequency domain and information se cure property,and presents an abstr act conception measuring the structure complexity of complementary series---Linear Complexity Values.Linear Co mplexity Values of complementary se ries up to the length of32768are obtained by use of LFSR synt hesis algorithm.The results clearly indicated that binary complementa ry series are strong-ly non -linear series,and are consid ered suitable for information secur e application and spread spectrum co mmunication sys-tem.

关 键 词：互补序列 频域互补性 线性复杂度 

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