TAMS / Java / Hades / applets: contents | previous | next | ||||
Hades Applets contents visual index introduction std_logic_1164 gatelevel circuits delay models flipflops adders and arithm... counters asynchronous... asynchronous... frequency di... synchronous ... synchronous ... up/down counter asynchrounou... 749x counters 7493 1:16 co... 7490 1:10 co... 7492 1:12 co... 74590 counter 74390 decima... frequency co... pulse-generator digital clock digital clock 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 | Frequency Divider (D flipflops)
Circuit Description
This circuit implements an asynchronous 8-bit counter using D-flipflops.
Each stage of the counter consists of a standard D-flipflop, with the data-input driven by the negated output of the flipflop. Therefore, the flipflop changes its state ('toggles') on each rising-edge of the flipflop clock input. A few textbooks introduce a special flipflop type for this, called toggle-flipflop or TFF. The data output of stage n generates the clock input for stage n+1. Therefore, the individual stages of the counter do not change state at the same time, but rather one-after-another. Obviously, an asynchronous counter is very cheap - no extra gates are required beyond the flipflops. Also, an asynchronous counter is very fast, because no dependencies between the stages exist. However, when using asynchronous counters as a part of a larger synchronous (clocked) system, great care must be taken to ensure that the counter value is stable before reading and using it.One important application of asynchronous counters is as a frequency divider, where only the last output of the counter cascade is used - usually, as the clock input to the following block of logic. Therefore, the asynchronous nature of the counter is not critical, as the individual outputs of the intermediate stages are not used at all. | |||
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/30-counters/20-async/counter-dff.html |