科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper, the conventional pseudo-random sequence linear complexity is discussed, 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 chaotic pseudo-random sequences with short observed sequence. Simulations indicate that the method is effective, and the corresponding theories are proved right.
