This preview shows page 1. Sign up to view the full content.
Unformatted text preview: initial and final values respectively. Check table for all transitions and make sure no outputs will produce a glitch Hazard-proofing: redundant logic gates independent of a variable that will be changing during a transition. Make sure EVERY 2 adjacent 1’s are in the same group after minimizing table You don’t always have to chose EVERY prime implicant to ensure no static hazards Only required for every pair of adjacent 1s, not don’t care or 1s and don’t cares Y+=S+R’y Y1+=y1y2’+xy2’+x’y1 =xy2’+y1(y2’+x’) S1 R1’ Y2+=x’y1+xy2+y1y2 = x’y1+y2(x+y1) S2 R2’ S1 = xy2’ R1 = xy2 S2 = x’y1 R2 = x’y1’ Prone to essential hazards if for input x if 3 changes in x results in a different final state than 1 change in x...
View Full Document
This note was uploaded on 05/23/2008 for the course ECE 3504 taught by Professor Jsthweatt during the Summer '06 term at Virginia Tech.
- Summer '06