# A Novel Evolutionary Algorithm for Designing Robust Analog Filters

^{1}

^{2}

^{3}

^{*}

## Abstract

**:**

## 1. Introduction

## 2. Related Work

## 3. Methods: A Robust Analog Filter Design Using Evolutionary Algorithms

#### 3.1. Analog Filter Design using Bond Graphs and GP

#### 3.1.1. Bond Graphs

#### 3.1.2. Evolving Analog Filters Using Bond Graphs and GP: The GPBG Framework

- The lowpass filter synthesis problem is extracted from [13], in which the frequency response performance of a candidate filter is defined as the weighted sum of deviations from an ideal frequency response magnitude over 101 points:$${F}_{koza}(t)={\displaystyle \sum _{i=0}^{100}}[W(d({f}_{i}),{f}_{i})\times d({f}_{i})]$$
- The highpass filter synthesis problem has a similar configuration to the lowpass filter except for the complementary definitions of the pass and stop bands. The pass band is now defined as [2K, 10K] Hz, while the stop band is [1, 1K] Hz.

#### 3.2. Evolving Robust Analog Filters With Respect to Parameter Variation: The Unified Approach

#### 3.3. Genetic Algorithms for Robust Analog Filter Design: The Traditional Robust Design

#### 3.4. GPRD: Robust Analog Filter Design Using GP

#### 3.5. Evaluation Criteria

## 4. Experiments and Results

- standard genetic programming (GP) without considering robustness requirements;
- genetic programming with robustness-by-multi-simulation (GPRMS);
- genetic programming with robustness-by-perturbed-evaluation (GPRPE);
- hybrid GP/GA robust design method (GPGARMS).

#### 4.1. Evolving Analog Filters Using GP without Considering Robustness in the Fitness Function

#### 4.2. Evolving Robust Analog Filters Using Genetic Algorithms: The Classical Robust Design

#### 4.3. Evolving Robust Analog Filters Using Genetic Programming: Open-Ended Topology Innovation for Robust Design

#### 4.4. Statistical Results of the Three Methods for Evolving Robust Filters

#### 4.4.1. GA-RMS Improves the Robustness of Standard GP Results

#### 4.4.2. Topological Innovation Using GP-Evolved Filters with Higher Robustness than Parametric Robust Design Using GA

#### 4.4.3. GP with Robustness Requirements Constrains Bloating

#### 4.4.4. Comparison with Other Approaches for Robust Filter Design

## 5. Conclusions

## Acknowledgments

## Author Contributions

## Conflicts of Interest

## References

- Koza, J.R.; Keane, M.A.; Streeter, M.J.; Mydlowec, W.; Yu, J.; Lanza, G. Genetic Programming IV: Routine Human-Competitive Machine Intelligence; Kluwer Academic Publishers: Alphen aan den Rijn, The Netherlands, 2003. [Google Scholar]
- Seo, K.; Fan, Z.; Hu, J.; Goodman, E.D.; Rosenberg, R.C. Toward an Automated Design Method for Multi-Domain Dynamic Systems Using Bond. Mechatronics
**2003**, 13, 851–885. [Google Scholar] [CrossRef] - Carlson, J.M.; Doyle, J. Complexity and robustness. Proc. Natl. Acad. Sci. USA
**2002**, 99, 2538–2545. [Google Scholar] [CrossRef] [PubMed] - Du, X.; Chen, W. Towards a Better Understanding of Modeling Feasibility Robustness in Engineering Design. ASME J. Mech. Des.
**2000**, 122, 385–394. [Google Scholar] [CrossRef] - Jin, Y.; Branke, J. Evolutionary optimization in uncertain environments—A survey. IEEE Trans. Evolut. Comput.
**2005**, 9, 303–317. [Google Scholar] [CrossRef] - Jin, Y. A Framework for Evolutionary Optimization with Approximate Fitness Functions. IEEE Trans. Evolut. Comput.
**2002**, 6, 481–494. [Google Scholar] - Jakobi, N.; Husbands, P.; Harvey, I. Noise and the Reality Gap: The Use of Simulation in Evolutionary Robotics. In Proceedings of the Third European Conference on Artificial Life (ECAL95), Granada, Spain, 4–6 June 1995; Springer: Berlin/Heidelberg, Germany, 1995; pp. 704–720. [Google Scholar]
- Chen, W.; Allen, J.K.; Mistree, F.; Tsui, K.-L. A Procedure for Robust Design: Minimizing Variations Caused by Noise Factors and Control Factors. ASME J. Mech. Des.
**1996**, 118, 478–485. [Google Scholar] [CrossRef] - Cancho, R.F.; Janssen, C.; Sole, R.V. Topology of technology graphs: Small world patterns in electronic circuits. Phys. Rev. E
**2001**, 64, 046119. [Google Scholar] [CrossRef] [PubMed] - Balling, R.J.S.S. Optimization of Coupled Systems: A Critical Review of Approaches. AIAA J.
**1996**, 34, 6–17. [Google Scholar] [CrossRef] - Suri, R.; Otto, K. Manufacturing System Robustness Through Integrated Modeling. J. Mech. Des.
**2001**, 123, 630–636. [Google Scholar] [CrossRef] - Ben-Tal, A.; Nemirovski, A. Robust Truss Topology Design via Semidefinite Programming. SIAM J. Optim.
**1997**, 7, 991–1016. [Google Scholar] [CrossRef] - Koza, J.R.; Bennett, F.H., III; Andre, D.; Keane, M.A.; Dunlap, F. Automated Synthesis of Analog Electrical Circuits by Means of Genetic Programming. IEEE Trans. Evolut. Comput.
**1997**, 1, 109–128. [Google Scholar] [CrossRef] - Zebulum, R.S.; Pacheco, M.A.; Vellasco, M. Comparison of Different Evolutionary Methodologies Applied to Electronic Filter Design. In Proceedings of the 1998 IEEE World Congress on Computational Intelligence, Anchorage, AK, USA, 4–9 May 1998; pp. 434–439. [Google Scholar]
- Lohn, J.; Colombano, S. A circuit representation technique for automated circuit design. IEEE Trans. Evolut. Comput.
**1999**, 3, 205–219. [Google Scholar] [CrossRef] - Taguchi, G. Taguchi on Robust Technology Development: Bringing; American Society Of Mechanical Engineers: New York, NY, USA, 1993. [Google Scholar]
- Zhu, J. Performance Distribution Analysis and Robust Design. J. Mech. Des.
**2001**, 123, 11–17. [Google Scholar] [CrossRef] - Weng, T.-W. Stochastic simulation and robust design optimization of integrated photonic filters. Nanophotonics
**2017**, 6, 299–308. [Google Scholar] [CrossRef] - Sun, J.; Xiao, L.; Tian, J.; Zhou, H.; Roveda, J. Surrogating circuit design solutions with robustness metrics. Integr. VLSI J.
**2016**, 52, 1–9. [Google Scholar] [CrossRef] - Husbands, P.; Harvey, I. Evolution versus design. Controlling autonomous robots. In Integrating Perception, Planning and Action, Proceedings of the Third Annual Conferences on Artificial Intelligence, Perth, Australia, 8–10 July 1992; IEEE Press: Los Alamitos, CA, USA, 1992. [Google Scholar]
- Husband, P.; Harvey, I.; Cliff, D. An evolutionary approach to situated AI. In Prospects for Artificial Intelligence, Proceedings of the Ninth bi-annual Conference of the Society for the Study of Artificial Intelligence and the Simulation of Behavior, Birmingham, UK, 29 March–2 April 1993; IO Press: Amsterdam, The Netherlands, 1993; pp. 61–70. [Google Scholar]
- Jakobi, N. Evolving Motion-Tracking Behavior for a Panning Camera Head. In From Animals to Animats 5, Proceedings of the 5th International Conference on Simulation of Adaptive Behavior; MIT Press: Cambridge, MA, USA, 1997. [Google Scholar]
- Jakobi, N. The Minimal Simulation Approach to Evolutionary Robotics. In Evolutionary Robotics—From Intelligent Robots to Artificial Life (ER’98); Gomi, T., Ed.; AAI Books: Ottawa, ON, Canada, 1998. [Google Scholar]
- Tsutsui, S.; Ghosh, A. Genetic algorithms with a robust solution searching scheme. IEEE Trans. Evolut. Comput.
**1997**, 1, 201–208. [Google Scholar] [CrossRef] - Wiesmann, D.; Hammel, U.; Bäck, T. Robust design of multilayer optical coatings by means of evolutionary algorithms. IEEE Trans. Evolut. Comput.
**1998**, 2, 162–167. [Google Scholar] [CrossRef] - Forouraghi, B. A genetic algorithm for multiobjective robust design. Appl. Intell.
**2000**, 12, 151–161. [Google Scholar] [CrossRef] - Ray, T. Constrained robust optimal design using a multi-objective evolutionary algorithm. In Proceedings of the Congress on Evolutionary Computation, Honolulu, HI, USA, 12–17 May 2002; IEEE Press: Los Alamitos, CA, USA, 2002; pp. 419–424. [Google Scholar]
- Jin, Y.; Sendhoff, B. Trade-off between optimality and robustness: An evolutionary multi-objective approach. In Proceedings of the Second International Conference on Evolutionary Multi-criterion Optimization, Faro, Portugal, 8–11 April 2003; Springer: Berlin/Heidelberg, Germany, 2003; pp. 237–251. [Google Scholar]
- Branke, J. Creating robust solutions by means of an evolutionary algorithms. In Proceedings of the Parallel Problem Solving from Nature Number 1498 in LNCS; Eiben, A., Bäck, T., Schoenauer, M., Schwefel, H.P., Eds.; Springer: Berlin/Heidelberg, Germany, 1998; pp. 119–128. [Google Scholar]
- Das, I. Robustness Optimization for constrained nonlinear programming problems. Eng. Optim.
**2000**, 32, 585–618. [Google Scholar] [CrossRef] - Hammel, U.; Bäck, T. Evolution Strategies on Noisy Functions. How to Improve Convergence Properties. In Parallel Problem Solving from Nature; Davidor, Y., Manner, R., Schwefel, H.P., Eds.; Springer: Heidelberg, Germany, 1994; pp. 159–168. [Google Scholar]
- Branke, J. Evolutionary Optimization in Dynamic Environments; Kluwer: Alphen aan den Rijn, The Netherlands, 2001. [Google Scholar]
- Branke, J.; Schmeck, H. Designing evolutionary algorithms for dynamic optimization problems. In Theory and Application of Evolutionary Computation: Recent Trends; Tsutsui, S., Ghosh, A., Eds.; Springer: Heidelberg, Germany, 2002. [Google Scholar]
- Lee, W.P.; Hallam, J.; Lund, H.H. Applying Genetic Programming to Evolve Behavior Primitives and Arbitrators for Mobile Robots. In Proceedings of the IEEE 4th International Conference on Evolutionary Computation, Indianapolis, IN, USA, 13–16 April 1997; IEEE Press: Los Alamitos, CA, USA, 1997; Volume 1. [Google Scholar]
- Thompson, A. On the automatic design of robust electronics through artificial evolution. In Proceedings of the International Conference on Evolvable Systems, Lausanne, Switzerland, 23–25 September 1998; Springer: Berlin/Heidelberg, Germany, 1998; pp. 13–24. [Google Scholar]
- Thompson, A.; Layzell, P. Evolution of robustness in an electronics design. In Proceedings of the Evolvable Systems, from Biology to Hardware (ICES 2000), Edinburgh, UK, 17–19 April 2000; Springer: Berlin/Heidelberg, Germany, 2000; pp. 218–228. [Google Scholar]
- Tyrrell, A.; Hollingworth, G.; Smith, S. Evolutionary strategies and intrinsic fault tolerance. In Proceedings of the Third NASA/DoD Workshop on Evolvable Hardware (EH 2001), Long Beach, CA, USA, 12–14 July 2001; Keymeulen, D., Stoica, A., Lohn, J., Zebulum, R.S., Eds.; IEEE Computer Society: Long Beach, CA, USA, 2001; pp. 98–106. [Google Scholar]
- Miller, J.F.; Hartmann, M. Evolving messy gates for fault tolerance: Some preliminary findings. In Proceedings of the Third NASA/DoD Workshop on Evolvable Hardware (EH 2001), Long Beach, CA, USA, 12–14 July 2001; Keymeulen, D., Stoica, A., Lohn, J., Zebulum, R.S., Eds.; IEEE Computer Society: Long Beach, CA, USA, 2001; pp. 116–123. [Google Scholar]
- Hartmann, M.; Haddow, P. Evolution of fault-tolerant and noise-robust digital designs. In IEE Proceedings of Computers and Digital Techniques; IEEE Press: Los Alamitos, CA, USA, 2004; pp. 287–294. [Google Scholar]
- Hartmann, M.; Eskelund, F.; Haddow, P.C.; Miller, J.F. Evolving Fault Tolerance On An Unreliable Technology Platform. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), New York, NY, USA, 9–13 July 2002; Langdon, W.B., Cantú-Paz, E., Mathias, K., Roy, R., Davis, D., Poli, R., Balakrishnan, K., Honavar, V., Rudolph, G., Wegener, J., et al., Eds.; Morgan Kaufmann Publishers: New York, NY, USA, 2002; pp. 171–177. [Google Scholar]
- Koza, J.R.; Andre, D.; Bennett, F.H., III; Keane, M. Genetic Programming 3: Darwinian Invention and Problem Solving; Morgan Kaufman: Burlington, MA, USA, 1999. [Google Scholar]
- Goh, C.; Li, Y. GA Automated Design and Synthesis of Analog Circuits with Practical Constraints. In Proceedings of the 2001 Congress on Evolutionary Computation 2001, Seoul, Korea, 27–30 May 2001; IEEE Press: Los Alamitos, CA, USA, 2001; pp. 170–177. [Google Scholar]
- Fan, Z.; Hu, J.; Seo, K.; Goodman, E.D.; Rosenberg, R.C.; Zhang, B. Bond Graph Representation and GP for Automated Analog Filter Design. In Proceedings of the 2001 Genetic and Evolutionary Computation Conference Late Breaking Papers, San Francisco, CA, USA, 7–11 July 2001; pp. 81–86. [Google Scholar]
- Karnopp, D.; Margolis, D.L.; Rosenberg, R.C. System Dynamics: Modeling and Simulation of Mechatronic Systems, 3rd ed.; John Wiley & Sons, Inc.: New York, NY, USA, 2000. [Google Scholar]
- Hu, J.; Goodman, E.; Rosenberg, R. Topological search in automated mechatronic system synthesis using bond graphs and genetic programming. In Proceedings of the American Control Conference (ACC 2004), Boston, MA, USA, 30 June–2 July 2004. [Google Scholar]
- Hu, J.; Goodman, E.; Seo, K.; Fan, Z.; Rosenberg, R. The Hierarchical Fair Competition (HFC) Framework for Sustainable Evolutionary Algorithms. Evolut. Comput.
**2005**, 13, 241–247. [Google Scholar] [CrossRef] [PubMed] - Tay, E.; Flowers, W.; Barrus, J. Automated Generation and Analysis of. Res. Eng. Des.
**1998**, 10, 15–29. [Google Scholar] [CrossRef] - Seo, K.; Fan, Z.; Hu, J.; Goodman, E.D.; Rosenberg, R.C. Dense and Switched Modular Primitives for Bond Graph Model Design. In Proceedings of the Genetic and Evolutionary Computation (GECCO-2003), Chicago, IL, USA, 12–16 July 2003; Cantú-Paz, E., Foster, J.A., Deb, K., Davis, D., Roy, R., O’Reilly, U.M., Beyer, H.G., Standish, R., Kendall, G., Wilson, S., Eds.; Springer: Chicago, IL, USA, 2003; Volume 2724, pp. 1764–1775. [Google Scholar]
- Hu, J.; Li, S.; Goodman, E. Evolutionary Robust Design of Analog Filters Using Genetic Programming. In Evolutionary Computation in Dynamic and Uncertain Environments; Springer: Berlin/Heidelberg, Germany, 2005; pp. 479–496. [Google Scholar]
- Ando, S.; Iba, H. Linear Genome Methodology for Analog Circuit Design; Technical Report; University of Tokyo: Tokyo, Japan, 2000. [Google Scholar]
- Fang, Y.; Li, J. A Review of Tournament Selection in Genetic Programming. In Advances in Computation and Intelligence; Cai, Z., Hu, C., Kang, Z., Liu, Y., Eds.; Springer: Berlin/Heidelberg, Germany, 2010; pp. 181–192. [Google Scholar]
- Deb, K.; Anand, A.; Joshi, D. A Computationally Efficient Evolutionary Algorithm for Real-Parameter Optimization. Evolut. Comput.
**2002**, 10, 345–369. [Google Scholar] [CrossRef] [PubMed] - Dib, N.; El-Asir, B. Optimal design of analog active filters using symbiotic organisms search. Int. J. Numer. Model. Electron. Netw. Devices Fields
**2018**. [Google Scholar] [CrossRef] - Leitão, P.M.V.; Fino, H. Robust Optimization-Based High Frequency Gm-C Filter Design. In Technological Innovation for Value Creation; Camarinha-Matos, L.M., Shahamatnia, E., Nunes, G., Eds.; Springer: Berlin/Heidelberg, Germany, 2012; pp. 465–474. [Google Scholar]
- Lovay, M.; Peretti, G.; Romero, E. Application of genetic algorithms in the design of robust active filters. In Proceedings of the 2015 Argentine School of Micro-Nanoelectronics, Technology and Applications (EAMTA), Villa Maria, Argentina, 30–31 July 2015; pp. 1–6. [Google Scholar]

**Figure 1.**A bond graph and its equivalent electrical circuit. The dotted boxes in the left bond graph indicate modifiable sites at which further topological manipulations can be applied (to be explained in the next section).

**Figure 2.**The bond graph structure of a lowpass filter evolved by the GPBG method with 500,000 function evaluations. This filter has 39 components without counting the embryo components. (Component sizing values are omitted in the figure for simplicity).

**Figure 3.**An example of a GP tree, composed of topology operators applied to an embryo, generating a bond graph after depth-first execution (numeric ERC nodes are omitted). Note that the 010 and 001 are the flag bits showing the presence or absence of attached C/I/R components.

**Figure 4.**The topology of the best highpass analog filters evolved with standard GP with 500,000 function evaluations without considering a robustness requirement in the fitness function(parameters are omitted). This filter has 27 C/I/R components without counting the original embryo components. The best evolved lowpass filter is shown in Figure 2. These topologies are the results of a simplification procedure that removes redundancy in the original evolved bond graphs while their functional behaviors are maintained.

**Figure 5.**Frequency responses of best lowpass and highpass filters evolved using GP, GPGARMS, GPRMS, and GPRPE with 20% Gaussian perturbation of their components: (

**a**) Frequency response distribution of the best four lowpass filters. The total sums of 101-point deviations from the target response curve are 6.43 (GP), 33.03 (GPGARMS), 9.61 (GPRMS), and 4.13 (GPRPE). (

**b**) Frequency response distribution of the best four highpass filters. The total deviations from the target response curve are 0.32 (GP), 42.69 (GPGARMS), 2.53 (GPRMS), and 0.19 (GPRPE).

**Figure 6.**Frequency responses of the best lowpass and highpass filters evolved using GP, GPGARMS, GPRMS, and GPRPE in the perturbed-parametric environment: (

**a**) Frequency response distribution of the best filter evolved using standard GP. (

**b**) Frequency response distribution of the best filter evolved using standard GPGARMS. (

**c**) Frequency response distribution of the best filter evolved using standard GPRMS. (

**d**) Frequency response distribution of the best filter evolved using standard GPRPE.

**Figure 7.**Robustness of highpass filters evolved by GP, GPGARMS, GPRMS, and GPRPE. For (

**a**,

**b**), lower values correspond to higher robustness. (

**a**) The average Type-I robustness defined in Section 3.5. (

**b**) The average Type-II robustness defined in Equation (5).

**Figure 8.**Evolved robust lowpass and highpass filters with complexity much lower than the filters evolved without considering robustness in the fitness in Figure 2 and Figure 4. (

**a**) Topology of the most robust lowpass filter with only 13 evolved components using GPRMS. (

**b**) Topology of the most robust lowpass filter with only 16 evolved components using GPRMS. (

**c**) Equivalent analog circuit of the most robust lowpass filter in (

**b**).

Total Population Size: 2000 (400/400/400/400/400) | Number of Subpopulations: 5 |
---|---|

Migration interval: 5 generations | Migration size: 30 individuals |

Max tree depth: 8 | Crossover probability: 0.7 |

InitTreeDepth: 3–5 | Standard mutation probability: 0.1 |

Flag bit mutation rate: 0.1 | Swapping-tree mutation rate: 0.1 |

Tournament size: 7 | Parametric mutation probability: 0.5 |

Max evaluations: 1,000,000 | Flag mutation probability: 0.3 |

Pool size of elite individuals: 20 | Elite pool update frequency: 5 generations |

Total Population Size: 200 | Max Evaluations: 500,000 |
---|---|

Number of parents in crossover: 3 | Family size: 2 |

${\sigma}_{\zeta}$: 0.1 | ${\sigma}_{\eta}$: 0.1 |

SPI: 10 | Perturbation noise percentage: 20% |

**Table 3.**The performance and robustness of evolved lowpass filters using GP, GPGARMS, GPRMS, and GPRPE.

Perturbation Magnitude | 0.1 | 0.2 | 0.3 | 0.4 | 0.5 | ||||||
---|---|---|---|---|---|---|---|---|---|---|---|

Mean | Stderr | Mean | Stderr | Mean | Stderr | Mean | Stderr | Mean | Stderr | ||

${f}_{robustI}$ | GP | 36.57 | 5.55 | 40.04 | 5.00 | 45.33 | 4.56 | 54.68 | 4.25 | 61.91 | 4.06 |

GPGARMS | 65.16 | 6.60 | 50.08 | 6.05 | 64.33 | 3.66 | 73.85 | 3.84 | 79.81 | 5.28 | |

GPRMS | 48.83 | 3.99 | 51.36 | 3.67 | 56.09 | 3.46 | 63.91 | 3.52 | 72.71 | 3.72 | |

GPRPE | 14.08 | 2.65 | 19.64 | 2.22 | 27.25 | 1.82 | 37.51 | 1.81 | 48.98 | 2.21 | |

${f}_{robustII}$ | GP | 2.44 | 0.40 | 5.59 | 0.79 | 14.37 | 1.61 | 30.20 | 2.83 | 42.78 | 3.76 |

GPGARMS | 5.42 | 1.85 | 10.81 | 1.72 | 18.18 | 2.12 | 33.57 | 1.85 | 54.05 | 4.45 | |

GPRMS | 1.35 | 0.34 | 4.58 | 0.54 | 13.58 | 1.05 | 28.46 | 1.95 | 40.88 | 2.64 | |

GPRPE | 3.92 | 0.46 | 8.13 | 0.78 | 20.85 | 3.75 | 30.89 | 2.36 | 43.11 | 2.92 |

**Table 4.**The sizes of filters evolved using four algorithms with different numbers of fitness evaluations. Each algorithm was run 10 times. * A total of 1,000,000 function evaluations are required to do 100,000 actual fitness evaluations.

Algorithm (Fitness Evaluations) | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | Mean | Stdev |
---|---|---|---|---|---|---|---|---|---|---|---|---|

GP (100,000) | 34 | 26 | 35 | 24 | 14 | 20 | 24 | 25 | 26 | 46 | 27 | 8.9100 |

GP (500,000) | 46 | 47 | 37 | 47 | 57 | 40 | 40 | 45 | 48 | 79 | 51.7500 | 15.3200 |

GPRMS (100,000) * | 28 | 15 | 36 | 21 | 28 | 14 | 43 | 26 | 31 | 20 | 26.2000 | 9.1100 |

GPRPE (1,000,000) | 67 | 36 | 46 | 36 | 37 | 57 | 29 | 63 | 27 | 36 | 43.4000 | 14 |

© 2018 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).

## Share and Cite

**MDPI and ACS Style**

Li, S.; Zou, W.; Hu, J.
A Novel Evolutionary Algorithm for Designing Robust Analog Filters. *Algorithms* **2018**, *11*, 26.
https://doi.org/10.3390/a11030026

**AMA Style**

Li S, Zou W, Hu J.
A Novel Evolutionary Algorithm for Designing Robust Analog Filters. *Algorithms*. 2018; 11(3):26.
https://doi.org/10.3390/a11030026

**Chicago/Turabian Style**

Li, Shaobo, Wang Zou, and Jianjun Hu.
2018. "A Novel Evolutionary Algorithm for Designing Robust Analog Filters" *Algorithms* 11, no. 3: 26.
https://doi.org/10.3390/a11030026