Open AccessA symbolic dynamics approach for the complexity analysis of chaotic pseudo-random sequences
Author(s) -
Xiao Fang-Hong,
Yan Gui-Rong,
Han Yu-Hang
Publication year - 2004
Publication title -
wuli xuebao
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.199
H-Index - 47
ISSN - 1000-3290
DOI - 10.7498/aps.53.2876
Subject(s) - chaotic , symbolic dynamics , logistic map , computer science , statistical physics , sequence (biology) , coupled map lattice , entropy (arrow of time) , algorithm , random sequence , topological entropy , chaotic systems , theoretical computer science , mathematics , discrete mathematics , artificial intelligence , physics , mathematical analysis , pure mathematics , synchronization of chaos , quantum mechanics , biology , control theory (sociology) , control (management) , distribution (mathematics) , genetics
By considering a chaotic pseudo-random sequence as a symb olic sequence, we present a symbolic dynamics approach for the complexity analys is of chaotic pseudo-random sequences. The method is applied to the cases of Logistic map and one-way coupl ed map lattice to demonstrate how it works, and a comparison is made between it and the approximate entropy method. The results show that this method is app licable to distinguish the complexities of different chaotic pseudo-random seque nces, and it is superior to the approximate entropy method.