Engineering Hazard-free AND-OR circuits proof

  • Thread starter Thread starter Orikon
  • Start date Start date
  • Tags Tags
    Circuits Proof
AI Thread Summary
The discussion centers on proving that a two-level AND-OR circuit, representing the complete sum of a logic function, is always static hazard-free. The original poster expresses frustration in starting the proof and seeks assistance. Participants clarify the meaning of "hazard-free" in logic design, distinguishing it from metastability in flip-flop circuits. The conversation highlights the need for a deeper understanding of static hazards in combinational logic. Overall, the thread emphasizes the challenges in proving hazard-free conditions in logic circuits.
Orikon
Messages
12
Reaction score
0
I've been at this for a while now and I'm getting nowhere. The problem is to prove that a two level AND-OR (sum of products) circuit corresponding to the complete sum of a logic function is always hazard free (static hazard). I can't even figure out where to begin with this, any help would be appreciated :smile:
 
Physics news on Phys.org
What is meant by hazard free? I'm not familiar with that term in the context of logic design. Are you talking about metastability in flip-flop and latching circuits?
 
Back
Top