Worst and best irredundant sum-of-products expressions

IEEE Transactions on Computers

Volumn 50, Issue 9, 2001, Pages 935-948

  Sasao, T ^a   Butler, J T ^a  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Complete sum of products expressions; Graph enumeration; Heuristic minimization; Irredundant sum of products; Logic minimization; Minimally strongly connected digraphs; Minimum sum of products expressions; Multiple output functions; Prime implicants; Symmetric functions; Worst sum of products expressions

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; GRAPH THEORY; OPTIMIZATION; THEOREM PROVING;

IRREDUNDANT SUM OF PRODUCTS EXPRESSIONS; MINIMALLY STRONGLY CONNECTED DIGRAPHS; MINIMUM SUM OF PRODUCTS EXPRESSIONS; PRIME IMPLICANT; WORST SUM OF PRODUCTS EXPRESSIONS;

LOGIC DESIGN;

EID: 0035439685     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.954508     Document Type: Article

References (37)

1. Computer-aided minimization procedure for boolean functions
2. Canonical expressions in boolean algebra
3. A state-machine synthesizer - SMS
4. A theorem on trees
5. Computing irredundant normal forms abbreviated presence functions
6. Two-level logic minimization: An overview
7. McBOOLE: A new procedure for exact logic minimization
8. A design system for the PLA-based digital circuits
9. The problem of simplifying logical expressions
10. Irredundant disjunctive and conjunctive forms of a boolean function
11. MINI: A heuristic approach for logic minimization
12. A survey and assessment of progress in switching theory and logical design in the soviet union
13. Unate truth functions
14. On the synthesis of many-variable switching functions
15. Fast generation of prime-irredundant covers from binary decision diagrams
16. Recursive operators for prime implicant and irredundant normal form determination
17. Determination of irredundant normal forms of a truth function by iterated consensus of the prime implicants
18. Simplest normal truth functions
19. Palmini-fats boolean minimizer for personal computers
20. Generation of prime implicants from subfunctions and a unifying approach to the covering problem
21. Multiple-valued minimization for PLA optimization
22. An application of multiple-valued logic to a design of programmable logic arrays
23. Multiple-valued decomposition of generalized boolean functions and the complexity of programmable logic arrays
24. Input variable assignment and output phase optimization of PLA's
25. Ternary decision diagrams and their applications
26. Generalization of consensus theory and application to the minimization of boolean functions
27. A remark on minimal polynomials of boolean functions
28. The problem of bounding the length of reduced disjunctive normal forms