Efficient graph-based computation and manipulation of functional decision diagrams
- 30 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 278-282
- https://doi.org/10.1109/edac.1993.386463
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Fast exact and quasi-minimal minimization of highly testable fixed-polarity AND/XOR canonical networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Multilevel logic synthesis based on functional decision diagramsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Logic synthesis for arithmetic circuits using the Reed-Muller representationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- An improved algorithm for the minimization of mixed polarity Reed-Muller representationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the complexity of mod-2l sum PLA'sIEEE Transactions on Computers, 1990
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Minimisation of Reed-Muller polynomials with fixed polarityIEE Proceedings E Computers and Digital Techniques, 1984
- Easily Testable Realizations ror Logic FunctionsIEEE Transactions on Computers, 1972
- Minimization of Exclusive or and Logical Equivalence Switching CircuitsIEEE Transactions on Computers, 1970
- Application of Boolean algebra to switching circuit design and to error detectionTransactions of the I.R.E. Professional Group on Electronic Computers, 1954