Periodic performance of the chaotic spread spectrum sequence on finite precision

Abstract It is well known that the periodic performance of spread spectrum sequence heavily affects the cor-relative and secure characteristics of communication systems. The chaotic binary sequence is paid more and moreattention since it is one kind of applicable spread spectrum sequences. However, there are unavoidable short cyclicproblems for chaotic binary sequences in finite precision. The chaotic binary sequence generating methods arestudied first. Then the short cyclic behavior of the chaotic sequences is analyzed in detail, which are generatedby quantification approaches with finite word-length. At the same time, a chaotic similar function is defined forpresenting the cyclic characteristics of the sequences. Based on these efforts, an improved method with scramblingcontrol for generating chaotic binary sequences is proposed. To quantitatively describe the improvement of periodicperformance of the sequences, an orthogonal estimator is also defined. Some simulating results are provided. Fromthe theoretical deduction and the experimental results, it is concluded that the proposed method can effectivelyincrease the period and raise the complexity of the chaotic sequences to some extent.

[1]  Jinsheng Sun,et al.  A block cipher based on a suitable use of the chaotic standard map , 2005 .

[2]  Wang Ying,et al.  The optimized process and property test for Lorenz chaotic sequences , 2005, Proceedings. 2005 International Conference on Communications, Circuits and Systems, 2005..

[3]  Jaafar M. H. Elmirghani,et al.  A chaotic spreading code and its application to blind channel estimation , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[4]  P. Borcherds,et al.  The digital tent map and the trapezoidal map , 1993 .

[5]  Michael W. Hoffman,et al.  Pseudo-chaotic PN-sequence generator circuits for spread spectrum communications , 2004 .

[6]  Z. Liu,et al.  An application of chaos: generating binary pseudo-random sequences , 1988, 1988., IEEE International Symposium on Circuits and Systems.

[7]  Jiashu Zhang,et al.  Investigation on Pseudorandom Properties of Chaotic Stream Ciphers , 2006, 2006 IEEE International Conference on Engineering of Intelligent Systems.

[8]  J. Cernák.  Digital generators of chaos , 1996 .

[9]  Zhou Tingxian,et al.  A method of generating chaotic spread-spectrum sequences based on multilevel quantification , 2003, 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03)..

[10]  Hiroyuki Kamata,et al.  Communication with chaos via DSP implementation , 1997, Proceedings of 1997 IEEE International Symposium on Circuits and Systems. Circuits and Systems in the Information Age ISCAS '97.

[11]  M. Jessa,et al.  The period of sequences generated by tent-like maps , 2002 .

[12]  X. Mou,et al.  On the security of a chaotic encryption scheme: problems with computerized chaos in finite computing precision , 2003 .

[13]  C. Vladeanu,et al.  Periodic chaotic spreading sequences with better correlation properties than conventional sequences - BER performances analysis , 2003, Signals, Circuits and Systems, 2003. SCS 2003. International Symposium on.

[14]  Simon Haykin,et al.  Communication Systems , 1978 .

[15]  J. Palmore,et al.  Computer arithmetic, chaos and fractals , 1990 .

[16]  Yong Zhu,et al.  Discrete chaotic circuit and the property analysis of output sequence , 2005, IEEE International Symposium on Communications and Information Technology, 2005. ISCIT 2005..

[17]  M.G.M. Hussain,et al.  Ultra-wideband impulse radar-an overview of the principles , 1998 .