A novel evolutionary algorithm for designing robust analog filters (Q2331408)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A novel evolutionary algorithm for designing robust analog filters
scientific article

    Statements

    A novel evolutionary algorithm for designing robust analog filters (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 October 2019
    0 references
    Summary: Designing robust circuits that withstand environmental perturbation and device degradation is critical for many applications. Traditional robust circuit design is mainly done by tuning parameters to improve system robustness. However, the topological structure of a system may set a limit on the robustness achievable through parameter tuning. This paper proposes a new evolutionary algorithm for robust design that exploits the open-ended topological search capability of genetic programming (GP) coupled with bond graph modeling. We applied our GP-based robust design (GPRD) algorithm to evolve robust lowpass and highpass analog filters. Compared with a traditional robust design approach based on a state-of-the-art real-parameter genetic algorithm (GA), our GPRD algorithm with a fitness criterion rewarding robustness, with respect to parameter perturbations, can evolve more robust filters than what was achieved through parameter tuning alone. We also find that inappropriate GA tuning may mislead the search process and that multiple-simulation and perturbed fitness evaluation methods for evolving robustness have complementary behaviors with no absolute advantage of one over the other.
    0 references
    robust design
    0 references
    evolutionary algorithms
    0 references
    computational synthesis
    0 references
    genetic programming
    0 references
    bond graphs
    0 references
    analog filters
    0 references
    automated design
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references