Karnaugh Map Solver
Karnaugh Map Solver
Enter a logic function or truth table, and the calculator will automatically construct a Karnaugh map and find the minimal form of the expression.
What is a Karnaugh Map?
A Karnaugh map (K-map) is a graphical method for simplifying Boolean functions. It allows you to visually find groups of adjacent cells with ones and obtain a minimal logical expression.
Advantages of Karnaugh Maps:
- Visual: Easy to see groups and relationships
- Systematic: Guaranteed to find minimal form
- Fast: Quicker than algebraic methods for small functions
- Educational: Helps understand function structure
Applications:
- Digital circuit design
- Logic gate minimization
- PLD programming
- FPGA optimization
- Computer architecture
Supported Input Formats:
- Binary values (0,1,0,1...)
- Minterms (1,3,5,7)
- Maxterms
How to use:
- Select the number of variables (2-4)
- Choose input method: truth table or minterms
- Enter your function data
- Click "Generate Karnaugh Map"
- View the K-map, groups, and simplified expression
Frequently Asked Questions
What is a Karnaugh map?
A Karnaugh map is a diagram that helps simplify Boolean functions by grouping adjacent cells with the same values.
How many variables are supported?
The calculator supports 2 to 4 variables (A, B, C, D). For more variables, Karnaugh maps become too complex to visualize effectively.
How do I enter a truth table?
Enter values separated by commas in ascending order of binary combinations: 0,1,0,1 for 2 variables or 0,1,1,0,1,0,1,1 for 3 variables.
What are minterms?
Minterms are the row numbers of the truth table where the function equals 1. For example, for function 0,1,0,1, minterms are: 1,3.
Can I get both SOP and POS forms?
Yes, the calculator provides the Sum of Products (SOP) form by default. The minimal expression is automatically generated from the K-map groups.