MOD 4 Synchronous Counter using D Flip-flop
Here you will see how to design a MOD-4 Synchronous Counter using D Flip-flop step by step.
MOD 4 Synchronous Counter using D Flip-flop
Step 1: Find the number of Flip-flops needed
The number of Flip-flops required can be determined by using the following equation:
M ≤ 2N
where, M is the MOD number and N is the number of required flip-flops.
Here, MOD number is equal to 4. i.e., M = 4
Therefore, 4 ≤ 2N
=> N = 2
Step 2: Write the excitation table of the flip-flop
Excitation table of D flip-flop is:
|
QN |
QN+1 |
D |
|
0 |
0 |
0 |
|
0 |
1 |
1 |
|
1 |
0 |
0 |
|
1 |
1 |
1 |
Step 3: Write the circuit state table by using excitation table
Circuit state table for designing MOD 4 Synchronous Counter using D Flip-flop would be
|
QA |
QB |
QA+1 |
QB+1 |
DA |
DB |
|
0 |
0 |
0 |
1 |
0 |
1 |
|
0 |
1 |
1 |
0 |
1 |
0 |
|
1 |
0 |
1 |
1 |
1 |
1 |
|
1 |
1 |
0 |
0 |
0 |
0 |
Step 4: Prepare K Map for each flip-flop input in terms of flip-flop outputs as the input variables
In this case inputs of the flip-flops are: DA & DB
K Map for DA :
K Map for DB :
Therefore, DB = QB/
Step 5: Draw the circuit using flip-flops and other gates correspond to the minimized expressions
Circuit for MOD 4 Synchronous Counter using D Flip-flop would be
In this way "MOD 4 Synchronous Counter using D Flip-flop" can be designed.
You may also like:
- REALIZATION OF BOOLEAN EXPRESSIONS AND LOGIC FUNCTIONS USING ONLY NOR GATES
- IMPLEMENTATION OF BOOLEAN EXPRESSION AND LOGIC FUNCTION USING ONLY NAND GATES
- Flip-flop Conversion – SR flip-flop to JK flip-flop
- Flip-flop Conversion – SR flip-flop to D flip-flop
- Flip-flop Conversion – JK flip-flop to D flip-flop
- Flip-flop Conversion – D flip-flop to SR flip-flop
- Flip-flop Conversion – JK flip-flop to SR flip-flop
- Flip-flop Conversion – JK flip-flop to T flip-flop
- Flip-flop Conversion – T flip-flop to D flip-flop
- Flip-flop Conversion – T flip-flop to SR flip-flop
- Flip flop Conversion – D flip-flop to T flip-flop
- Flip flop Conversion – SR flip-flop to T flip-flop
- Flip flop Conversion – T flip-flop to JK flip-flop
- Flip flop Conversion – D flip-flop to JK flip-flop
- 2-Input AND Gate using 2:1 Multiplexer - Basic Gates design using MUX
- 2-Input OR Gate using 2:1 Multiplexer - Basic Gates design using MUX
- 2-Input NAND Gate using 2:1 Multiplexer - Basic Gates design using MUX
- 2-Input NOR Gate using 2:1 Multiplexer - Basic Gates design using MUX
- 2-Input XOR Gate using 2:1 Multiplexer - Basic Gates design using MUX
- Implementation of Boolean Function using Multiplexer
Comments
Post a Comment