In: Computer Science
discuss which is better: Boolean algebra or K-map?
What are the limitations of Karnaugh Maps? Explain with an example.
k-map:
k-map stands for Karnaugh Map and it is used to minimize or simplifying the boolean algebra expression by using a graphical representation in which 'n' variables are represented in 2n cells.
The k-map is used in boolean algebra and it provides the best way to minimize the Boolean expression. The minimized boolean expression needs the minimum number of logic gates to form expression implementation. So, we can say that the k-map is better.
Limitations of k-map are given below:
For example:
The given boolean expression is:
F = A'BC' + A'BC + ABC' + ABC
The k-map of the above boolean expression is:
Now, we will make the grouping as given below:
The minimized Boolean expression is:
F = B