Skip to main content
SpringerLink
Log in

Theoretische Grundlagen

  • Chapter
Funktionaler Entwurf digitaler Schaltungen

Part of the book series: Springer-Lehrbuch ((SLB))

  • 65 Accesses

Zusammenfassung

Viele Probleme beim Entwurf integrierter Schaltungen lassen sich in ganz natürlicher Weise auch als graphentheoretische Probleme formulieren. In diesem Abschnitt werden die für das folgende wesentlichen Grundlagen der Graphentheorie ohne den Anspruch auf formale Strenge kurz zusammengestellt; für eine ausführlichere Darstellung sei auf spezielle Lehrbücher wie z. B. [Chri 75] verwiesen.

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

Access this chapter

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. A. Aho, J. Hopcroft, J. Ullman: The Design and Analysis of Computer Algorithms; Addison-Wesley, Reading, 1974.

    MATH  Google Scholar 

  2. R. Bellman: Dynamic Programming; Princeton University Press, Princeton, 1957.

    MATH  Google Scholar 

  3. R. Brayton, G. Hachtel, C. McMullen, A. Sangiovanni-Vincentelli: Logic Minimization Algorithms for VLSI Synthesis; Kluwer, Boston, 1984.

    Book  MATH  Google Scholar 

  4. G. Birkhoff, T. Bartee: Modern Applied Algebra; McGraw-Hill, New York, 1970.

    MATH  Google Scholar 

  5. K. Butler, D. Ross, R. Kapur, M. Mercer: Heuristics to Compute Variable Orderings for Efficient Manipulation of Ordered Binary Decision Diagrams; Proc. Design Automation Conf., S. 417–420, 1991.

    Google Scholar 

  6. R. Bryant: Graph-Based Algorithms for Boolean Function Manipulation; IEEE Trans. on Computers, Band C-35, S. 677–691, 1986.

    Article  MATH  Google Scholar 

  7. N. Christofides, S. Korman: A Computational Survey of Methods for the Set Covering Problem; Management Science, Band 21, S. 591–599, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  8. N. Christofides: Graph Theory: An Algorithmic Approach; Academic Press, London, 1975.

    MATH  Google Scholar 

  9. J. Cohon: Multiobjective Programming and Planning; Academic Press, New York, 1978.

    MATH  Google Scholar 

  10. S. Even: Graph Algorithms; Computer Science Press, 1979.

    Google Scholar 

  11. H. Eveking, S. Höreth: Optimierung und Resynthese komplexer Datenpfade; ITG-Fachberichte 122, Rechnergestützter Entwurf und Architektur mikroelektronischer Systeme, S. 115–124, 1992.

    Google Scholar 

  12. S. Friedman, K. Supowit: Finding the Optimal Ordering for Binary Decision Diagrams; Proc. 24th Design Automation Conf., S. 348–356, 1987.

    Google Scholar 

  13. M. Fujita, H. Fujisawa, N. Kawato: Evaluation and Improvements of Boolean Comparison Method Based on Binary Decision Diagrams; Digest of Papers, Int. Conf. on Computer-Aided Design, S. 2–5, 1988.

    Google Scholar 

  14. M. Garey, D. Johnson: Computers and Intractability; Freeman, New York 1979.

    MATH  Google Scholar 

  15. W. Giloi, H. Liebig: Logischer Entwurf digitaler Systeme; Springer, Berlin 1980.

    MATH  Google Scholar 

  16. W. Grass: Steuerwerke — Entwurf von Schaltwerken mit Festwertspeichern; Springer, Berlin, 1978.

    Google Scholar 

  17. H. Isermann: Strukturierung von Entscheidungsprozessen bei mehrfacher Zielsetzung; Operations Research Spektrum, Band 1, S. 3–26, 1979.

    Article  MATH  Google Scholar 

  18. N. Ishiura, H. Sawada, S. Yajima: Minimization of Binary Decision Diagrams Based on Exchanges of Variables; Digest of Papers, Int. Conf. on Computer-Aided Design, S. 472–475, 1991.

    Google Scholar 

  19. D. Johnson: Finding all the Elementary Circuits of a Directed Graph; SLAM J. on Computing, Band 4, S. 77–84, 1975.

    Article  MATH  Google Scholar 

  20. R. Karp: Reducibility among Combinatorial Problems; in Complexity of Computer Computations, R. E. Miller, J. W. Thatcher (Hrsg.), Plenum Press, New York, 1972.

    Google Scholar 

  21. S. Malik, A. Wang, R. Brayton, A. Sangiovanni-Vincentelli: Logic Verification Using Binary Decision Diagrams in a Logic Synthesis Environment; Digest of Papers, Int. Conf. on Computer-Aided Design, S. 6–9, 1988.

    Google Scholar 

  22. K. Neumann: Operations Research Verfahren; Hanser, München, 1975.

    Google Scholar 

  23. M. Pipponzi, F. Somenzi: An Iterative Algorithm for the Binate Covering Problem; Proc. 1st European Design Automation Conf., S. 208–211, 1990.

    Google Scholar 

  24. D. Schmid, D. Senger, H. Wojtkowiak: Technische Informatik; Oldenbourg, München, 1973.

    Google Scholar 

  25. J. Tiernan: An Efficient Search Algorithm to Find the Elementary Circuits of a Graph; Comm. of the ACM, Band 13, S. 722–726, 1970.

    Article  MATH  MathSciNet  Google Scholar 

  26. M. Zeleny: Multiple Criteria Decision Making; McGraw-Hill, New York, 1982.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Forschungszentrum Abteilung Computer Science (CRBC), ABB Management AG, CH-5405, Baden-Dättwil, Schweiz

    Dr. Bernhard Eschermann

Authors
  1. Dr. Bernhard Eschermann
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Eschermann, B. (1993). Theoretische Grundlagen. In: Funktionaler Entwurf digitaler Schaltungen. Springer-Lehrbuch. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95710-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-95710-9_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56788-2

  • Online ISBN: 978-3-642-95710-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation