Skip to main content
SpringerLink
Log in
Book cover

Workshops on Applications of Evolutionary Computation

EvoWorkshops 2006: Applications of Evolutionary Computing pp 308–319Cite as

Finding Compact BDDs Using Genetic Programming

  • Conference paper

  • 1548 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3907))

Abstract

Binary Decision Diagrams (BDDs) can be used to design multiplexor based circuits. Unfortunately, the most commonly used kind of BDDs – ordered BDDs – has exponential size in the number of variables for many functions. In some cases, more general forms of BDDs are more compact. In constrast to the minimization of OBDDs, which is well understood, there are no heuristics for the construction of compact BDDs up to today. In this paper we show that compact BDDs can be constructed using Genetic Programming.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Drechsler, R., Günther, W.: Towards One-Path Synthesis. Kluwer Academic Publishers, Dordrecht (2002)

    Google Scholar 

  2. Bryant, R.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Comp. 35, 677–691 (1986)

    Article  MATH  Google Scholar 

  3. Ajtai, M., Babai, L., Hajnal, P., Komlos, J., Pudlak, P., Rödl, V., Szemeredi, E., Turan, G.: Two lower bounds for branching programs. In: Symp. on Theory of Computing, pp. 30–38 (1986)

    Google Scholar 

  4. Bryant, R.: On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Trans. On Comp. 40, 205–213 (1991)

    Article  Google Scholar 

  5. Becker, B., Drechsler, R., Werchner, R.: On the relation between BDDs and FDDs. Technical Report 12/93, Universität Frankfurt, 12/93, Fachbereich Informatik (1993)

    Google Scholar 

  6. Kebschull, U., Schubert, E., Rosenstiel, W.: Multilevel logic synthesis based on functional decision diagrams. In: European Conf. on Design Automation, pp. 43–47 (1992)

    Google Scholar 

  7. Drechsler, R., Sarabi, A., Theobald, M., Becker, B., Perkowski, M.: Efficient representation and manipulation of switching functions based on ordered Kronecker functional decision diagrams. Technical Report 14/93, J.W.Goethe-University, Frankfurt (1993)

    Google Scholar 

  8. Ashar, P., Ghosh, A., Devadas, S., Newton, A.: Combinational and sequential logic verification using general binary decision diagrams. In: Int’l Workshop on Logic Synth. (1991)

    Google Scholar 

  9. Rudell, R.: Dynamic variable ordering for ordered binary decision diagrams. In: Int’l Workshop on Logic Synth, pp. 3a–1–3a–12 (1993)

    Google Scholar 

  10. Drechsler, R., Becker, B., Göckel, N.: A genetic algorithm for variable ordering of OBDDs. IEE Proceedings 143, 364–368 (1996)

    Google Scholar 

  11. Sakanashi, H., Higuchi, T., Iba, H., Kakazu, Y.: Evolution of binary decision diagrams for digital circuit design using genetic programming. In: ICES, pp. 470–481 (1996)

    Google Scholar 

  12. Bollig, B., Wegener, I.: Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. on Comp. 45, 993–1002 (1996)

    Article  MATH  Google Scholar 

  13. Wegener, I.: Bdds – design, analysis, complexity, and applications. Discrete Applied Mathematics 138, 229–251 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  14. Friedman, S., Supowit, K.: Finding the optimal variable ordering for binary decision diagrams. In: Design Automation Conf., pp. 348–356 (1987)

    Google Scholar 

  15. Buch, P., Narayan, A., Newton, A., Sangiovanni-Vincentelli, A.: On synthesizing pass transistor networks. In: Int’l Workshop on Logic Synth. (1997)

    Google Scholar 

  16. Ferrandi, F., Macii, A., Macii, E., Poncino, M., Scarsi, R., Somenzi, F.: Layoutoriented synthesis of PTL circuits based on BDDs. In: Int’l Workshop on Logic Synth., pp. 514–519 (1998)

    Google Scholar 

  17. Koza, J.: Genetic Programming - On the Programming of Computers by means of Natural Selection. MIT Press, Cambridge (1992)

    MATH  Google Scholar 

  18. Keijzer, M., Merelo, J.J., Schoenauer, G.R., Evolving, M.: objects: a general purpose evolutionary computation library. Evolution Artificielle (2001)

    Google Scholar 

  19. Somenzi, F.: CUDD: CU Decision Diagram Package Release 2.4.0. University of Colorado at Boulder (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Bremen, Bremen, 28359, Germany

    Ulrich Kühne & Nicole Drechsler

Authors
  1. Ulrich Kühne
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nicole Drechsler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Johannes Gutenberg University, Mainz, Germany

    Franz Rothlauf

  2. Institute AIFB, University of Karlsruhe, 76128, Karlsruhe, Germany

    Jürgen Branke

  3. Dipartimento di Ingegneria dell’Informazione, Università di Parma,  

    Stefano Cagnoni

  4. Centre of Informatics and Systems of the University of Coimbra,  

    Ernesto Costa

  5. Dept. LCC, Universidad de Málaga, Spain

    Carlos Cotta

  6. Institute of Computer Science, University of Bremen, 28359, Bremen, Germany

    Rolf Drechsler

  7. INRIA Saclay - Ile-de-France, Parc Orsay Université, 4, rue Jacques Monod, 91893, ORSAY Cedex, France

    Evelyne Lutton

  8. CISUC, Department of Informatics Engineering, University of Coimbra, Polo II of the University of Coimbra, 3030, Coimbra, Portugal

    Penousal Machado

  9. Dartmouth College, Lebanon, NH, USA

    Jason H. Moore

  10. Universidade de A Coruña, CP 15071, A Coruña, Spain

    Juan Romero

  11. School of Computing Sciences, UEA Norwich, University of East Anglia, NR4 7TJ, Norwich, UK

    George D. Smith

  12. Dipartimento di Automatica e Informatica, Politecnico di Torino, Italy

    Giovanni Squillero

  13. Kyushu University, Japan

    Hideyuki Takagi

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kühne, U., Drechsler, N. (2006). Finding Compact BDDs Using Genetic Programming. In: Rothlauf, F., et al. Applications of Evolutionary Computing. EvoWorkshops 2006. Lecture Notes in Computer Science, vol 3907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11732242_28

Download citation

  • DOI: https://doi.org/10.1007/11732242_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33237-4

  • Online ISBN: 978-3-540-33238-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation