I would make a 0 - 255 counter and transform the output as needed. (See later videos in the playlist for output logic.) For a mod-256 counter you need log base 2 of 256 = 8 flip-flops.
This can actually simplify to an XOR. If we have Q2*(~Q1+~Q0) + ~Q2*Q1*Q0, we can use De Morgan's Law to rewrite (~Q1+~Q0) as ~(Q1*Q0) We now have Q2*~(Q1*Q0) + ~Q2*(Q1*Q0). Take Q1*Q0 together, so we can now end up with Q2 XOR (Q1*Q0).
great job
thank you! your handwriting looks like comic sans. :)
Thank you
I have to ask, what or where is the truth table, can you send me a picture please?
How would you go about making a counter that needs to count between -127 to 128 with D flip flops?
I would make a 0 - 255 counter and transform the output as needed. (See later videos in the playlist for output logic.) For a mod-256 counter you need log base 2 of 256 = 8 flip-flops.
thank you
What does the D2 equation simplify to?
This can actually simplify to an XOR.
If we have Q2*(~Q1+~Q0) + ~Q2*Q1*Q0, we can use De Morgan's Law to rewrite (~Q1+~Q0) as ~(Q1*Q0)
We now have Q2*~(Q1*Q0) + ~Q2*(Q1*Q0). Take Q1*Q0 together, so we can now end up with Q2 XOR (Q1*Q0).
Timing diagram
GOOD VIDEO
Hey Dear its my first time that i dont skip that video for a minute . Well Explained.Thanks