Comparison of Different Evolutionary Methodologies Applied Electronic Filter Design
Comparison of Different Evolutionary Methodologies Applied Electronic Filter Design
435
Length Genotypes Approach, which is based on the quency response specification, Taryeti and the fre-
ideas of the Species Adaptation Genetic Algorithm quency response obtained Outputi . The frequency
(SAGA) [4]; all electronic circuits of the initial popu- axis is uniformly sampled over the band of interest,
lation will have a small number of components, which usually ranging from 0 to 10 kHz. The weight wi
increases gradually along the evolutionary process. takes a maximum value for frequency points inside
Therefore, the EA starts sampling subspaces of par- the passband, an intermediate value for frequency
simonious solutions, going toward subspaces of more points inside the stop band and a minimum value
complex solutions as long as design requirements are for other frequency points. We set wi equal to 20, 10
not satisfied. The selection pressure provides a way and 1 for these three cases respectively. Since we are
to stop the growing process when circuits close to the using the roulette well selection method, the value
specification are found, although care must be taken given by equation 1 had to be inverted. Although
with local optima. this fitness equation worked well, setting the values
Therefore, in addition to crossover and mutation, of the weights has been an interactive and time con-
we have also used the Increasing Length Operator, suming process.
which increases, with a low probability [4], the length In order to evaluate the circuits, we have used,
of each genotype by one gene; each new gene created according to the case, a hand written simulator, the
by this operator is randomly initialised. Particularly, SMASH simulator, from Dolphin corporation, and
our crossover operator did not require maximisation the SPICE simulator.
of similarity between genotype segments, which is a
concept used in the SAGA framework. The muta- 5.1 First Test Set
tion operator actuates over integer values by chang-
ing them, with equal probability, to any other value In the first set we constrained the circuit topolo-
within the alphabet used. Tests have been made with gies to be made up of parallel meshes, each one hav-
both fixed and adaptive mutation rates. In the lat- ing two components. Each gene will encode a mesh
ter, the mutation rate increases as the average geno- of the circuit, defining the nature of the two com-
type length grows. ponents and their values (chosen from the preferred
manufactured values). Therefore, each time a geno-
5 . Case Studies type is increased by one (random) gene, one mesh is
added to the circuit. The initial population consists
We have devised three sets of tests to evaluate of circuits of only one or two meshes and may grow
different evolutionary methodologies: until five meshes. Figures 2 and 3 show the evolved
1. Variable length representation EAs, con- circuits for the low-pass and band-pass specifications
straining the topologies of the filters to meshes; respectively and Figures 4 and 5 show their respec-
2. Fixed length representation EAs, making no tive frequency responses (output voltage in decibels
constraints to the filter topologies; versus frequency in Hertz).
3. Variable length representation EAs, making
We have used a population of 50 individuals, run-
no constraints to the filter topologies.
ning along 500 generations, crossover rate of 0.7,
In order to evaluate the above evolutionary
adaptive mutation rate, and increasing length oper-
methodologies, we have used two test cases, a low-
ator rate of 0.05. Fitness proportional selection and
pass and a band-pass filter, with the following fre-
one-point crossover have been used. Each genotype
quency requirements:
is formed of up to 30 positions (5 genes made up of
1. Low-pass filter with passing band up to 1000
6 loci). An integer number representation has been
Hz and stop band above 2000 Hz [lo];
used [2] and, according to this representation, each
2. Band-pass filter with passing band between
gene may represent a total of 82,944 meshes (differ-
2000 Hz and 3000 Hz and stop band below 1000 ent combinations of capacitors, resistors and induc-
Hz and above 4000 Hz. tors of different values). A hand-written circuit sim-
Based on Koza’s previous works [9][10], we have ulator based on the Laplace analysis has been used.
devised the following fitness evaluation function:
5.2 Second Test Set
n
fitness = C wilTarget; - OutputiI (1) In the second test set we have used fixed length
i=l
representation, though allowing any kind of connec-
According to equation 1, the fitness is the tions among the components. Each gene in the geno-
weighted sum of the deviations between the fre- type now describes a single component, by determin-
436
PI0 0-
Figure 2 - Evolved Low Pass Filter (First Set) Figure 6 - Evolvedl Low Pass Filter (Second Set)
~~
c L
Figure 3 - Evolved Band Pass Filter (First Set) Figure 7 - Evolved Band Pass Filter (Second Set)
ing its nature (resistor, capacitor or inductor), value resistors and inductors).
(from the manufactured preferred values) and con- Figures 6 and 7 show the evolved circuits for the
nections points. We established that all genotypes low-pass and band-pass specifications respectively
would be made up of 10 genes, i. e., each circuit and Figures 8 and 9 show their respective frequency
with 10 components. The SMASH simulator has responses. These circuits have also been simulated
been used to evaluate the circuits, in the AC analysis in SPICE, showing the same results. Note that the
mode. As any kind of arrangement among the com- low-pass filter has only 9 components, because one
ponents is now possible, many topologies are now component was found to have no effect in the circuit
not simulatable, receiving a negative fitness value of behaviour.
-1000 [lo].
5.3 Third Test Set
We have used an Evolutionary Algorithm with 40
individuals, running over 200 generations, crossover In the third test set we have allowed any topol-
rate of 0.7, mutation rate of 0.02 per genotype posi- ogy arrangement between components, using a vari-
tion, linear rank selection with truncation, and uni- able size representation. Each gene represents a par-
form crossover. Each genotype is formed by 50 posi- ticular component, in the way described in the last
tions (10 genes made up of 5 loci). An integer num- section. We initialised all the individuals in the pop-
ber representation has been used and, according to ulation with five random genes and applied an es-
this representation, each gene may represent a total pecial operator to iincrease the genotypes along the
of 14,112 components (different values of capacitors, evolutionary process. Opposing to the first set of ex-
v . D
-O t 1
Figure 4 - Frequency Response for the Circuit of Fig. 2
437
m>-x
-=-
Figure 10 - Evolved Low Pass Filter (Third Set)
Figure 12 - Frequency Response for the Circuit of Fig. 10
- vm I,&*. <,if
43 8
TABLE I
components, in order to make this tool suitable to
SUMMARY FILTER
ON LOW-PASS EVOLUTION
be applied in integrated circuits design.
7. Acknowledgements
The authors would like to thank CAPES, Brazil-
ian Federal Agency, for sponsoring this work.
TABLE I1 IiEFERENCES
FILTER
SUMMARY ON BAND-PASS EVOLUTION Bennett 111,F. H., Koza, J. R., Andre, D., Keane, M. A.,
" Evolution of a 60 Decibel Op Amp Using Genetic Pro-
gramming", Proceedings of the First International Con-
ference on Evolvable Systems (ICES96), LNCS 1259, pp.
455-469, Tsukuba, Japan, October, 1996.
Grimbleby, J. B. , "Automatic Analogue Network Syn-
thesis Using Genetic Algorithms", Proceedings of the
First IEE/IEEE Ihternational Conference on Genetic
Algorithms in EngLineering Systems (GALESIAS - 95),
pp.53-58, UK, 1995.
a smaller circuit in the first case. Harvey, I., Thompson, A., "Through the Labyrinth Evo-
lution Finds a Way: A Silicon Ridge", Proceedings of
Comparing the performance of this evolutionary the First International Conference on Evolvable Systems
methodology with the genetic programming method- (ICES96), LNCS 1259, pp. 406-422, Tsukuba, Japan, Oc-
ology in the evolution of the low-pass filter [lo], tober, 1996.
Harvey, I., "The Artificial Evolution of Adaptive Be-
it has been verified that this methodology arrived haviour", PhD Thesis, University of Sussex, School of
at circuits with similar frequency responses, though Cognitive and Computing Sciences, September, 1993.
processing fewer individuals than in the genetic pro- Higuchi, T., Iba, H., Manderick, B., "Evolvable Hard-
ware", in Massively Parallel Artificial Intelligence (ed.
gramming methodology. H. Kitano), MIT Press, 1994.
In terms of time considerations, the first set of ex- Hirst, T. , "Evolutionary Signal Processing: A Prelimi-
nary Report", Proceedings of the Fourth Conference on
periments are also faster, because we could write a Artificial Life, pp. 425-431, Brighton, UK, July, 1997.
simulator in C to evaluate the circuits, since they are Horrocks, D. H, Spittle, M. C., "Component Value Se-
made up of simple meshes. For the sake of compar- lection For Activate Filters Using Genetic Algorithms",
1st On-line Workshop on Soft Computing (WSCl), Spe-
ison, the written simulator based on Laplace analy- cial Session on Evolutionary Electronics, August 19-30,
sis takes around 1 second to evaluate a circuit, while 1996.
standard simulators used in the second and third sets Horrocks, D. H., Khalifa, Y. M. A., "Genetic Algorithm
Design of Electronic Analogue Circuits Including Par-
take around 3 seconds to do the same. asitic Effects", 1st On-line Workshop on Soft Comput-
Even though the solutions obtained in the three ing (WSCl), Special Session on Evolutionary Electronics,
August 19-30,1996.
sets of experiments are satisfactory in terms of per- Koza J. R., Benne1,t I11 F. H., Andre, D. , Keane, M. A.,
formance, a problem remains to be addressed: the "Four Problems for which a Computer Program Evolved
circuits obtained in all the tests have presented large By Genetic Programming is Competitive with Human
Performance", Proc. Of 1996 IEEE International Confer-
inductor values, which may turn difficult the use ence on Evolutionary Computation, IEEE Press., Pages
of these circuits in real electronic applications. Al- 1-10.
though the first methodology has outperformed the [lo] Koza J. R., Bennett I11 F. H., Andre, D. , Keane, M.
A, "Toward Evolution of Electronic Animals Using Ge-
other ones when time is taken into account, the is- netic Programming", Artificial Life V: Proceedings of the
sue of component size minimisation may change the Fifth International Workshop on the Synthesis and Sim-
situation. When tuning the fitness evaluation func- ulation of Living Systems. Cambridge, MA: The MIT
Press, 1996.
tion to search also for small sized components, it is Ill] Kruiskamp, W. and Leenaerts, D., "DARWIN: CMOS
likely that the new topologies, potentially found in opamp synthesis by means of genetic algorithm", Pro-
the second and third sets, may be more successful. ceedings of the 32nd Design Automation Conference,
New York, NY: Association for Computer Machinery, pp.
698-703,1995.
6. Conclusions [12] Miller, J. F., Thomson, P. , "Combinationaland Sequen-
tial Logic Optimization Using Genetic Algorithms", Pro-
Different evolutionary approaches have been ap- ceedings of the First IEE/IEEE International Conference
on Genetic Algorithms in Engineering Systems ( G A L E
plied to the problem of passive electronic filter de- SIA - 95), pp.34-38, UK, 1995.
sign. The issues of variable and fixed EA representa- [13] Thompson, A., "An Evolved Circuit, Intrinsic in Sili-
con, entwined with physics", Proceedings of the First In-
tion and of imposing constraints in the circuit topolo- ternational Conference on Evolvable Systems (ICES96),
gies have been investigated. We are now studying the Tsukuba, LNCS l259, pp. 390-405, Japan, October,
problem of evolution of topologies with small sized 1996.
439