Utilizing BDDs for disjoint SOP minimization

Midwest Symposium on Circuits and Systems

Volumn 2, Issue , 2002, Pages

  Fey, Görschwin ^a   Drechsler, Rolf ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; DATA STRUCTURES; DECISION THEORY; OPTIMIZATION;

BINARY DECISION DIAGRAMS (BDD);

ELECTRIC NETWORK ANALYSIS;

EID: 0036979279     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. R.E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Camp., 35(8):677-691, 1986.
2. R.E. Bryant. Binary decision diagrams and beyond: Enabeling techniques for formal verification. In Int'l Conf. on CAD, pages 236-243, 1995.
3. R.Drechsler. Formal Verification of Circuits. Kluwer Academic Publishers, 2000.
4. B.J. Falkowski. Calculation of rademacher-walsh spectral coefficients for systems of completely and incompletely specified boolean functions. In IEEE Proceedings on Circuits, pages 1698-1701, 1993.
5. B.J. Falkowski and C.-H. Chang. Paired haar spectra computation through operations on disjoint cubes. In IEEE Proceedings on Circuits, Devices and Systems, pages 117-123, 1999.
6. B.J. Falkowski, I. Schäfer, and C.-H. Chang. An effective computer algorithm for the calculation of disjoint cube representation of boolean functions. In 36th IEEE Midwest Symposium on Circuits and Systems, pages 1308-1311, 1993.
7. G. Fey and R. Drechsler. Minimizing the number of paths in BDDs. In 5th International Workshop on Boolean Problems, 2002.
8. W. Günther and R. Drechsler. ACTion: Combining logic synthesis and technology mapping for mux based fpgas. Journal of Systems Architecture, 46(14):1321-1334, 2000.
9. Y.-T. Lai, S. Sastry, and M. Pedram. Boolean matching using binary decision diagrams with applications to logic synthesis and verification. In Int'l Conf. on CAD, pages 452-458, 1992.
10. C. Meinel, F. Somenzi, and T. Theobald. Linear sifting of decision diagrams and its application in synthesis. IEEE Trans. on CAD, 19(5):521-533, 2000.
11. A. Mischenko and M. Perkowski. Fast heuristic minimization of exclusive-sums-of-products. In 5th Int'l Workshop on Applications of the Reed-Muller Expansion in Circuit Design, pages 242-250, 2001.
12. R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Int'l Conf. on CAD, pages 42-47, 1993.
13. T. Sasao. EXMIN2: A simplification algorithm for Exclusive-OR-Sum-of products expressions for multiple-valued-input two-valued-output functions. IEEE Trans. on CAD, 12:621-632, 1993.
14. L. Shivakumaraiah and M.Thornton. Computation of disjoint cube representations using a maximal binate variable heuristic. In IEEE Southeastern Symposium on System Theory, pages 417-421, 2002.
15. M. Thornton, R. Drechsler, and D.M. Miller. Spectral Techniques in VLSI CAD. Kluwer Academic Publisher, 2001.
16. Y. Ye and K. Roy. Graph-based synthesis algorithms for AND/XOR networks. In Design Automation Conf., pages 107-112, 1997.