Fast Heuristic and Exact Algorithms for Two-Level Hazard-Free Logic Minimization

Michael Theobald & Steven M. Nowick
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and automated circuit partitioning techniques. This paper introduces two new 2-level logic minimizers:ESPRESSO-HF, a heuristic method which is loosely based on ESPRESSO-II, and IMPYMIN, an exact method based on implicit data structures. Both minimizers can solve all currently available examples, which range up to 32 inputs and 33 outputs.These include examples...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.