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.