Algorithms for synthesis of hazard-free asynchronous circuits
- 1 January 1991
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 302-308
- https://doi.org/10.1145/127601.127685
Abstract
A technique for the synthesis of asynchronous sequentialcircuits from a Signal Transition Graph (STG) specificationis described. We give algorithms for synthesisand hazard removal, able to produce hazard-free circuitswith the bounded wire-delay model, requiring theSTG to be live, safe and to have the unique state codingproperty. A proof that, contrary to previous beliefs,STG persistency is not necessary for hazard-free implementationis given.1 IntroductionAsynchronous design is...Keywords
This publication has 0 references indexed in Scilit: