Controlling the count time in Counter logic circuit

Thread Starter

SoftwareUns

Joined Jun 26, 2023
6
I need to design a circuit with D Flip-Flops which counts 1-6-0-5 for 3 times and 2-3-7-4 for 2 times. Can anyone help? I've never seen any example like this one . I tried Module counter but couldn't control the 3 times and 2 times. How can I solve it?
 

LowQCab

Joined Nov 6, 2012
5,101
The first thing to do is to describe what this Counter is supposed to do.
The next thing is to provide us with a Schematic-Diagram so
that we can see how You are attempting to accomplish this end result.
( there may be other solutions )
.
.
.
 

MrChips

Joined Oct 2, 2009
34,630
Is this an exercise in designing an FSM (Finite-State Machine)?
If it is, then the approach is to write out a table of all possible states. If you don't know how to do this we can assist you.
 

Thread Starter

SoftwareUns

Joined Jun 26, 2023
6
Is this an exercise in designing an FSM (Finite-State Machine)?
If it is, then the approach is to write out a table of all possible states. If you don't know how to do this we can assist you.
Actually I don't know, the question was just the exam question of the past years. I'm writing down the whole question :
The MN flip flop truth table is given. If the control variable X, including ABC flip-flop names and outputs, is 0 (X=0), then 4-5-6-0-4-5-... ; If the control variable X is 1 (X=1), then 1-2-3-7-1-2-... if the state changes in the form and decimal AB <= 1 (binary, AB <= 01), the output variable Y is Y=0, if not Y=1
design a sequential logic circuit that takes value as. When the X switch changes state, the counting process should start from the initial value of the corresponding series. In the table, Q' shows the inverse of Q.

Question = Design a circuit that moves 4-5-6-0 for 2 times; 1-2-3-7 for 3 times. The truth table is here :
 

Attachments

Last edited:

MrChips

Joined Oct 2, 2009
34,630
You will have to write out the total sequence:

4-5-6-0-4-5-6-0-1-2-3-7-1-2-3-7-1-2-3-7

Hence, in total there are twenty unique states. You will need, at minimum, a 5-bit counter.
 

Thread Starter

SoftwareUns

Joined Jun 26, 2023
6
You will have to write out the total sequence:

4-5-6-0-4-5-6-0-1-2-3-7-1-2-3-7-1-2-3-7

Hence, in total there are twenty unique states. You will need, at minimum, a 5-bit counter.
I mustn't use 5-bit counter. There should be any other control. that's what they want in the question :(
 
Top