SOCRATES: a system for automatically synthesizing and optimizing combinational logic
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Logic synthesis and optimization benchmarks for the 1986 Design Automation Conference
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
A new synthesis technique for multilevel combinational circuits
EURO-DAC '90 Proceedings of the conference on European design automation
An algorithm for bi-decomposition of logic functions
Proceedings of the 38th annual Design Automation Conference
Multi-level logic optimization
Logic Synthesis and Verification
Simplifying Boolean constraint solving for random simulation-vector generation
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Artificial Intelligence Review
A Framework for Constrained Functional Verification
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Artificial intelligence in logic design
Bi-decomposing large Boolean functions via interpolation and satisfiability solving
Proceedings of the 45th annual Design Automation Conference
Timing-driven N-way decomposition
Proceedings of the 19th ACM Great Lakes symposium on VLSI
| Hi-index | 0.00 |
This Paper presents a new methodology for the decomposition of Boolean functions, which is exclusively based on the utilization of function properties. The main point in this connection is the "groupability" of Boolean functions. The analysis of uncompletely specified functions is carried out by means of Boolean differential equations. Examples demonstrate the efficiency of the automatic implementation.