Analysis on the chaotic pseudo-random sequence complexity
Cai Jue-Ping, Li Zan, Song Wen-tao, (1)上海交通大学电子工程系，上海 200030; (2)西安电子科技大学综合业务网国家重点实验室，西安 710071 · Acta Physica Sinica · 2003
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.