Final Lect 2
Final Lect 2
Toggle Toggle
Toggle
Toggle
Toggle Toggle
3-Bit Binary Asynchronous Counter
4-Bit Binary Asynchronous Counter
MOD Counters
• A counter with N flip-flops can count to 2N sequences.
• The modulus of a counter in number of unique sequence that a counter can count
through.
• The MOD counters do not complete the entire count sequence.
• These type of sequence is called truncated sequence.
• An example of such counter can be MOD-11 counter.
• A MOD-11 counter has 4 flip-flops (as we require 4-bits to count up to 11)
• With 4 flip-flops the complete count sequence is 16 (0 to 15).
• However, a MOD-11 counter will have only 11 sequences (0 to 10).
• Thus we need to figure out a way to reset the flip-flop when the counter reaches the 12th
sequence (no. 11).
• This is where the asynchronous clear input becomes very handy.
• So we can decode the 12th state to reset the counter.
Asynchronous Decade Counter (MOD-10)
• The most popular MOD counter is the Decade Counter.
• Counters with 10 sequences are called Decade Counters.
• It can count 10 sequence that is 0 to 9.
• Thus it is also called a BCD counter. BCD = Binary Coded Decimal
• It has a wide range of application from displays to digital
watches.
• The counter counts from 0000 to 1001.
• Then when counter reach 1010 the counter resets.
• So the state 1010 is decoded to reset the counter.
Toggle Toggle
3-Bit Synchronous Counter
4-Bit Synchronous Counter
Synchronous BCD Decade Counter
Why do we need
𝑸𝟑 ??
Why do we need
Synchronous BCD Decade Counter
Up-Down Synchronous Counter
• An up/down counter is one that is capable of progressing in either direction through a
certain sequence.
• It is also called a bi-directional counter.
• In general most up/down can be reversed at any point in their sequence
Up-Down Synchronous Counter
Up-Down Synchronous Counter
Irregular Sequence Counter
To design an irregular sequence counter we need to first understand the concept of state
machines. A state machine is a sequential circuit having a finite number of states occurring
in prescribed order. There are generally two types of state machines, namely, Moore State
Machine and Mealy State Machines.
STEP 1 STEP 2
Irregular Sequence Counter (Gray Code Counter) Design
STEP 3
Once the table is populated, considering present state as output K-Map for J and K for the
three flip-flops are filled and the logic requirements are found.
Irregular Sequence Counter (Gray Code Counter) Design
STEP 4
Irregular Sequence Counter (Gray Code Counter) Design
State Diagram
Irregular Sequence Counter Design
Irregular Sequence Counter Design
Logic Requirements for the inputs J and K: