Generalized Q–S (lag, anticipated and complete) synchronization in modified Chua’s circuit and Hindmarsh–Rose systems

摘要

Based on symbolic computation system Maple and Lyapunov stability theory, a systematic, powerful and concrete scheme is extended to study the generalized Q–S (lag, anticipated and complete) synchronization between two identical modified Chua’s circuit with different initial values and between two different chaotic systems: Hindmarsh–Rose system and modified Chua’s circuit. Numerical simulations are used to verify the effectiveness of the obtained controller.