Principles in the Evolutionary Design of Digital Circuits—Part I
 Julian F. Miller,
 Dominic Job,
 Vesselin K. Vassilev
 … show all 3 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
An evolutionary algorithm is used as an engine for discovering new designs of digital circuits, particularly arithmetic functions. These designs are often radically different from those produced by topdown, human, rulebased approaches. It is argued that by studying evolved designs of gradually increasing scale, one might be able to discern new, efficient, and generalizable principles of design. The ripplecarry adder principle is one such principle that can be inferred from evolved designs for one and twobit adders. Novel evolved designs for threebit binary multipliers are given that are 20% more efficient (in terms of number of twoinput gates used) than the most efficient known conventional design.
 S. B. Akers, “Binary decision diagrams,” IEEE Transactions on Computers vol. C27 pp. 509516, 1978.
 J. W. Atmar, “Speculation on the Evolution of Intelligence and its Possible Realization in Machine Form,” New Mexico State University, Las Cruces, NM, PhD thesis, 1976.
 Th. Bäck, Evolutionary Algorithms in Theory and Practice: Evolutionary Strategies, Evolutionary Programming, Genetic Algorithms, Oxford University Press: New York, NY, 1996.
 T. Bäck, F. Hoffmeister, and H.P. Schwefel, “A survey of evolutionary strategies,” in Proceedings of the 4th International Conference on Genetic Algorithms, R. Belew and L. Booker (eds.) Morgan Kaufmann, San Francisco, CA, 1991, pp. 29.
 W. Banzhaf, P. Nordin, R. E. Keller, and F. D. Francone, Genetic Programming: An Introduction, Morgan Kaufmann: San Francisco, CA, 1998.
 F. H. Bennett, III, J. R. Koza, M. Keane, and D. Andre, “Genetic programming: Biologically inspired computation that exhibits creativity in solving nontrivial problems,” in Proceedings of AISB'99 Symposium on Artificial Intelligence and Scientific Creativity, 1999, pp. 2938.
 T. Blickle, “Theory of Evolutionary Algorithms and Application to System Synthesis,” Eidgenossiche Technische Hochschule, Zurich, PhD thesis, 1997.
 G. Box and G. Jenkins, Time Series Analysis, Forecasting and Control, Holden Day, 1970.
 K. S. Brace, R. L. Rudell, and R. E. Bryant, “Efficient implementation of a BDD package,” in Proceedings of 27th ACMrIEEE Design Automation Conference, 1990, pp. 4045.
 R. K. Brayton, G. D. Hachtel, C. T. McMullen, and A. L. SangiovanniVincentelli, Logic Minimization Algorithms for VLSI Synthesis, Kluwer Academic Publishers: MA, 1984.
 R. Brayton, R. Rudell, A. SangiovanniVincentelli, and A. Wang, “MIS: A multiplelevel optimization system,” IEEE Transactions on ComputerAided Design of Integrated Circuits vol. CAD6 pp. 10621081, 1987.
 R. Brayton, G. D. Hachtel, and A. L. SangiovanniVincentelli, “Multilevel logic synthesis,” Proceedings of the IEEE vol. 78 pp. 264300, 1990.
 R. Bryant, “Graphbased algorithms for Boolean function manipulation,” IEEE Transactions on Computers vol. C35 pp. 677691, 1986.
 R. Bryant, “On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication,” IEEE Transactions on Computers vol. 40 pp. 205213, 1991.
 X. Chen and S. L. Hurst, “A comparison of universallogicmodule realizations and their application in the synthesis of combinatorial and sequential logic networks,” IEEE Transactions on Computers vol. C31 pp. 140147, 1982.
 E. Coen, The Art of Genes. How Organisms Make Themselves, Oxford University Press: Oxford, UK, 1999.
 S. Devadas, “Comparing twolevel and ordered binary decision diagram representations of logic functions,” IEEE Transactions on ComputerAided Design of Integrated Circuits and Systems vol. 12 pp. 722723, 1993.
 S. Devadas, A. Ghosh, and K. Keutzer, Logic Synthesis, McGrawHill Inc.: New York, 1994.
 R. Drechsler and M. Theobald, and B. Becker, “Fast OFDD based minimization of fixed polarity ReedMuller expressions,” in Proceedings of the European Design Automation Conference, 1994, pp. 27.
 R. Drechsler, A. Sarabi, M. Theobald, B. Becker, and M. A. Perkowski, “Efficient representation and manipulation of switching functions based on ordered kronecker functional decision diagrams,” in Proceedings of the Design Automation Conference, 1994, pp. 415419.
 R. Drechsler, N. Göckel, and B. Becker, “Learning heuristics for OBDD minimization by evolutionary älgorithms,” in Parallel Problem Solving from Nature IV, Lecture Notes in Computer Science, Springer, Heidelberg, 1996, vol. 1141, pp. 730739.
 S. J. Flockton and K. Sheehan, “Intrinsic circuit evolution using programmable analogue arrays,” in Proceedings of the 2nd International Conference on Evolvable Systems: From Biology to Hardware, Lecture Notes in Computer Science, M. Sipper, D. Mange, and A. PérezUribe (eds.), SpringerVerlag, Heidelberg, 1998, vol. 1478, pp. 144153.
 S. Flockton and K. Sheehan, “A system for intrinsic evolution of linear and nonlinear filters,” A. Stoica and D. Keymeulen and J. Lohn eds. in Proceedings of the 1st NasarDoD Workshop on Evolvable Hardware, IEEE Computer Society, Los Alamitos, CA, 1999, pp. 93100.
 S. J. Friedman and K. J. Supowit, “Finding the optimal variable ordering for binary decision diagrams,” IEEE Transactions on Computers vol. C39 pp. 710713, 1990.
 M. Fujita and Y. Matsunaga, “Variable ordering of binary decision diagrams for multilevel logic minimization,” Fujitsu Scientific and Technical Journal vol. 29 pp. 137145, 1993.
 C. GiraudCarrier, “FLARE: Induction with prior knowledge,” in Proceedings of Expert Systems 1996, Research and Development in Expert Systems, SGES Publications, 1996, vol. XIII, pp. 173181.
 D. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, AddisonWesley: Reading, MA, 1989.
 D. Green, Modern Logic Design, AddisonWesley: Reading, MA, 1986.
 J. B. Grimbleby, “Automatic analogue network synthesis using genetic algorithms,” in Proceedings of the 1st International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications (GALESIA), IEE, London, 1995, pp. 5358.
 D. L. Grundy, “A computational approach to VLSI analog design,” Journal of VLSI Signal Processing. vol. 8 (1) pp. 5360, 1994.
 K. Hanney, “Learning Adaptation Rules From Cases,” Department of Computer Science, Trinity College, University of Dublin, Ireland, MSc thesis, 1996.
 T. Higuchi, T. Niwa, T. Tanaka, H. Iba, H. de Garis, and T. Furuya, “Evolvable Hardware—GeneticBased Generation of Electric Circuitry at Gate and Hardware Description Language HDL Levels,” Electrotechnical Laboratory, Tsukuba, Japan, no. 934, 1993.
 T. Higuchi, T. Niwa, T. Tanaka, H. Iba, H. de Garis, and T. Furuya, “Evolving hardware with genetic learning: A first step towards building a darwin machine,” From Animals to Animats II: Proceedings of the 2nd International Conference on Simulation of Adaptive Behaviour, J.A. Meyer and H. L. Roitblat and W. Stewart (ed.), MIT Press, Cambridge, MA, 1993, pp. 417424.
 T. Higuchi and M. Iwata eds. in Proceedings of the 1st International Conference on Evolvable Systems: From Biology to Hardware, Lecture Notes in Computer Science, SpringerVerlag, Berlin, vol. 1259, 1996.
 J. Holland, Adaptation in Natural and Artificial Systems, MIT Press: Cambridge, MA, second edition, 1992.
 W. Hordijk, “A measure of landscapes,” Evolutionary Computation vol. 4(4) pp. 335360, 1996.
 W. Hordijk, “Correlation analysis of the synchronisingCA landscape,” Physica D vol. 107 pp. 255264, 1997.
 W. Hordijk and P. F. Stadler, “Amplitude spectra of fitness landscapes,” J. Complex Systems vol. 1 pp. 3966, 1998.
 J. Hunt, “Evolutionary case base design,” Progress in CaseBased Reasoning First UK Workshop, SpringerVerlag: Berlin, 1995.
 H. Iba, M. Iwata, and T. Higuchi, “Machine learning approach to gatelevel evolvable hardware,” in Proceedings of the 1st International Conference on Evolvable Systems: From Biology to Hardware, Lecture Notes in Computer Science, T. Higuchi and M. Iwata (eds.), SpringerVerlag, Heidelberg, 1997, vol. 1259, pp. 327343.
 J. Jain, M. Abadir, J. Bitner, D. S. Fussell, and J. A. Abraham, “IBDDs: An efficient functional representation for digital circuits,” in Proceedings of the European Conference on Design Automation, 1992, pp. 440446.
 D. Job, V. Shankararaman, and J. Miller, “Hybrid AI techniques for software design,” in Proceedings of 1999 Conference on Software Engineering & Knowledge Engineering, 1999, pp. 315319.
 T. Jones, “Evolutionary Algorithms, Fitness Landscapes and Search,” University of New Mexico, Albuquergue, NM, PhD thesis, 1995.
 I. Kajitani, T. Hushino, D. Nishikawa, H. Yokoi, S. Nakaya, T. Yamauchi, T. Inuo, N. Kajihara, M. Iwata, D. Keymeulen, and T. Higuchi, “A gatelevel EHW chip: Implementing GA operations and reconfigurable hardware on a single LSI,” in Proceedings of the 2nd International Conference on Evolvable Systems: From Biology to Hardware, Lecture Notes in Computer Science, M. Sipper and D. Mange and A. PerezUribe (eds.), SpringerVerlag, Heidelberg, 1998, vol. 1478, pp. 112.
 S. Kauffman, “Adaptation on Rugged Fitness Landscapes,” Lectures in the Sciences of Complexity, SFI Studies in the Sciences of Complexity, D. Stein (ed.), AddisonWesley, Reading, MA, 1989, pp. 527618.
 H. Kitano ed. in Massively Parallel Artificial Intelligence, MIT Press, Cambridge, MA, 1994.
 J. Kolodner, CaseBased Reasoning, Morgan Kaufmann: San Mateo, CA, 1993.
 J. R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection, MIT Press: Cambridge, MA, 1992.
 J. R. Koza, Genetic Programming II: Automatic Discovery of Reusable Programs, MIT Press: Cambridge, MA, 1994.
 J. R. Koza, D. Andre, and F. H. Bennett, III, “Use of automatically defined functions and architecturealtering operations in automated circuit synthesis with genetic programming,” in Proceedings of the 1st Annual Genetic Programming Conference, J. R. Koza et al. (eds.), MIT Press, Cambridge, MA, 1996, pp. 132140.
 J. R. Koza, F. H. Bennett, III, D. Andre, and M. A. Keane, “Automated Design of Both the Topology and Sizing of Analog Electrical Circuits Using Genetic Programming,” Artificial Intelligence in Design, J. S. Gero and F. Sudweeks (eds.) Kluwer Academic Publishers, MA, 1996, pp. 151170.
 J. R. Koza, F. H. Bennett, III, D. Andre, and M. A. Keane, Genetic Programming III: Darwinian Invention and Problem Solving, Morgan Kaufmann: San Francisco, CA, 1999.
 M. W. Kruiskamp and D. Leenaerts, “DARWIN: CMOS Opamp synthesis by means of genetic algorithms,” in Proceedings of the 32nd Design Automation Conference, Association for Computing Machinery, New York, 1995, pp. 433438.
 W. Kunz and P. Menon, “Multilevel logic optimization by implication analysis,” in Proceedings of the International Conference on ComputerAided Design ICCAD 1994, pp. 613.
 P. K. Lala, Practical Digital Logic Design and Testing, Prentice Hall: NJ, 1996.
 C. Y. Lee, “Representations of switching circuits by binary decision programs,” Bell Systems Technical Journal vol. 38 pp. 985999, 1959.
 P. Maguire, V. Shankararaman, R. Szegfue, and L. Morss, “Application of CaseBased Reasoning to Software Reuse,” Progress in CaseBased Reasoning, Lecture Notes in Artificial Intelligence, I. Watson (ed.) SpringerVerlag, Berlin, 1995, pp. 165174.
 M. L. Maher and A. G. de Silva Garza, “The Adaptation of Structural Systems Designs Using Genetic Algorithms,” Information Processing in Civil and Structural Engineering Design, CIVILCOMP Press, 1996, pp. 189196.
 B. Manderick, M. de Weger, and P. Spiessens, “The genetic algorithm and the structure of the fitness landscape,” in Proceedings of the 4th International Conference on Genetic Algorithms, R. K. Belew and L. B. Booker (eds.) Morgan Kaufmann, San Mateo, CA, 1991, pp. 143150.
 D. Mange and M. Tomassini eds. in BioInspired Computing Machines: Towards Novel Computational Architectures, Presses Polytechniques et Universitaires Romandes, 1998.
 E. McCluskey, “Minimization of Boolean functions,” Bell System Technical Journal vol. 35 pp. 14171444, 1956.
 Z. Michalewicz, Genetic AlgorithmsqData StructuressEvolution Programs, SpringerVerlag: Heidelberg, 1996, third edition.
 J. F. Miller, H. Luchian, P. V. G. Bradbeer, and P. J. Barclay, “Using a genetic algorithm for optimizing fixed polarity Reedmuller expansions of Boolean functions,” International Journal of Electronics vol. 76 pp. 601609, 1994.
 J. F. Miller, P. Thomson, and T. Fogarty, “Designing Electronic Circuits Using Evolutionary Algorithms. Arithmetic Circuits: A Case Study,” Genetic Algorithms and Evolution Strategies in Engineering and Computer Science, D. Quagliarella, J. Periaux, C. Poloni, and G. Winter (eds.) Wiley, Chechester, UK, 1997, pp. 105131.
 J. F. Miller and P. Thomson, “Evolving digital electronic circuits for realvalued function generation using a genetic algorithm,” Genetic Programming: Proceedings of the 3rd Annual Conference, J. R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. B. Fogel, M. H. Garzon, D. E. Goldberg, H. Iba, and R. L. Riolo (eds.) Morgan Kaufmann, San Francisco, 1998, pp. 863868.
 J. F. Miller and P. Thomson, “Aspects of digital evolution: Geometry and learning,” in Proceedings of the 2nd International Conference on Evolvable Systems: From Biology to Hardware, Lecture Notes in Computer Science, M. Sipper, D. Mange, and A. PerezUribe (eds.) SpringerVerlag, Heidelberg, 1998, vol. 1478, pp. 2535.
 J. F. Miller and P. Thomson, “Aspects of digital evolution: Evolvability and architecture,” Parallel Problem Solving from Nature V, Lecture Notes in Computer Science, A. E. Eiben, T. Bäck, M. Schoenauer, and H.P. Schwefel (eds.) Springer, Berlin, 1998, vol. 1498, pp. 927936.
 J. F. Miller, “An empirical study of the efficiency of learning boolean functions using a Cartesian Genetic Programming Approach,” in Proceedings of the 1st Genetic and Evolutionary Computation Conference, W. Banzhaf, J. Daida, A. E. Eiben, M. Garzon, V. Honavar, M. Jakiela, and R. E. Smith (eds.) Morgan Kaufmann, San Francisco, CA, 1999, vol. 2, pp. 927936.
 J. F. Miller, D. Job, and V. K. Vassilev, “Principles in the evolutionary design of digital circuits—Part I,” J. Genetic Programming and Evolvable Machines vol. 1 (1) 2000.
 J. F. Miller, D. Job, and V. K. Vassilev, “Principles in the evolutionary design of digital circuits—Part II,” J. Genetic Programming and Evolvable Machines vol. 1 (2) 2000, in press.
 M. Mitchell, S. Forrest, and J. Holland, “The royal road for genetic algorithms: Fitness landscapes and GA performance,” in Proceedings of the 1st European Conference on Artificial Life, J. Varela and P. Bourgine (eds.) MIT Press, Cambridge, MA, 1991, pp. 245254.
 M. Mitchell, An Introduction to Genetic Algorithms, MIT Press: Cambridge, MA, 1996.
 J. M. Moreno, “VLSI Architectures for Evolutive Neural Models,” Universitat Politecnica de Catalunya, Barcelona, PhD thesis, 1994.
 Motorola, Motorola Semiconductor Technical Data: Advance Information Field Programmable Analog Array 20cell Version MPAA020, Motorola Inc., 1997.
 M. Murakawa, S. Yoshizawa, T. Adachi, S. Suzuki, K. Takasuka, M. Iwata, and T. Higuchi, “Analogue EHW chip for intermediate frequency filters,” in Proceedings of the 2nd International Conference on Evolvable Systems: From Biology to Hardware, Lecture Notes in Computer Science, M. Sipper and D. Mange and A. PerezUribe (eds.) SpringerVerlag, Heidelberg, 1998, vol. 1478, pp. 134143.
 R. Poli, “Evolution of graphlike programs with parallel distributed genetic programming,” in Proceedings of the 7th International Conference on Genetic Algorithms, T. Bäck (ed.) Morgan Kaufmann, San Francisco, CA, 1997, pp. 346353.
 R. Poli, “Submachinecode GP: New results and extensions,” in Proceedings of the 2nd European Workshop on Genetic Programming, Lecture Notes in Computer Science, R. Poli, P. Nordin, W. B. Langdon, and T. Fogarty (eds.) SpringerVerlag, Heidelberg, 1999, vol. 1598, pp. 6582.
 R. Poli, J. Page, and W. B. Langdon, “Smooth uniform crossover, submachine code gp and demes: A recipe for solving highorder boolean parity problems,” in Proceedings of the 1st Genetic and Evolutionary Computation Conference, W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith (eds.) Morgan Kaufmann, San Francisco, CA, 1999, vol. 2, pp. 11621169.
 W. Quine, “The problem of simplifying truth functions,” American Mathematical Monthly vol. 59 pp. 521531, 1952.
 C. M. Reidys and P. F. Stadler, “Neutrality in Fitness Landscapes, Santa Fe Institute,” No. 9810089, submitted to Appl. Math. & Comput., 1998.
 K. A. Ross and R. B. Wright, Discrete Mathematics, Prentice Hall: Englewood Cliffs, NJ, 1988.
 T. Sasao, Logic Synthesis and Optimization, Kluwer Academic Publishers: MA, 1993.
 H.P. Schwefel, Numerical Optimization of Computer Models, John Wiley & Sons: Chichester, UK, 1981.
 A. Shen, S. Devadas, and A. Ghosh, “Probabilistic manipulation of Boolean functions using free Boolean diagrams,” IEEE Transactions on ComputerAided Design of Integrated Circuits and Systems vol. 14 pp. 8797, 1995.
 M. Sipper, Evolution of Parallel Cellular Machines: The Cellular Programming Approach, Lecture Notes in Computer Science, SpringerVerlag: Berlin, 1997, vol. 1194.
 M. Sipper, E. Sanchez, D. Mange, M. Tomassini, A. PerezUribe, and A. Stauffer, “A phylogenetic, ontogenetic, and epigenetic view of bioinspired hardware systems,” IEEE Transactions on Evolutionary Computation vol. 1 (1) pp. 8397, 1997.
 B. Smyth, “Case Based Design Department of Computer Science,” Trinity College, University of Dublin Ireland, PhD thesis, 1996.
 P. F. Stadler and W. Grünter, “Anisotropy in fitness landscapes,” J. Theor. Biol. vol. 165 pp. 373388, 1993.
 P. F. Stadler, “Towards Theory of Landscapes,” Complex Systems and Binary Networks, R. LopézPeñ a, R. Capovilla, R. GarcíaPelayo, H. Waelbroeck, and F. Zertuche (ed.) SpringerVerlag, Berlin, 1995, pp. 77163.
 P. F. Stadler, “Landscapes and Their Correlation Functions,” Santa Fe Institute, No. 9507067, submitted to J. Math. Chem., 1995.
 P. F. Stadler and G. P. Wagner, “Algebraic theory of recombination spaces,” Evolutionary Computation vol. 5 (3) pp. 241275, 1997.
 A. Stoica, A. Fukunaga, K. Hayworth, and C. SalazarLazaro, “Evolvable hardware for space applications,” in Proceedings of the 2nd International Conference on Evolvable Systems: From Biology to Hardware, Lecture Notes in Computer Science, M. Sipper and D. Mange and A. PerezUribe (eds.0 SpringerVerlag, Heidelberg, 1998, vol. 1478, pp. 166173.
 A. Stoica, D. Keymeulen, R. Tawel, C. SalazarLazaro, and W. Li, “Evolutionary experiments with a finegrained reconfigurable architecture for analog and digital CMOS circuits,” in Proceedings of the 1st NasarDoD Workshop on Evolvable Hardware, A. Stoica, D. Keymeulen, and J. Lohn (eds.) IEEE Computer Society, Los Alamitos, CA, 1999, pp. 7684.
 A. Teller and M. Veloso, “PADO: Learning tree structured algorithms for orchestration into an object recognition system,” Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, No. CMUCS95101, 1995.
 N. M. Thalmann and D. Thalmann (eds.) in Artificial Life and Virtual Reality, John Wiley, 1994.
 A. Thompson, “Silicon evolution,” in Proceedings of the 1st Annual Genetic Programming Conference, J. R. Koza et al. (ed.) MIT Press, Cambridge, MA, 1996, pp. 444452.
 A. Thompson, “An evolved circuit, intrinsic in silicon, entwined with physics,” in Proceedings of the 1st International Conference on Evolvable Systems: From Biology to Hardware, Lecture Notes in Computer Science, T. Higuchi and M. Iwata (eds.) SpringerVerlag, Heidelberg, 1997, vol. 1259, pp. 390405.
 A. Thompson, “On the automatic design of robust electronics through artificial evolution,” in Proceedings of the 2nd International Conference on Evolvable Systems: From Biology to Hardware, Lecture Notes in Computer Science, M. Sipper, D. Mange, and A. PerézUribe (eds.) SpringerVerlag, Heidelberg, 1998, vol. 1478, pp. 1324.
 A. Thompson, Hardware Evolution: Automatic Design of Electronic Circuits in Reconfigurable Hardware by Artificial Evolution, SpringerVerlag: London, 1998.
 A. Thompson, P. Layzell, and R. S. Zebulum, “Explorations in design space: Unconventional electronics design through artificial evolution,” IEEE Transactions on Evolutionary Computation vol. 4 (3) 1999, to appear.
 P. Thomson and J. F. Miller, “Symbolic method for simplifying ANDEXOR representations of Boolean functions using a binary decision technique and a genetic algorithm,” IEE Proceedings in Computers and Digital Techniques vol. 143 pp. 151155, 1996.
 M. Tomassini and E. Sanchez (eds.) in Towards Evolvable Hardware: The Evolutionary Engineering Approach, Lecture Notes in Computer Science, SpringerVerlag, Berlin, 1996, vol. 1062.
 V. K. Vassilev, “An information measure of landscapes,” in Proceedings of the 7th International Conference on Genetic Algorithms, Th. Bäck (ed.) Morgan Kaufmann, San Francisco, CA, 1997, pp. 4956.
 V. K. Vassilev, “Information analysis of fitness landscapes,” in Proceedings of the 4th European Conference on Artificial Life, P. Husbands and I. Harvey (eds.) MIT Press, Cambridge, MA, 1997, pp. 116124.
 V. K. Vassilev, J. F. Miller, and T. C. Fogarty, “Digital circuit evolution and fitness landscapes,” in Proceedings of the Congress on Evolutionary Computation, IEEE Press, Piscataway, NJ, 1999, vol. 2, pp. 12991306.
 V. K. Vassilev, J. F. Miller, and T. C. Fogarty, “On the nature of twobit multiplier landscapes,” in Proceedings of the 1st NASArDoD Workshop on Evolvable Hardware, A. Stoica, D. Keymeulen, and J. Lohn (eds.) IEEE Computer Society, Los Alamitos, CA, 1999, pp. 3645.
 V. K. Vassilev, T. C. Fogarty, and J. F. Miller, “Information characteristics and the structure of landscapes,” Evolutionary Computation, 1999, in press. Available upon request.
 E. D. Weinberger, “Correlated and uncorrelated fitness landscapes and how to tell the difference,” Biological Cybernetics vol. 63 pp. 325336, 1990.
 E. D. Weinberger, “Fourier and Taylor series on fitness landscapes,” Biological Cybernetics vol. 65 pp. 321330, 1991.
 S. Wright, “The roles of mutation, inbreeding, crossbreeding and selection in evolution,” in Proceedings of the 6th International Conference on Genetics, D. F. Jones (ed.) 1932, vol. 1, pp. 356366.
 J. Yarbrough, Digital Logic: Application and Design, West Publishing Company, 1997.
 R. S. Zebulum, M. A. Pacheco, and M. Vellasco, “Analog circuits evolution in extrinsic and intrinsic modes,” in Proceedings of the 2nd International Conference on Evolvable Systems: From Biology to Hardware, Lecture Notes in Computer Science, M. Sipper, D. Mange, and A. PeräzUribe (eds.) SpringerVerlag, Heidelberg, 1998, vol. 1478, pp. 154165.
 R. S. Zebulum, M. A. Pacheco, and M. Vellasco, “Artificial evolution on active filters: A case study,” in Proceedings of the 1st NasarDoD Workshop on Evolvable Hardware, A. Stoica, D. Keymeulen, and J. Lohn (eds.) IEEE Computer Society, Los Alamitos, CA, 1999, pp. 6675.
 Title
 Principles in the Evolutionary Design of Digital Circuits—Part I
 Journal

Genetic Programming and Evolvable Machines
Volume 1, Issue 12 , pp 735
 Cover Date
 20000401
 DOI
 10.1023/A:1010016313373
 Print ISSN
 13892576
 Online ISSN
 15737632
 Publisher
 Kluwer Academic Publishers
 Additional Links
 Topics
 Keywords

 evolutionary computing
 evolvable hardware
 cicuit design
 Authors

 Julian F. Miller ^{(1)}
 Dominic Job ^{(2)}
 Vesselin K. Vassilev ^{(3)}
 Author Affiliations

 1. School of Computer Science, The University of Birmingham, Birmingham, B15 2TT, England
 2. School of Computing, Napier University, Edinburgh, EH14 1DJ, Scotland
 3. School of Computing, Napier University, Edinburgh, EH14 1DJ, Scotland