Periodic performance of the chaotic spread spectrum sequence on finite precision  

作　　者：Zhu Canyan Zhang Lihua Wang Yiming Liu Jiasheng Mao Lingfeng 

机构地区：[1]School of Electronic & Information Engineering, Soochow Univ., Suzhou 215021, P. R. China [2]School of Electronic and Electric Engineering, East China Jiaotong Univ., Nanchang 310013, P. R. China

出　　处：《Journal of Systems Engineering and Electronics》2008年第4期672-678,共7页系统工程与电子技术（英文版）

基　　金：the National Natural Science Foundation of China (60572075);the Natural Science Researching Project for Jiangsu Universities (05KJD510177).

摘　　要：It is well known that the periodic performance of spread spectrum sequence heavily affects the correlative and secure characteristics of communication systems. The chaotic binary sequence is paid more and more attention since it is one kind of applicable spread spectrum sequences. However, there are unavoidable short cyclic problems for chaotic binary sequences in finite precision. The chaotic binary sequence generating methods are studied first. Then the short cyclic behavior of the chaotic sequences is analyzed in detail, which are generated by quantification approaches with finite word-length. At the same time, a chaotic similar function is defined for presenting the cyclic characteristics of the sequences. Based on these efforts, an improved method with scrambling control for generating chaotic binary sequences is proposed. To quantitatively describe the improvement of periodic performance of the sequences, an orthogonal estimator is also defined. Some simulating results are provided. From the theoretical deduction and the experimental results, it is concluded that the proposed method can effectively increase the period and raise the complexity of the chaotic sequences to some extent.It is well known that the periodic performance of spread spectrum sequence heavily affects the correlative and secure characteristics of communication systems. The chaotic binary sequence is paid more and more attention since it is one kind of applicable spread spectrum sequences. However, there are unavoidable short cyclic problems for chaotic binary sequences in finite precision. The chaotic binary sequence generating methods are studied first. Then the short cyclic behavior of the chaotic sequences is analyzed in detail, which are generated by quantification approaches with finite word-length. At the same time, a chaotic similar function is defined for presenting the cyclic characteristics of the sequences. Based on these efforts, an improved method with scrambling control for generating chaotic binary sequences is proposed. To quantitatively describe the improvement of periodic performance of the sequences, an orthogonal estimator is also defined. Some simulating results are provided. From the theoretical deduction and the experimental results, it is concluded that the proposed method can effectively increase the period and raise the complexity of the chaotic sequences to some extent.

关 键 词：chaotic binary sequence finite precision periodic performance orthogonal estimator 

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