Skip to main content

Functional Comparison of Logic Designs for VLSI Circuits

  • Chapter
The Best of ICCAD

Abstract

Determining whether or not two circuits are functionally equivalent is of fundamental importance in many phases of the design of computer logic. We describe a new method for circuit equivalence which proceeds by reducing the question of whether two circuits are equivalent to a number of more easily answered questions concerning the equivalence of smaller, related circuits. This method can be used to extend the power of any given equivalence-checking algorithm. We report the results of experiments evaluating our technique.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover 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.

References

  1. C. Leonard Berman, “On Logic Comparison”,Proc. 18th DAC, Nashville, TN, 1981.

    Google Scholar 

  2. C. Leonard Berman, “Ordered Binary Decision Diagrams and Circuit Structure”, Proc. of the ICCD,Cambridge, MA, Oct 214, 1989.

    Google Scholar 

  3. Randal E. Bryant,“Graph Based Algorithms for Boolean Function Manipulation”,IEEE Trans. on Computers, vol. C-35, no. 8, pp. 677–691,1986.

    Article  Google Scholar 

  4. Steven A. Cook, “The complexity of theorem proving procedures”,Proc 3rd ACM SIGACT, pp. 151–158, 1971.

    Google Scholar 

  5. J.A. Darringer, D. Brand, J.V. Gerbi, W.H. Joyner and L.H. Trevillyan,“LSS: A System for Production Logic Synthesis”,IBM Journal of Research and Development,vol. 28, no. 5, pp. 537–545, Sept 1984.

    Article  Google Scholar 

  6. W.E. Donath and H. Ofek, “Automatic Identification of Equivalence Points for Boolean Logic Verification”, IBM Tech. Discolsure Bulletin, vol. 18, pp.2700–2703,1976

    Google Scholar 

  7. L.R. Ford,Jr. and D.R. Fulkerson,Flows in Networks,Princeton, NJ: Princeton University Press, 1962.

    MATH  Google Scholar 

  8. M. Fujita,H. Fujiwara and N. Kawato,“Evaluation and Improvements of Boolean Comparison Method based on Binary Decision Diagrams”,Proceeding of ICCAD, Nov 1988.

    Google Scholar 

  9. Sharad Malik, Albert R. Wang, Robert K. Brayton and Alberto Sangiovanni-Vincentelli, “Logic Verification using Binary Decision Diagrams in a Logic Synthesis Environment”, Proceedings of ICCAD, Nov 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer Science+Business Media New York

About this chapter

Cite this chapter

Berman, C.L., Trevillyan, L.H. (2003). Functional Comparison of Logic Designs for VLSI Circuits. In: Kuehlmann, A. (eds) The Best of ICCAD. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0292-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-0292-0_3

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-5007-1

  • Online ISBN: 978-1-4615-0292-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics