Exact two-level minimization of hazard-free logic with multiple-input changes
- 1 January 1992
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A method for exact hazard-free logic minimization of Boolean functions is described. Given an incompletely specified Boolean function, the method produces a minimal sum-of-products implementation which is hazard-free for a given set of multiple-input changes, if such a solution exists. The method is a constrained version of the Quine-McCluskey algorithm. It has been automated and applied to a number of examples. Results are compared with results of a comparable non-hazard-free method (espresso-exact). Overhead due to hazard elimination is shown to be negligible.Keywords
This publication has 19 references indexed in Scilit:
- Translating concurrent programs into delay-insensitive circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Synthesis of hazard-free asynchronous circuits from graphical specificationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Hazard prevention in combinational circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Hazard-non-increasing gate-level optimization algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Algorithms for synthesis of hazard-free asynchronous circuitsPublished by Association for Computing Machinery (ACM) ,1991
- Automatic synthesis of asynchronous circuits from high-level specificationsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- Compiling communicating processes into delay-insensitive VLSI circuitsDistributed Computing, 1986
- Synthesis of multiple input-change hazard-free combinational switching circuits without feedback†International Journal of Electronics, 1975
- A Unified Approach to Combinational HazardsIEEE Transactions on Computers, 1974
- Some Aids to the Detection of Hazards in Combinational Switching CircuitsIEEE Transactions on Computers, 1969