K-MAP SOLVER
Click on a row in the truth table to switch the value among 0 , 1, and X.
SOLUTION
F = B'D' + AD' + BCD
The calculator above gives the simplified function in sum of products form. If you are looking for the Product of Sums solution, please click here.
Karnaugh maps, also known as K-maps, are a graphical method used to simplify Boolean algebra expressions. They provide a systematic way to minimize Boolean functions and are particularly useful for simplifying expressions with up to five variables.
Karnaugh maps represent Boolean functions graphically in a tabular form. Each cell in the table corresponds to a unique combination of input variables.
The main technique used with Karnaugh maps is grouping adjacent cells with the value 1 to identify patterns that can be combined to simplify the expression.
Karnaugh maps are widely used in digital logic design, especially in the design of combinational logic circuits. They help engineers optimize circuits for speed, area, and power consumption.
Karnaugh maps provide a visual and systematic approach to simplifying Boolean expressions, making them an essential tool in digital logic design.
Karnaugh map solver for truth tables,
You can use the Karnaugh map solver for truth tables in two ways.
You can click on any row on the truth table to toggle the values among 0, 1, and X. X is used to indicate the don't care state. Similar to the truth table, it is possible to switch the values by clicking on the squares of the Karnaugh map.
ALL = 0 and ALL = 1 buttons reset and set all values on the truth table, respectively.
The DIE ICON generates a random set of values on the truth table. You can create your own examples and practice using this property.
2, 3, 4 and 5 variable maps are available.
You can download the solution as an image file with .jpg extension if you click on the "Download Solution" link at the bottom of the solution panel. You can share the downloaded image file.
K-MAP SOLVER