Revisiting the box counting algorithm for the correlation dimension analysis of hyperchaotic time series

We undertake the correlation dimension analysis of hyperchaotic time series using the box counting algorithm. We show that the conventional box counting scheme is inadequate for the accurate computation of correlation dimension (D2) of a hyperchaotic attractor and propose a modified scheme which is automated and gives better convergence of D2 with respect to the number of data points. The scheme is first tested using the time series from standard chaotic systems, pure noise and data added with noise. It is then applied on the time series from three standard hyperchaotic systems for computing D2. Our analysis clearly reveals that a second scaling region appears at lower values of box size as the system makes a transition into the hyperchaotic phase. This, in turn, suggests that correlation dimension analysis can also give information regarding chaos-hyperchaos transition.

► The conventional box counting scheme for correlation dimension analysis is modified and automated.
► The scheme is made suitable for the analysis of hyperchaotic time series.
► The scheme gives information regarding transition to hyperchaos in time delayed systems.