Solving Boolean equations using ROSOP forms

IEEE Transactions on Computers

Volumn 47, Issue 2, 1998, Pages 171-177

  Wang, Yuke ^a   McCrosky, Carl ^b  

^a Dept of Electrical and Computer Engineering   (Canada)

^b UNIVERSITY OF SASKATCHEWAN   (Canada)

Author keywords

And decision diagrams; Boolean algebra; Equation solving algorithms; Equations; Functions; Operations; SOP forms

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DECISION THEORY; DIGITAL ARITHMETIC;

REDUCED ORDERED SUM OF PRODUCT (ROSOP) FORMS;

BOOLEAN ALGEBRA;

EID: 0032000431     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.663763     Document Type: Article

References (20)

1. R.K. Brayton, G.D. Hachtel, C.T. McMullen, and A.L. Sangio-vanni-Vincentelli, "Logic Minimization Algorithms for VLSI Synthesis," Boston: Kluwer Academic, 1984.
2. R. Bryant, "Graph-Based Algorithm for Boolean Function Manipulation," IEEE Trans. Computers, vol. 35, no. 8, pp. 677-691, Aug. 1986.
3. P. Trabado, A. Lloris-Ruiz, J. Ortega-Lopera, "Solution of Switching Equations Based on a Tabular Algebra," IEEE Trans. Computers, vol. 42, no. 5, pp. 591-596, May 1993.
4. S. Unger, "Some Additions to 'Solution of Switching Equations Based on a Tabular Algebra'," IEEE Trans. Computers, vol. 43, no. 3, pp. 365-367, Mar. 1994.
5. Y. Wang, "New Data Structures for Boolean Functions," technical report, Univ. of Saskatchewan, May 1994.
6. Y. Wang, "Data Structures, Minimization and Complexity of Boolean Functions," PhD thesis, Univ. of Saskatchewan, 1996.
7. P.R. Bhattacharjee, S.K. Basu, and J.C. Paul, "Translation of the Problem of Complete Test Set Generation to Pseudo-Boolean Programming," IEEE Trans. Computers, vol. 40, no. 7, pp. 864-867, July 1991.
8. B. Krishnamurthy and J.G. Tollis, "Improved Techniques for Estimating Signal Probabilities," IEEE Trans. Computers, vol. 38, no. 7, pp. 1,041-1,045, July 1989.
9. T. Sasao, "An Algorithm to Derive the Complement of a Binary Function with Multiple-Valued Inputs," IEEE Trans. Computers, vol. 34, no. 2, pp. 131-140, Feb. 1985.
10. Y. Wang and C. McCrosky, "Negation Trees: A Unified Approach to Boolean Function Complementation," IEEE Trans. Computers, vol. 45, no. 5, pp. 626-630, May 1996.
11. R. Bryant, "Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams," ACM Computing Surveys, vol. 24, no. 3, Sept. 1992.
12. K.M. Bulter, D.E. Ross, R. Kapur, and M.R. Mercer, "Heuristics to Compute Variable Orderings for Efficient Manipulation of Ordered Binary Decision Diagrams," Proc. 28th Design Automation Conf., pp. 417-420, 1991.
13. S.J. Friedman and K.J. Supowit, "Finding the Optimal Variable Ordering for Binary Decision Diagrams," IEEE Trans. Computers, vol, 39, no. 5, pp. 710-713, May 1990.
14. S. Malik, A. Wang, R. Brayton and A. Sangiovanni-Vincentelli, "Logic Verification Using Binary Decision Diagrams in Logic Synthesis Environment," Proc. Design Automation Conf., pp. 624-628, 1988.
15. M. Mercer, R. Kapur, and D. Ross, "Functional Approaches to Generating Orderings for Efficient Symbolic Representation," Proc. 29th Design Automation Conf., pp. 40-45, 1992.
16. R. Rudell, "Dynamic Variable Ordering for Ordered Binary Decision Diagrams," Proc. Int'l Conf. Computer-Aided-Design, pp. 42-47, 1993.
17. H. Liaw and C. Lin, "On the OBDD-Representation of General Boolean Functions," IEEE Trans. Computers, vol. 41, no. 6, pp. 661-664, June 1992.
18. I. Wegener, "The Size of Reduced OBDD's and Optimal Read-once Branching Programs for Almost All Boolean Functions," IEEE Trans. Computers, vol. 43, no. 11, Nov. 1994
19. R.K. Brayton, J.D. Cohen, G.D. Hachtel, B.M. Trager, D.Y.Y. Yun, "Fast Recursive Boolean Function Manipulation," Proc. ISCAS 1982, pp. 58-62, 1982.
20. K. Brace, R. Rudell, and R. Bryant, "Efficient Implementation of a BDD Package," Proc. 27th Design Automation Conf., pp. 40-45, June 1990.