Logic design of digital systems
Logic design of digital systems
The Concept of Term Exclusiveness and Its Effect on the Theory of Boolean Functions
Journal of the ACM (JACM)
Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
DAC '84 Proceedings of the 21st Design Automation Conference
Computer aided minimization procedure for boolean functions
DAC '84 Proceedings of the 21st Design Automation Conference
A State-Machine Synthesizer—SMS
DAC '81 Proceedings of the 18th Design Automation Conference
An implementation of a state assignment heuristic
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
EURO-DAC '90 Proceedings of the conference on European design automation
| Hi-index | 0.01 |
A new logic minimization algorithm is presented. It finds a minimal cover for a multiple-output Boolean function expressed as a list of cubes. A directed graph is used to speed up the selection of a minimal cover. Covering cycles are partitioned and branched independently to reduce greatly the branching depth. The resulting minimized list of cubes is guaranteed to be minimal in the sense that no cover with less cubes can exist. The dont care at output is handled properly. This algorithm was implemented in C under UNIX BSD4.2. An extensive comparison with ESPRESSO IIC shows that the new algorithm is particularly attractive for functions with less than 20 input and 20 output variables.