Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Principles in the Evolutionary Design of Digital Circuits—Part II

  • Published:
Genetic Programming and Evolvable Machines Aims and scope Submit manuscript

Abstract

In a previous work it was argued that by studying evolved designs of gradually increasing scale, one might be able to discern new, efficient, and generalisable principles of design. These ideas are tested in the context of designing digital circuits, particularly arithmetic circuits. This process of discovery is seen as a principle extraction loop in which the evolved data is analysed both phenotypically and genotypically by processes of data mining and landscape analysis. The information extracted is then fed back into the evolutionary algorithm to enhance its search capabilities and hence increase the likelihood of identifying new principles which explain how to build systems which are too large to evolve.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. T. Bäck, F. Hoffmeister and H. P. Schwefel, “A survey of evolutionary strategies,” in Proc. 4th Int. Conf. on Genetic Algorithms, R. Belew and L. Booker eds., Morgan Kaufmann: San Francisco, CA, 1991, pp. 2–9.

    Google Scholar 

  2. G. Box and G. Jenkins, Time Series Analysis, Forecasting and Control. Holden Day, 1970.

  3. C. Giraud-Carrier, “Flare: Induction with prior knowledge,” in Proc. Expert Systems 1996, vol. XIII of Research and Development in Expert Systems, SGES Publications, 1996, pp. 173–181.

  4. K. Hanney, “Learning adaptation rules from cases,” Technical report, Department of Computer Science, Trinity College, University of Dublin, Ireland, M.Sc. thesis, 1996.

  5. W. Hordijk, “A measure of landscapes,” Evolutionary Computation vol. 4(4) pp. 335–360, 1996.

    Google Scholar 

  6. W. Hordijk, “Correlation analysis of the synchronising-ca landscape,” Phys. D vol. 107 pp. 255–264, 1997.

    Google Scholar 

  7. W. Hordijk and P. F. Stadler, “Amplitude spectra of fitness landscapes,” Adv. Complex Systems vol. 1 pp. 39–66, 1998.

    Google Scholar 

  8. J. Hunt, “Evolutionary case base design,” in Progress in Case-Based Reasoning First UK workshop, Springer-Verlag: Berlin, 1995.

    Google Scholar 

  9. D. Job, V. Shankararaman and J. Miller, “Hybrid ai techniques for software design,” in Proc. 1999 Conf. on Software Engineering & Knowledge Engineering, 1999, pp. 315–319.

  10. T. Jones, “Evolutionary algorithms, fitness landscapes and search,” Ph.D. thesis, University of New Mexico, Albuquerque, NM, 1995.

    Google Scholar 

  11. S. Kauffman, “Adaptation on rugged fitness landscapes,” in Lectures in the Sciences of Complexity, SFI Studies in the Sciences of Complexity, D. Stein ed., Addison-Wesley: Reading, MA, 1989, pp. 527–618.

    Google Scholar 

  12. J. Kolodner, Case-Based Reasoning, Morgan Kaufmann: San Mateo, CA, 1993.

    Google Scholar 

  13. P. Maguire, V. Shankararaman, R. Szegfue and L. Morss, “Application of case-based reasoning to software reuse,” in Progress in Case-Based Reasoning, Lecture Notes in Artificial Intelligence, I. Watson ed., Springer-Verlag: Berlin, 1995, pp. 165–174.

    Google Scholar 

  14. M. L. Maher and A. G. de Silva Garza, “The adaptation of structural systems designs using genetic algorithms,” in Information Processing in Civil and Structural Engineering Design, CIVIL-COMP Press, 1996, pp. 189–196.

  15. B. Manderick, M. de Weger and P. Spiessens, “The genetic algorithm and the structure of the fitness landscape,” in Proc. 4th Int. Conf. on Genetic Algorithms, R. K. Belew and L. B. Booker eds., Morgan Kaufmann: San Mateo, CA, 1991, pp. 143–150.

    Google Scholar 

  16. J. F. Miller, “An empirical study of the efficiency of learning boolean functions using a cartesian genetic programming approach,” in Proc. 1st Genetic and Evolutionary Computation Conf., W. Banzhaf, J. Daida, A. E. Eiben, M. Garzon, V. Honavar, M. Jakiela, and R. E. Smith eds., San Francisco, CA: Morgan Kaufmann, 1999, vol. 2, pp. 927–936.

    Google Scholar 

  17. 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) pp. 7–35, 2000.

    Google Scholar 

  18. J. F. Miller and P. Thomson, “Aspects of digital evolution: Evolvability and architecture,” in Parallel Problem Solving from Nature V, vol. 1498 of Lecture Notes in Computer Science, A. E. Eiben, T. Back, M. Schoenauer and H.-P. Schwefel eds., Springer: Berlin, 1998, pp. 927–936.

    Google Scholar 

  19. J. F. Miller, P. Thomson and T. Fogarty, “Designing electronic circuits using evolutionary algorithms, arithmetic circuits: A case study,” in Genetic Algorithms and Evolution Strategies in Engineering and Computer Science, D. Quagliarella, J. Periaux, C. Poloni and G. Winter eds., Wiley: Chichester, UK, 1997 pp. 105–131.

    Google Scholar 

  20. M. Mitchell, S. Forrest and J. Holland, “The royal road for genetic algorithms: Fitness landscapes and ga performance,” in Proc. 1st Eur. Conf. on Artificial Life, J. Varela and P. Bourgine eds., MIT Press: Cambridge, MA, 1991, pp. 245–254.

    Google Scholar 

  21. H. Muhlenbein and D. Schlierkamp-Voosen, “The science of breeding and its application to the breeder genetic algorithm (bga),” Evolutionary Computation vol. 1(4), pp. 335–360, 1993.

    Google Scholar 

  22. C. M. Reidys and P. F. Stadler, “Neutrality in fitness landscapes,” Technical Report, 98–10-089, Santa Fe Institute, 1998, Submitted to Appl. Math. Comput.

  23. H.-P. Schwefel, Numerical Optimization of Computer Models, John Wiley & Sons: Chichester, UK, 1981.

    Google Scholar 

  24. M. Sipper, E. Sanchez, D. Mange, M. Tomassini, A. Pérez-Uribe and A. Stauffer, “A phylogenetic, ontogenetic, and epigenetic view of bio-inspired hardware systems,” IEEE Trans. Evolutionary Computation vol. 1(1) pp. 83–97, 1997.

    Google Scholar 

  25. B. Smyth, “Case based design,” Ph.D. thesis, Department of Computer Science, Trinity College, University of Dublin, Ireland, 1996.

    Google Scholar 

  26. P. F. Stadler, “Towards theory of landscapes,” in Complex Systems and Binary Networks, R. Lopéz-Peña, R. Capovilla, R. García-Pelayo, H. Waelbroeck and F. Zertuche eds., Springer-Verlag: Berlin, 1995, pp. 77–163.

    Google Scholar 

  27. P. F. Stadler, “Landscapes and their correlation functions,” J. Math. Chem. vol. 20 pp. 1–45, 1996.

    Google Scholar 

  28. P. F. Stadler and W. Grunter, “Anisotropy in fitness landscapes,” J. Theor. Biol. vol. 165 pp. 373–388, 1993.

    Google Scholar 

  29. P. F. Stadler and G. P. Wagner, “Algebraic theory of recombination spaces,” Evolutionary Computation vol. 5(3) pp. 241–275, 1997.

    Google Scholar 

  30. A. Thompson, P. Layzell and R. S. Zebulum, “Explorations in design space: Unconventional electronics design through artificial evolution,” IEEE Trans. Evolutionary Computation vol. 3(3) pp. 167–196, 1999.

    Google Scholar 

  31. V. K. Vassilev, “Information analysis of fitness landscapes,” in Proc. 4th Eur. Conf. Artificial Life, P. Husbands and I. Harvey eds., MIT Press: Cambridge, MA, 1997a, pp. 116–124.

    Google Scholar 

  32. V. K. Vassilev, “An information measure of landscapes,” in Proc. 7th Int. Conf. on Genetic Algorithms, T. Bäck ed., Morgan Kaufmann: San Francisco, CA, 1997b, pp. 49–56. ¨

  33. V. K. Vassilev, T. C. Fogarty and J. F. Miller, “Information characteristics and the structure of landscapes,” Evolutionary Computation vol. 8(1) pp. 31–60, 2000.

    Google Scholar 

  34. V. K. Vassilev, J. F. Miller and T. C. Fogarty, “Digital circuit evolution and fitness landscapes,” in Proc. Congress on Evolutionary Computation, IEEE Press: Piscataway, NJ, 1999a, vol. 2, pp. 1299–1306.

    Google Scholar 

  35. V. K. Vassilev, J. F. Miller and T. C. Fogarty, “On the nature of two-bit 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, 1999b, pp. 36–45.

    Google Scholar 

  36. E. D. Weinberger, “Correlated and uncorrelated fitness landscapes and how to tell the difference,” Biol. Cybernetics vol. 63 pp. 325–336, 1990.

    Google Scholar 

  37. S. Wright, “The roles of mutation, inbreeding, crossbreeding and selection in evolution,” in Proc. 6th Int. Conf. on Genetics, D. F. Jones ed., 1932, vol. 1, pp. 356–366.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Miller, J.F., Job, D. & Vassilev, V.K. Principles in the Evolutionary Design of Digital Circuits—Part II. Genetic Programming and Evolvable Machines 1, 259–288 (2000). https://doi.org/10.1023/A:1010066330916

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1010066330916