1 / 16

Hazards in Combinational Networks: Understanding Timing and Glitches

Learn about the time behavior of combinational networks, waveforms, and hazards. Discover how to eliminate static and dynamic hazards and ensure glitch-free circuit operation.

ashleyj
Download Presentation

Hazards in Combinational Networks: Understanding Timing and Glitches

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Overview • Last Lecture • Conversion of two-level logic to NAND or NOR forms • Multilevel logic • AOI and OAI gates • Today • Timing and hazards • Multiplexers and demultiplexers CSE 370 – Winter 2002 - Hazards - 1

  2. Time behavior of combinational networks • Waveforms • visualization of values carried on signal wires over time • useful in explaining sequences of events (changes in value) • Simulation tools are used to create these waveforms • input to the simulator includes gates and their connections • input stimulus, that is, input signal waveforms • Some terms • gate delay — time for change at input to cause change at output • min delay – typical/nominal delay – max delay • careful designers design for the worst case • rise time — time for output to transition from low to high voltage • fall time — time for output to transition from high to low voltage • pulse width — time that an output stays high or stays low between changes CSE 370 – Winter 2002 - Hazards - 2

  3. A B C D F Momentary changes in outputs • Can be useful — pulse shaping circuits • Can be a problem — incorrect circuit operation (glitches/hazards) • Example: pulse shaping circuit • A' • A = 0 • delays matter in function D remains high for three gate delays after A changes from low to high F is not always 0 pulse 3 gate-delays wide CSE 370 – Winter 2002 - Hazards - 3

  4. + resistor A B open switch C D Oscillatory behavior • Another pulse shaping circuit • NOT combinational logic! • switch is close: steady state • switch is open: oscillation close switch initially undefined open switch CSE 370 – Winter 2002 - Hazards - 4

  5. Hazards/glitches • Hazards/glitches: unwanted switching at the outputs • occur when different paths through circuit have different propagation delays • as in pulse shaping circuits we just analyzed • dangerous if logic causes an action while output is unstable • may need to guarantee absence of glitches • Usual solutions • 1) wait until signals are stable (by using a clock) preferable (easiest to design when there is a clock – synchronous design) • 2) design hazard-free circuits sometimes necessary (clock not used – asynchronous design) CSE 370 – Winter 2002 - Hazards - 5

  6. 1 1 0 1 0 0 1 1 0 0 1 1 0 0 Types of hazards • Static 1-hazard • input change causes output to go from 1 to 0 to 1 • Static 0-hazard • input change causes output to go from 0 to 1 to 0 • Dynamic hazards • input change causes a double changefrom 0 to 1 to 0 to 1 OR from 1 to 0 to 1 to 0 CSE 370 – Winter 2002 - Hazards - 6

  7. A S B S' Static hazards • Due to a literal and its complement momentarily taking on the same value • through different paths with different delays and reconverging • May cause an output that should have stayed at the same value to momentarily take on the wrong value • Example: A B F S S' F hazard static-0 hazard static-1 hazard CSE 370 – Winter 2002 - Hazards - 7

  8. A F 3 2 B 1 C Dynamic hazards • Due to the same versions of a literal taking on opposite values • through different paths with different delays and reconverging • May cause an output that was to change value to change 3 times instead of once (outside scope of this course) • Example: (assume B1 changes before B2 and B2 before B3) A C B1 B2 B3 F hazard dynamic hazards CSE 370 – Winter 2002 - Hazards - 8

  9. Eliminating static hazards (an overview) • In 2-level logic assuming single-bit changes • Basic idea: a static hazard happens when a changing input spans multiple prime implicants • Example: 1101 change to 0101 can cause a static-1 hazard AB F = AC’ + A’D 00 01 11 10 CD 00 01 10 11 A 0 0 1 1 C’ 1 1 1 1 F A’ 1 1 0 0 D 0 0 0 0 CSE 370 – Winter 2002 - Hazards - 9

  10. Eliminating static hazards (ct’d) • Solution: Add redundant prime implicants • Ensure that all single bit changes (adjacent 1’s) are covered by an implicant • To eliminate static-1 hazard, use SOP form • To eliminate static-0 hazard, use POS form AB F = AC’ + A’D +C’D 00 01 11 10 CD 00 01 10 11 A 0 0 1 1 C’ 1 1 1 1 A’ 1 1 0 0 F D 0 0 0 0 C’ D CSE 370 – Winter 2002 - Hazards - 10

  11. Eliminating hazards (ct’d) • We can eliminate static hazards in 2-level logic for: • Single-bit changes (side benefit: eliminates some dynamic hazards) • But, more generally, eliminating hazards is difficult • Multiple-bit changes in 2-level logic are hard • Static hazards in multilevel logic are harder • Dynamic hazards in multiple logic are harder yet • CAD tools and simulation/testing are indispensable • Test vectors probe a design for hazards CSE 370 – Winter 2002 - Hazards - 11

  12. Making connections • Direct point-to-point connections between gates • wires we've seen so far • Route one of many inputs to a single output --- multiplexer • Route a single input to one of many outputs --- demultiplexer control control multiplexer demultiplexer CSE 370 – Winter 2002 - Hazards - 12

  13. Mux and demux • Uses of multiplexers/demultiplexers in multi-point connections A0 A1 B0 B1 Sa Sb multiple input sources MUX MUX A B Sum multiple output destinations Ss DEMUX S0 S1 CSE 370 – Winter 2002 - Hazards - 13

  14. I1 I0 A Z0 0 0 00 0 1 00 1 0 10 1 1 01 0 0 01 0 1 11 1 0 11 1 1 1I1 I0 A Z0 0 0 00 0 1 00 1 0 10 1 1 01 0 0 01 0 1 11 1 0 11 1 1 1 A Z0 I01 I1 Multiplexers (aka selectors) • Multiplexers/selectors: general concept • 2n data inputs, n control inputs (called "selects"), 1 output • used to connect 2n points to a single point • control signal pattern forms binary index of input connected to output Z = A' I0 + A I1 A is control I0 , I1 are input Z is output functional form logical form two alternative forms for a 2:1 Mux truth table CSE 370 – Winter 2002 - Hazards - 14

  15. I0I1I2I3I4I5I6I7 8:1mux Z I0I1I2I3 4:1mux Z I0I1 2:1mux Z A A B A B C Multiplexers/selectors (cont'd) • 2:1 mux: Z = A' I0 + A I1 • 4:1 mux: Z = A' B' I0 + A' B I1 + A B' I2 + A B I3 • 8:1 mux: Z = A' B' C' I0 + A' B' C I1 + A' B C' I2 + A' B C I3 + A B' C' I4 + A B' C I5 + A B C' I6 + A B C I7 • In general, Z =  (mkIk) • in minterm shorthand form for a 2n:1 Mux n 2 -1 k=0 CSE 370 – Winter 2002 - Hazards - 15

  16. Gate level implementation of muxes • 2:1 mux • 4:1 mux CSE 370 – Winter 2002 - Hazards - 16

More Related