Analog Circuit Simplification of a Chaotic Hopfield Neural Network Based on the Shil’nikov’s Theorem

Circuit implementation is a widely accepted method for validating theoretical insights observed in chaotic systems. It also serves as a basis for numerous chaos-based engineering applications, including data encryption, random number generation, secure communication, neuromorphic computing, and so forth. To get feasible, compact, and cost-effective circuit implementations of chaotic systems, the underlying mathematical model may be simplified while preserving all rich nonlinear behaviors. In this framework, this manuscript presents a simplified Hopfield Neural Network (HNN) capable of generating a broad spectrum of complex behaviors using a minimal number of electronic elements. Based on Shil’nikov’s theorem for heteroclinic orbits, the number of non-zero synaptic connections in the matrix weights is reduced, while simultaneously using only one nonlinear activation function. As a result of these simplifications, we obtain the most compact electronic implementation of a tri-neuron HNN with the lowest component count but retaining complex dynamics. Comprehensive theoretical and numerical analyses by equilibrium points, density-colored continuation diagrams, basin of attraction, and Lyapunov exponents, confirm the presence of periodic oscillations, spiking, bursting, and chaos. Such chaotic dynamics range from single-scroll chaotic attractors to double-scroll chaotic attractors, as well as coexisting attractors to transient chaos. A brief security application of an S-Box utilizing the presented HNN is also given. Finally, a physical implementation of the HNN is given to confirm the proposed approach. Experimental observations are in good agreement with numerical results, demonstrating the usefulness of the proposed approach.