An algorithm for bi-decomposition of logic functions

Proceedings - Design Automation Conference

Volumn , Issue , 2001, Pages 103-108

  Mishchenko, Alan ^a   Steinbach, Bernd ^b   Perkowski, Marek ^a  

^a PORTLAND STATE UNIVERSITY   (United States)

^b TU BERGAKADEMIE FREIBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; DELAY CIRCUITS; SWITCHING CIRCUITS;

LOGIC FUNCTIONS;

LOGIC GATES;

EID: 0034853981     PISSN: 0738100X     EISSN: None     Source Type: Journal    
DOI: 10.1109/DAC.2001.156117     Document Type: Article

References (16)

1. The decomposition of switching functions
2. The disjunctive decomposition of logic functions
3. Finding all simple disjunctive decompositions using irredundant sum-of-products forms
4. DECOMPOS: An integrated system for functional decomposition
5. A new decomposition method for multilevel circuit design
6. Functional decomposition of speed optimized circuits
7. Design of fully testable circuits by functional decomposition and implicit test pattern generation
8. Synthesis of multi-level circuits using EXOR-gates
9. BDS: A BDD-based logic optimization system
10. On bi-decomposition of logic functions
11. Graph-based algorithms for boolean function manipulation
12. Bi-decomposition of multi-valued functions for circuit design and data mining applications