Generalized Formula for Generating N-Scroll Chaotic Attractors

Ahmed N. Atiya, Hossam El Din S. Hassan, Khaled E. Ibrahim, Omar M. Elghandour, Mohammed F. Tolba

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Abstract

    The generation of Multi-scroll chaotic attractors and chaos theory has gained much attention due to its many usages in a wide range of applications such as image-encryption and random number generators. There have been many previous attempts to establish a system that is able to generate large numbers of n - scroll chaotic attractors by modifying existing systems such as Lorenz and Chua's systems. In this paper, a proposed system based on generalizing Chua's system that has shown its ability to produce an unprecedentedly large number of even and odd chaotic scrolls is introduced. MATLAB simulation is carried out to validate the proposed system and a GUI tool was developed to ease the process of generating any number of chaotic scrolls. Finally, an insight on how the proposed system can be generalized on the circuits level is given.

    Original languageBritish English
    Title of host publication2nd Novel Intelligent and Leading Emerging Sciences Conference, NILES 2020
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages492-496
    Number of pages5
    ISBN (Electronic)9781728182261
    DOIs
    StatePublished - 24 Oct 2020
    Event2nd Novel Intelligent and Leading Emerging Sciences Conference, NILES 2020 - Virtual, Giza, Egypt
    Duration: 24 Oct 202026 Oct 2020

    Publication series

    Name2nd Novel Intelligent and Leading Emerging Sciences Conference, NILES 2020

    Conference

    Conference2nd Novel Intelligent and Leading Emerging Sciences Conference, NILES 2020
    Country/TerritoryEgypt
    CityVirtual, Giza
    Period24/10/2026/10/20

    Fingerprint

    Dive into the research topics of 'Generalized Formula for Generating N-Scroll Chaotic Attractors'. Together they form a unique fingerprint.

    Cite this