Comparison of Complexity of the Switchable Chaotic Systems and its FPGA Implementation

Abstract

A four-dimensional chaotic system with complex dynamical properties is constructed via introducing a nonlinear function term. The paper assesses complexity of the system employing equilibrium points, Lyapunov exponent spectrum and bifurcation model. Specially, the coexisting Lyapunov exponent spectrum and the coexisting bifurcation validate the coexistence of attractors. The corresponding complexity characteristics of the system can be analyzed by using C0 and spectral entropy(SE) complexity algorithms, and the most complicated integer-order system is obtained. Furthermore, the circuit which can switch the chaotic attractors is implemented. It is worth noting that the more sophisticated parameters are received by comparing the complexity of the most complicated integer-order chaotic system with corresponding fractional-order chaotic system. Finally, the results of simulation model built in the MATLAB are the same as the hardware verified on the Field-Programmable Gate Array(FPGA) platform, which verify the feasibility of the system.