Karnaugh Minimizer
Interactive boolean expression simplification (SOP)
| AB \ CD | 00 | 01 | 11 | 10 |
|---|---|---|---|---|
| 00 | ||||
| 01 | ||||
| 11 | ||||
| 10 |
Minimized Expression (SOP)
OUT: F1
F1 = 0
CIRCUITO RTL UNIFICADO
Fundamentals of Logic Minimization and Karnaugh Maps
In digital system design, simplifying boolean functions is crucial to reduce the number of logic gates, thereby minimizing manufacturing costs, power consumption, and physical circuit propagation delay. The Karnaugh Map (or K-Map) is a visual tool that facilitates this mathematical process.
By grouping adjacent cells containing true values (1s), we can extract the minimal expression in Sum of Products (SOP) format. Our interactive calculator applies logic minimization algorithms to solve maps of up to 4 variables, automatically drawing the resulting RTL schematic.