The present paper considers the problem of digital hazards that are present in combinatorial logic structures. My work is focused not on eliminating these hazards but on how to avoid and eventually use this unwanted feature when we are designing a digital automaton. The idea is to theoretically trace the output of the circuit implementing the next state functions of the automaton, determine the time frames when these outputs are logically correct and use those specific moments of time to provoke the automaton's evolution towards the next correct state (according to the automaton's states transitions graph). By doing so we shall drastically improve the working speed of the automaton we design
Published in:
Electrical and Computer Engineering, 2006. CCECE '06. Canadian Conference on
Date of Conference: May 2006