Open AccessAnalysis on the chaotic pseudo-random sequence complexity
Author(s) -
Jueping Cai,
Zan Li,
Song Wen-tao
Publication year - 2003
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.52.1871
Subject(s) - chaotic , sequence (biology) , random sequence , chaos (operating system) , statistical physics , algorithm , computer science , entropy (arrow of time) , mathematics , physics , artificial intelligence , mathematical analysis , quantum mechanics , genetics , computer security , distribution (mathematics) , biology
In this paper, the conventional pseudo-random sequence linear complexity is disc ussed, and a new criterion is proposed, based on the approximate entropy. It is proved that the criterion is able to distinguish different complex chaos and cha otic pseudo-random sequences with short observed sequence. Simulations indicate that the method is effective, and the corresponding theories are proved right.