IBDDs: an efficient functional representation for digital circuits
- 2 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 440-446
- https://doi.org/10.1109/edac.1992.205973
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Efficient Verification Of Multiplier And Other Difficult Functions Using IBDDsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Proving circuit correctness using formal comparison between expected and extracted behaviourPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Boolean satisfiability and equivalence checking using general binary decision diagramsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Probabilistic design verificationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplicationIEEE Transactions on Computers, 1991
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986