Advertisement

Evolution of binary decision diagrams for digital circuit design using genetic programming

  • Hidenori Sakanashi
  • Tetsuya Higuchi
  • Hitoshi Iba
  • Yukinori Kakazu
Genenetic Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1259)

Abstract

This paper proposes the methodology for hardware evolution by genetic programming (GP). By adopting Binary Decision Diagrams (BDDs) as hardware representation, larger circuits can be evolved, and they will be easily verified by utilizing commercial CAD software. The hardware descriptions specified in BDDs are improved by GP operators, to synthesize various combinatorial logical circuits.

From the viewpoint of GP, however, some constraints of BDD must be satisfied during its search process. In other words, GP must search not only in phenotype space, but also in genotype space. In order to resolve this problem, in this paper, we attempt two approaches. One concerns the operations to obtain BDDs satisfying the genotypical constraints, and the other is the method for balancing phenotypic and genotypic evaluations.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. [Armstrong79]
    W. W. Armstrong and J. Gecsei: Adaptation Algorithms for Binary Tree Networks, IEEE Trans. on SMC, vol. SMC-9, No. 5, pp. 276–285, 1979.Google Scholar
  2. [Bryant86]
    R. E. Bryant: Graph-Based Algorithms for Boolean Function Manipulation, IEEE Trans, on computers, Vol. C-35, No. 8, pp. 677–691, 1986.Google Scholar
  3. [Bryant95]
    R. E. Bryant: Binary Decision Diagrams and Beyond: Enabling Technologies for Formal Verification, Embedded tutorial at International Conference on Computer-Aided Design November, 1995.Google Scholar
  4. [Goldberg89]
    D. E. Goldberg: Genetic Algorithms in Search, Optimization and Machine Learning, p.412, Addison-Wesley, 1989.Google Scholar
  5. [Holland75]
    J. H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, 1975.Google Scholar
  6. [Higuchi94]
    T. Higuchi, H. Iba and B. Manderick: Applying Evolvable Hardware to Autonomous Agents, Parallel Problem Solving from Nature 3, pp. 524–533, Springer, 1994.Google Scholar
  7. [Jacob94]
    C. Jacob, Genetic L-System Programming, Parallel Problem Solving from Nature 3, pp. 334–343, Springer, 1994.Google Scholar
  8. [Kinnear94]
    K.E. Kinner, Jr., Alternatives in Automatic Function Definition: A Comparison of Performance, Advances in Genetic Programming (Edited by K. E. Kinnear, Jr.), MIT Press, 1994.Google Scholar
  9. [Koza94]
    J. R. Koza: Genetic Programming II, p.746, MIT Press, 1994.Google Scholar
  10. [Rosca94]
    J. P. Rosca and D. H. Ballard, Hierarchical Self-Organization in Genetic Programming, Machine Learning, Proc. of 11th Int. Conf., pp. 251–258, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Hidenori Sakanashi
    • 1
  • Tetsuya Higuchi
    • 2
  • Hitoshi Iba
    • 2
  • Yukinori Kakazu
    • 1
  1. 1.Autonomous Systems Eng., Complex Systems Eng.Hokkaido UniversitySapporoJapan
  2. 2.Eloctrotechnical LaboratoryTsukubaJapan

Personalised recommendations