分析了已有的序列线性复杂度分析方法，提出了用近似熵算法计算混沌运动的测度熵，作为衡量混沌伪随机序列复杂度的标准。
In this paper, the conventional pseudo-random sequence linear complexity is discussed, and a new criterion is proposed, based on the approximate entropy.
分析了已有的序列线性复杂度分析方法，提出了用近似熵算法计算混沌运动的测度熵，作为衡量混沌伪随机序列复杂度的标准。
In this paper, the conventional pseudo-random sequence linear complexity is discussed, and a new criterion is proposed, based on the approximate entropy.
应用推荐