Karnaugh Minimizer

Interactive boolean expression simplification (SOP)

AB \ CD00011110
00
01
11
10
Minimized Expression (SOP)
OUT: F1
F1 = 0
CIRCUITO RTL UNIFICADO
OR
F1

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.

Boolean Minimization and Gate Count Reduction

Digital logic circuit optimization aims to simplify Boolean equations to minimize gate count and transit delays. Fewer gates directly translate to less power consumption, smaller silicon area, and higher speed. Karnaugh Maps provide a visual, systematic approach to finding the minimal representation of Boolean functions.

Theory of Karnaugh Maps and Gray Code Adjacency

A Karnaugh Map (K-map) is a multi-dimensional grid where cells are arranged according to Gray code ordering. In Gray code, adjacent cells differ by exactly one bit. This geographic adjacency reflects algebraic adjacency: if two adjacent cells contain '1', they can be combined using the Boolean identity xy + xy' = x(y + y') = x, simplifying the term and eliminating a variable.

Prime Implicants and Essential Prime Implicants

Grouping adjacent cells containing '1's in blocks of powers of two (1, 2, 4, 8) defines implicants. A Prime Implicant is a group that cannot be merged into a larger group. An Essential Prime Implicant is a group containing at least one '1' that is not covered by any other prime implicant. Minimization relies on identifying all Essential Prime Implicants to form the core of the minimized function.

Sum-of-Products (SOP) vs. Product-of-Sums (POS) Formats

Minimized equations are typically expressed in two canonical forms. Sum-of-Products (SOP) grouping merges cells containing '1' to obtain an OR summation of AND terms, suited for active-high logic. Product-of-Sums (POS) grouping merges cells containing '0' to obtain an AND product of OR sums, which is ideal for active-low operations and NOR gate implementations.