The best lectures that no one can ever find on the RUclips. Thank you for all your effort in making videos and making everyone's life easier. Thank you behalf of every benefited student.
I was finding about state reduction at google, but there were not much information. But by this video I could learn it in simple way. Thank you for good lecture!!
You are really AMAZING ! I will watch the rest of the videos ! I got a bad grade last midterm! have to be ready for the finals! Hope you would be of great help ^_^
The whole point of state assignment is to reduce the gate cost to run your state machine, assigning them by just plain binary coding is the most inefficient way to do so. It does not result in the minimum gate cost.
note that this method of state reduction don't gives the best known reduction in general. example: the following state machine can be further reducted to 2 state x=0 x=1 a c/0 b/0 b b/1 a/1 c a/0 b/0
Really nice video but I want to implement the above state diagram , state table written but what about means the states (101(x=0), 101(x=1),111(x=0),111(x=01) )? while solving kmaps for jk flipflops(i want to implement with jk ff).. I have to take above not mentioned states as dont cares and perform kmap right?
Actually if i have got 3 flip flops for example,is it guaranteed that a is the first( q1=0,q2=0,q3=0) ,b is the second etc? Namely,hasn't it be clear if the way i symbolize the states is sorted,and if it sorted,the sorting criteria should be mentionted or i could work assuming?
Sir, In this circuit you are considering the next state and output. If they are matched you are doing reduction but if I have a circuit where there is no output, only P.S, N.S and flipflop. Which are the things that I should consider while doing state reduction then? Please let me know this. Thank you
+sadia afrin To the extent of computer engineer's knowledge, i have been taught you do matching in b/w state jump to corresponding input and if alike process is similar, I prefer you should had to watch another video to your right which explains this concept.
Thank-you this is really helpful.I've one query, can you pl upload video explaining how to draw a sequence detector for detecting two sequences simultaneously.
after F removing we can write D=F . and we subsuits in another one like (c at x=0(a) x=1(d=f)) and the C equals to E then we can elemanate E SIR WE CAN DO THIS LIKE
Since the rows of f and d are similar we eliminate f but then why are we not replacing d=f in the row c because if we do so then the rows of a and e become similar and we can eliminate e, thus reducing the state further. Please do respond.
Sir can u plz explain ,how did u draw the state diagram from state assignment simply without using state table and are the values of table taken randomly or some ff is used here?
I have a question - what if the next state is the same, but the outputs are different? In your example, state e = g as they have the same next states (a and f) and the same outputs (0 and 1) - what if the next states were the same (a and f), but the outputs were different (1 1)? Thanks for the video btw
if their is a question that detect 4 or more consective 1s reduce state and draw the circvuit diagram .MY question is this can i make combinitonal circuit and FF to buld wholwe this circut whicjh is dectctiing 4 or more consective ones for that i also need a TT how can i make that which should also be generic ??
because if you see the replacing d with f will have no effect in the reduction process as outputs are different after replacement so the replacement is redundant.
@@anrk97 bro.... In present state C.. The nxt state is a and f. Since f =d now the nxt state becomes a and d. It is same as E (present state) why we didn't eliminate it....
sir when we are at s2 and i/p is 1 then we move to s0 state .explain in detail (u have given the explanation by takiing example of s1. i didn't get the properly explanation even after watching the video again and again)
The best lectures that no one can ever find on the RUclips. Thank you for all your effort in making videos and making everyone's life easier. Thank you behalf of every benefited student.
the best teaching in the world for students
we have learned more things from Neso academy
those 80 dislikes are from medical students.
Soo funny ha ha ha
Mf len kha mera.
🤣🤣
Your comment completed it's work after 2 year 🤣
Accha...
Where 😢now I can't see
Oh update Problem
Thanks Neso for this lecture. I like that you explain everything before doing it. Keep it up bro!
Best series on digital electronics with amazing explanation
I was finding about state reduction at google, but there were not much information. But by this video I could learn it in simple way. Thank you for good lecture!!
Thank you! I prefer this method a lot more than the excitation table!
Best series on digital electronics with amazing explanation 🔥🔥
Best teaching sir loved ur channel gonna promote Ur channel too much as I wanna spread Ur knowledge with everyone
Thankyou sir hats off....
Nyc explanation.. Thanks :)
salute to you for explaining electronics in such a good way . Thanks a lot sir .
NESO Academy is just the best. Thanks a lot.
Very good explanation ❤️
D and f are equal right?
By replacing d with f we can eliminate one from b and e rows
we can eliminate c and e right is that output matters for both?
output not same
Awesome video, My state reduction and assignment is totally clear..Thanks
Thank you so much. I enjoy watching your videos, they are extremely helpful.
Best explanation 🙌
You are saving me from my digital signal processing paper every time!!!
You are very clear and explained well enough. Thanks sir
Can you please provide pdf of your notes of switching theory and combinational logic circuits.
Love the lecture, thanks a lot Sir.
Simply superb sir your teaching skills extraordinary and the best teaching institute I never seen
You are really AMAZING !
I will watch the rest of the videos !
I got a bad grade last midterm! have to be ready for the finals!
Hope you would be of great help ^_^
did you make it bro?
Perfect. Game changer like always.
The whole point of state assignment is to reduce the gate cost to run your state machine, assigning them by just plain binary coding is the most inefficient way to do so. It does not result in the minimum gate cost.
The best....thank you sir🙂
1 hour before XM, life saver
Thank You Soo Much Sir. explanation is quite easy to understand and it helped me alot. ☺
Super explanation
u are king in teachin man keep.it up
sir it was a superb video i never saw before any ware tq u helped me a lot
Can't state e also be reduced as it is the same as state c?
The outputs r not same so no
thanks it is veaslly explained .................thanks sir thanks nesoaccadamy
Thanx for everything..very well explained
note that this method of state reduction don't gives the best known reduction in general.
example: the following state machine can be further reducted to 2 state
x=0 x=1
a c/0 b/0
b b/1 a/1
c a/0 b/0
very nice explanation
to the point..
Really nice video but I want to implement the above state diagram , state table written but what about means the states (101(x=0), 101(x=1),111(x=0),111(x=01) )? while solving kmaps for jk flipflops(i want to implement with jk ff).. I have to take above not mentioned states as dont cares and perform kmap right?
good morning sir thank you very much for kindly teaching me this topic, very helpful
brilliant lecturer
Clear concept videos, Thank you, !!!
Turned 75 minutes college lecture lecture into 7 minutes. Thanks you for this sir xD!
awesome explanation thank u
Thank you so much !
Actually if i have got 3 flip flops for example,is it guaranteed that a is the first( q1=0,q2=0,q3=0) ,b is the second etc?
Namely,hasn't it be clear if the way i symbolize the states is sorted,and if it sorted,the sorting criteria should be mentionted or i could work assuming?
good explanation but can you tell me how to Assign the state assignment based on binary, gray code and one hot method ?
Thank you.
literally nobody:
neso academy:i will rubber for rubbing..
thank you for making us understand soo easily
Sir, In this circuit you are considering the next state and output. If they are matched you are doing reduction but if I have a circuit where there is no output, only P.S, N.S and flipflop. Which are the things that I should consider while doing state reduction then? Please let me know this.
Thank you
+sadia afrin To the extent of computer engineer's knowledge, i have been taught you do matching in b/w state jump to corresponding input and if alike process is similar, I prefer you should had to watch another video to your right which explains this concept.
Thank-you this is really helpful.I've one query, can you pl upload video explaining how to draw a sequence detector for detecting two sequences simultaneously.
after F removing we can write D=F . and we subsuits in another one like (c at x=0(a) x=1(d=f)) and the C equals to E then we can elemanate E SIR WE CAN DO THIS LIKE
I love your teaching method sir....can u tell me something about yourself? :D
sir i think this table can be reduced further more to very few states , so you need to review this question again. thankyou
Very useful. Thanks.
Thank you very much sir
gardaşım allah razı olsun!
Awsmmm lecture
Since the rows of f and d are similar we eliminate f but then why are we not replacing d=f in the row c because if we do so then the rows of a and e become similar and we can eliminate e, thus reducing the state further. Please do respond.
Thank you a lot
Sir also upload the vedio of control system .yours lectures are very helpful.
When d = f, we have 1 more variable in common which is " c and e " isn't it?
Thanks Sir!
Yes.. I too had the same ambiguity
@@sumanabhat9669 but in c and e output is not same only present state is same so we can't reduce it
@@abhinavyadav2255 Thanks bro !!
Please add link to the playlist in the description
Sir can u plz explain ,how did u draw the state diagram from state assignment simply without using state table and are the values of table taken randomly or some ff is used here?
Thank you sir
I have a question - what if the next state is the same, but the outputs are different? In your example, state e = g as they have the same next states (a and f) and the same outputs (0 and 1) - what if the next states were the same (a and f), but the outputs were different (1 1)?
Thanks for the video btw
The resason I think is because that there is 3 digits, u cannot have less than 5 factors.
Thank you sir..!!
sir u mentioned that u have state assignment in detail..did u upload it or u saying in the future? we really need it sir.
thanks a lot for the video :D
Sir do a video lecture for asynchronous sequential circuits ,State tree , primitive flow table and flow table
Can you please do an example on state reduction using stairs method?
does this method have a particular name ?, i am supposed to use use implication chart or partitioning method to reduce
What if I am needed to implement a Pattern Detector that detects multiple patterns like 0010 and 0011 and 0100. Is there an example of that ?
Thanks a lot!
Well explained add more examples please
Please tell me how to draw the sequential circuit for the question you have used after making the state diagram
At last c and a States are also the same while f=d. Can't we reduce it?
thanks a lot sir
Thank you
if their is a question that detect 4 or more consective 1s reduce state and draw the circvuit diagram .MY question is this can i make combinitonal circuit and FF to buld wholwe this circut whicjh is dectctiing 4 or more consective ones for that i also need a TT how can i make that which should also be generic ??
when g was eliminated we replaced e with g but when f was replaced why didn't you write f in place of d?
Thats what i thought.
because if you see the replacing d with f will have no effect in the reduction process as outputs are different after replacement so the replacement is redundant.
@@anrk97 thnx broo
@@anrk97 bro.... In present state C.. The nxt state is a and f. Since f =d now the nxt state becomes a and d. It is same as E (present state) why we didn't eliminate it....
@@dineshnarasimmanm4889 condition is both next state and output should be same.. Output is not same for your case..
just awesome !!!!!!!!!!!!!!!!!!!!
Thanku so much Sir
sir,what will be the next state for the unused state?
for example 101 next state is?
Have you uploaded minimization of completely and incompletely specified sequential machine?
No
Very Good, thx
sir when we are at s2 and i/p is 1 then we move to s0 state .explain in detail (u have given the explanation by takiing example of s1. i didn't get the properly explanation even after watching the video again and again)
I think C and E can be further reduce coz both C and E have same Next State......correct me if i'm wrong
Can we right f=d then reduce present state e beacuse e and c is equal ???
I think B and C can also be equal because both of it is directed towards D.. can u please check out?
But the outputs r different
some more detail abt assignment
sir we can again reduce because d=f then 3rd row again reduce
sir is this is the One Hot encoding technique ?
Very helpful thx
what app and hardware you use to do such video?
And what is Race free state assignment?
Can you please explain.
Sir if d=f then why c and e are not eliminated (see state table sir)
Output not same
sir this video is not present in the digital electronics playlist
How do we do a three way merger?
i have a doubt!
As d=f and therefore c and e are equal we can eliminate e........
my doubt is how to get that table p.s&n.s once explain please
awesome and helpful
Sir please explain how we can draw from c to g in this example with any output