A Pilot Study of Chaos Criteria with Hilbert Transform and Mutual Information

Chaos feature criteria tree has many fruits with geometric maps and calculated values. To easily understand how to study chaos identification, we propose one new learning combination solution based on Hilbert transform (HT) and mutual information (MI). The most important coding probe (x-axis) used the HT of locked uniformly distributed random number (LUSRN), so far the y-axis in contrast standard map points to LUDRN. The measure between contrast standard map and unknown map (normalized test data, HT of LUSRN) used MI values. The test cases cover five chaos equations and eighteen quasi-period functions. The results show in statistics that our new maps and corresponding MI values can classify three kinds of signals with periodic, chaotic and random states. And this work may promote rapid growth of an apple embedded in novel chaos criteria. (paper)