Hazard prevention in combinational circuits
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. i, 111-120
- https://doi.org/10.1109/hicss.1990.205106
Abstract
The authors consider the problem of hazard prevention in combinational circuits. It is shown that only precharged-unate circuits do not undergo hazards (multiple change in a node's value) during evaluation. It is further shown that the addition of redundancy and ordering information on the inputs to a gate in a circuit or the insertion of delay elements cannot prevent the occurrence of hazards in an inherently hazardous circuit.Keywords
This publication has 8 references indexed in Scilit:
- Efficient algorithms for computing the longest viable path in a combinational networkPublished by Association for Computing Machinery (ACM) ,1989
- Multi-level logic minimization using implicit don't caresIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- Dynamic logic CMOS circuitsIEEE Journal of Solid-State Circuits, 1984
- Cascode voltage switch logic: A differential CMOS logic familyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- NORA: a racefree dynamic CMOS technique for pipelined logic structuresIEEE Journal of Solid-State Circuits, 1983
- High-speed compact circuits with CMOSIEEE Journal of Solid-State Circuits, 1982
- Procedures for Eliminating Static and Dynamic Hazards in Test GenerationIEEE Transactions on Computers, 1974
- Hazard Detection in Combinational and Sequential Switching CircuitsIBM Journal of Research and Development, 1965