Karnaugh & Boolean Minimizer is an innovative and versatile application for simplifying Karnaugh Maps and Boolean expressions. It is geared for those involved in engineering fields, more precisely electrical engineering students, academics, digital devices constructors or anybody involved with Boolean expressions. With its powerful minimization capabilities and full-fledged features, this tool gives you the flexibility to work with all forms of Boolean expressions and provides quality solutions.
Features:
- Minimize Karnaugh Maps up to 10 variables
- Step-by-step simplification of Boolean expressions up to 26 (A-Z) variables using Boolean algebra laws and theorems
- Step-by-step simplification of Boolean functions up to 8 variables by the Quine–McCluskey algorithm, showing the prime implicant chart and using Petricks method where appropriate
- Multi-Output minimization up to 10 inputs and 10 outputs, using the de-facto industry standard Espresso algorithm
- View minimized solutions on Karnaugh Map in Sum-of-Product (SOP/CNF) and Product-of-Sum (POS/DNF) forms
- Support Dont Cares
- Fill Karnaugh map using truth table, sets of terms and Boolean expressions
- View all possible solutions for Karnaugh Maps up to 5 variables
- Guaranteed minimal solution when using the Karnaugh Map, Quine–McCluskey and Algebraic Minimizer
- Highlight minimized term on Karnaugh map
- Optimization of minimized solutions with XOR gates
- Generate circuit from minimized solution with AND/OR/NAND/NOR logic gates
- Generate random Karnaugh Maps, truth tables and Boolean expressions
- Support all Boolean operators and constants
- Fully customizable Karnaugh Map orientation, variable names, operator symbols and expression format
- Import/Export Karnaugh Maps and truth tables as CSV files
- Beautiful Dark Mode
