关键词: 相空间重构, 平均位移, 互信息, 二叉树, 关联维数

Abstract: With embedding theorem proposed by Takens,we study methods for choosing proper delay time in phase space reconstruction of chaotic time series.A united method to incorporate advantages of average displacement and mutual information is put forward.In mutual information calculation we employ binary tree coding to divide and mark grids which makes it implemented easily.We determine layer numbers according to percentages of sparse grid.Numerical experiments of R ssler and Lorenz systems verifies accaracy of the method.

Key words: space reconstruction, average displacement, mutual information, binary tree coding, correlation dimension