This is part of the "counter and register notes" web pages, which contain the
following subtopics:
- Ripple counter <-- you are here
- Synchronous counter
- Synchronous counter with reset
- Very simple register (parallel load)
- Very simple shift register (serial load)
- Designing a circuit which can shift or load
- More realistic shift register with parallel load
Ripple counter
Problem:
Since each JKFF is clocked to the previous, the ith bit only starts
flipping after the (i-1)th bit finishes flipping.
In a wide counter (e.g. 32 or 64 bits), this means we can't run it very fast;
we have to allow sufficient time for all the signals to propagate.
This goes against our modern trends of trying to build
computers which are simultaneously faster and have a larger word-size.
The solution to this problem is called a
"synchronous counter" (synchronous meaning "all
at the same time"), shown next.
This is part of the "counter and register notes" web pages, which contain the
following subtopics:
- Ripple counter <-- you are here
- Synchronous counter
- Synchronous counter with reset
- Very simple register (parallel load)
- Very simple shift register (serial load)
- Designing a circuit which can shift or load
- More realistic shift register with parallel load
[list of course notes topics available]
[main course page]