TAMS / Java / Hades / applets: contents | previous | next | ||||
Hades Applets contents visual index introduction std_logic_1164 gatelevel circuits delay models gate vs. wir... gate delay d... ring oscillator hazards NAND-chain D-flipflop h... clock-doubler 2-phase cloc... flipflops adders and arithm... counters LFSR and selftest memories programmable logic state-machine editor misc. demos I/O and displays DCF-77 clock relays (switch-le... CMOS circuits (sw... RTLIB logic RTLIB registers Prima processor D*CORE MicroJava Pic16 cosimulation Mips R3000 cosimu... Intel MCS4 (i4004) image processing ... [Sch04] Codeumsetzer [Sch04] Addierer [Sch04] Flipflops [Sch04] Schaltwerke [Sch04] RALU, Min... [Fer05] State-Mac... [Fer05] PIC16F84/... [Fer05] Miscellan... [Fer05] Femtojava FreeTTS | NAND-chain hazards demo Circuit Description This circuit demonstrates that even a very simple circuit with a only a few gates can create a lot of hazards. Again, the gate delay of the individual gates is set to a very large value (0.5 seconds), in order to provide immediate visual feedback about the circuit operation. Just toggle the input value and watch the behaviour. When the input line is switched to a zero value, all NAND gates generate a 1 output value (after one gate delay). As soon as the input line is switched to a high value, all gates see the logical 1 on their upper input from their predecessor, and the logical 1 from the input line. Therefore, all gates generate a logical 0 after one gate delay. Only the first NAND gate is now stable, while the remaining gates now have one input at zero, which implies that those gates switch back to one. This process repeats until the circuit finally stabilizes. Note that circuit structures like this should be avoided even if the rest of the system is designed to tolerate the hazards, because the high amount of switching also implies a lot of power consumption - at least for CMOS technology. In fact, the most advanced logic synthesis systems include the option to prefer low power consumption over low number of gates. Challenge: Design a circuit that creates the maximum number of hazards per number of gates :-) | |||
Print version | Run this demo in the Hades editor (via Java WebStart) | ||||
Usage | FAQ | About | License | Feedback | Tutorial (PDF) | Referenzkarte (PDF, in German) | ||||
Impressum | http://tams.informatik.uni-hamburg.de/applets/hades/webdemos/12-gatedelay/30-hazards/nandchain.html |