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 | Synchronous counter (D flipflops)
Circuit Description
A 4-bit synchronous counter built from D-flipflops
with carry-input (count-enable) and carry-output.
In this circuit, the single clock signal is directly connected to
all flipflops, so that all flipflops change state at the same time.
Click the clock and nreset input switches or type the 'c' (clock),
'r' (reset), and 'x' (carry-in) bindkeys to operate the counter.
Obviously, this counter consists of four identical stages
with a D-type flipflop, an XOR-gate, and a two-input AND-gate each.
The XOR-gate in front of the D input of the flipflop
basically converts the D-type flipflop into a toggle (T-type) flipflop.
This is the same structure as the JK-flipflop with both J and K
tied to logical-1, as shown in the previous applet.
While the carry-logic shown in the previous applet required
an n-input AND gate for stage n,
the carry-chain used in this applet is based on two-input gates.
The difference in structure is similar to the carry-lookahead
and the ripple-carry adders shown in the previous chapter.
Obviously, the output of any AND gate is only high
when all lower stage AND gates (and the carry input) are also high.
In other words,
Dn = Qn XOR (Qn-1 AND Qn-2 AND ...
AND Q1 AND Q0 AND carry_in)
| |||
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/30-sync/sync-dff.html |