Q. 6.24: Design a counter with T flip‐flops that goes through the following binary repeated sequence
HTML-код
- Опубликовано: 2 июл 2024
- Q. 6.24: Design a counter with T flip‐flops that goes through the following binary repeated se- quence: 0, 1, 3, 7, 6, 4. Show that when binary states 010 and 101 are considered as don’t care conditions, the counter may not operate properly. Find a way to correct the design.
Please Like, Share, and subscribe to my channel.
For a paid solution, you can contact me on dhiman.kakati@gmail.com
-----------------------------------------------------------------------------------------------------
You can follow me on ----
Facebook: / dhiman.kakati
Twitter: / dhiman_kakati
Instagram: dhiman_kaka...
Researchgate: www.researchgate.net/profile/...
Facebook Page: / lets-prepare-for-gate-...
Problem solutions of the book Digital Design by Morris Mano and Michael Ciletti: • Q. 6.1: Include a 2‐in...
Online Store:
-----------------------------------------------------------------------------------------------------
Wish you success,
Dhiman Kakati
(let's learn together)
Thanx you are MASTER!!!
thank you for actually saving my butt. I needed to solve one of those for a client and I had never solved one before. Don't ask me how I passed that course and with 9/10. I don't know either.
Sir you are doing amzing :)
Thanks Dr.
Thank you so much
thanks for ur greate effort
but there is a mistak
ac+a'c' = (a ⊕c )' --->xnor
not equal (a ⊕c ) ---->xor
This is amazing!
after knowing Ta=1,Tb=1,Tc=1 for unused states why we complenting the PS when converted to NS values sir.
👍
Sir i have one question
I have doubt sir
Instead of finding new Ta,Tb and Tc....
Can we just use clear when the state is 2 and 5?
What if I got some digit twice in the sequence?
Hey, if you've got the solution can you put a link here.
@@vamship8251 no.I couldn’t solve that issue.
anyone from EE2 TIET'25 like this comment. Don't be shy