Today I was forced to play badminton by my neighbor. Noob!
It is 11.05 now. Have to complete notes atleast today. Hey! and IIITH is going to announce results this week. I do not know what will happen. Hope I qualify.
The branching method to minimize the cyclic K-maps is interesting. Bcoz if you want any one of the minimal expression you just chose one and carry on based on that. Whereas if you want to find the number of minimal expressions possible you have to draw the reduced prime implicant chart and then minimize your combinations which cover all the min/max terms.
The procedure if you re not aware is that:
Find the essential prime implicants
Remove the columns of minterms covered by them. If all are covered it is the unique minimal expression possible else, form the reduced prime implicant chart.
If any minterm is having less literals you give priority to that. Else you have liberty to chose any.
This method of prime implicant can be used till 4 variables to best or 5 to the max. More than that we have a tabular method of K-map minimization, which proves to be efficient.
It is 19.27 and completed an hr notes.
No comments:
Post a Comment