Karnaugh map

Boolean simplification diagram

A Karnaugh map is a diagram used in digital logic to simplify Boolean expressions.

Variables and their combinations are arranged in a grid so that adjacent cells differ by only one bit, making it easy to spot patterns that can be combined into simpler terms.

Named for physicist Maurice Karnaugh, who introduced the method in 1953.

Also called a K-map.

simplification

minimization

Making as small as possible

Boolean algebra

structure

grid

Framework of intersecting lines

  • cellsBasic biological units
  • rowsSide-by-side sequences
  • columnsUpright structural shafts

adjacency · binary · variables · inputs · outputs · grouping · rectangular · square · wrap-around · don't care

digital design

logic gates

Binary signal processors

flip-flop · state machine · digital electronics · NAND · AND · OR · XOR · synthesis · hardware · ASIC

logic

Boolean algebra

Mathematics of binary operations

Venn diagram · tautology · contradiction

history

Bell Labs

Storied telecommunications research institution

Categories
Opposites
simplification method

Karnaugh maptruth table

Chart of logical possibilities

Boolean algebra · schematic diagram

complexity/efficiency

Karnaugh mapexpanded form

Complete unabbreviated notation

simplification approach

Karnaugh mapalgebraic manipulation

Restructuring mathematical expressions

trial and error

Family

maps, mapped, mapping, mapper, mappings, remap, remapped, remapping

Familiarity
Top 2,000,000