9-0 down counter using d flip flop

Max Kreeger

Joined Oct 1, 2013
95
An actual circuit? Or just design the logic gates? How many bits? Are you going to implement the design on a board? - Going to need a little bit more info chief haha.
 

Thread Starter

annbarbie01

Joined Oct 1, 2013
12
is my truth table correct?


DCBA DCBA(next state)
1111 xxxx
1110
1101
1100
1011
1010 xxxx
1001 1000
1000 0111
0111 ...
0110
0101
0100
0011
0010
0001 ...
0000 1001
 
Last edited:

MrChips

Joined Oct 2, 2009
30,823
No.

In the left column, list all possible states, 0000 - 1111, in order.
In the right column, list the state that follows from the current state (in left column).
If the current state does not exist, put XXXX in the right side column.

DCBA DCBA(next state)
0000
0001
0010
0011
0100
0101
0110
0111
1000
1001
1010
1011
1100
1101
1110
1111
 

Thread Starter

annbarbie01

Joined Oct 1, 2013
12
I'm sorry, I thought it should be like that since i'm counting down. XD

Sir, I've done it already and also the kmap. this is what i've got.
for A: D'
for B: CD' + A'C'D
for C: BC' + BD' + B'CD
for D: AD' + BCD


is it correct? how am i going to implement it on the d flip flop? thank you so much.
 

MrChips

Joined Oct 2, 2009
30,823
It does not matter what order you create the truth table. The order can be totally random, so long as you include all of the states, used or not used.

It is simply straight forward to go from 0 to 15 so that you do not miss a state.

My results of the Karnaugh maps do not match your expressions you have shown.
 

Thread Starter

annbarbie01

Joined Oct 1, 2013
12
then here's my truth table..

DCBA DCBA(next state)
0000 0001
0001 0010
0010 0011
0011 0100
0100 0101
0101 0110
0110 0111
0111 1000
1000 1001
1001 0000
1010 xxxx
1011 xxxx
1100 xxxx
1101 xxxx
1110 xxxx
1111 xxxx

i did kmap again and still arrived at the same results.
 

WBahn

Joined Mar 31, 2012
30,076
ahh.. i get it. sorry.

A: D
B: C'D' + A'D + B'CD
C: B'D' + A'D + B'C'D
D: A'D' + ABCD


is it correct? thanks again.
In general, we need to see HOW you arrived at a result and not just the result you arrived at. Our goal is to help you understand how to solve a problem, not just confirm or deny that your result is correct.

One of the nice things about most engineering disciplines is that you can verify the validity of a result from the result itself. You don't need to (and need to learn not to) rely on others to tell you if you are correct or not.

So take your solution and then analyze the behavior of the circuit that results. If it matches the behavior that you want, then it is correct. Otherwise, it ain't.

QD|QC|QB|QA||DD|DC|DB|DA||QD'|QC'|QB'|QA'|Description
0|0|0|0||1|1|1|0||1|1|1|0|0 => 12

Already we can see that the equations you came up with will NOT result in the behavior you want.

So how about showing the K-map for one of the stages, say the first one or the last one, so that we can see how you arrived at the equation you did?
 

WBahn

Joined Mar 31, 2012
30,076
i didn't get the table, sorry.
If you are referring to the table in my last post, then it is nothing more than the start of a state transistion table.

I chose (0000) as the starting state for the four Q outputs.
I then used your proposed equations to find the values of the four D inputs.
I then applied the inputs to find the next set of four Q outputs.
I then noted the numeric values associated with this transistion.

Since you want 0->9 and not 0->12, there is a problem.
 
Top