Complexity of chaotic binary sequence and precision of its numerical simulation

Niansheng Liu, Donghui Guo, Gerard Parr

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


Numerical simulation is one of primary methods in which people study the property of chaotic systems. However, there is the effect of finite precision in all processors which can cause chaos to degenerate into a periodic function or a fixed point. If it is neglected the precision of a computer processor for the binary numerical calculations, the numerical simulation results may not be accurate due to the chaotic nature of the system under study. New and more accurate methods must be found. A quantitative computable method of sequence complexity evaluation is introduced in this paper. The effect of finite precision is evaluated from the viewpoint of sequence complexity. The simulation results show that the correlation function based on information entropy can effectively reflect the complexity of pseudorandom sequences generated by a chaotic system, and it is superior to the other measure methods based on entropy. The finite calculation precision of the processor has significant effect on the complexity of chaotic binary sequences generated by the Lorenz equation. The pseudorandom binary sequences with high complexity can be generated by a chaotic system as long as the suitable computational precision and quantification algorithm are selected and behave correctly. The new methodology helps to gain insight into systems that may exist in various application domains such as secure communications and spectrum management.
Original languageEnglish
Pages (from-to)549-556
Number of pages8
JournalNonlinear Dynamics
Early online date22 Mar 2011
Publication statusPublished - Jan 2012

Cite this