Scribd
Upload
91 views15 pages

Karnaugh Map (Or K-Map) Simplification: Suhail T A Lecturer in Ece Al-Ameen Engg. College, Shaoranur

The document discusses Karnaugh maps, which provide a systematic method for simplifying Boolean expressions or truth table functions. Karnaugh maps produce the simplest sum-of-products or product-of-sums expression possible in a visual format without requiring knowledge of Boolean laws. The map consists of 2^n cells for n input variables, and adjacent cells are grouped to find common variables and write the Boolean result, ignoring variables that vary within groups. Examples are provided to write Boolean expressions from Karnaugh maps and truth tables.

Uploaded by

Ramu Ram
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
91 views15 pages

Karnaugh Map (Or K-Map) Simplification: Suhail T A Lecturer in Ece Al-Ameen Engg. College, Shaoranur

The document discusses Karnaugh maps, which provide a systematic method for simplifying Boolean expressions or truth table functions. Karnaugh maps produce the simplest sum-of-products or product-of-sums expression possible in a visual format without requiring knowledge of Boolean laws. The map consists of 2^n cells for n input variables, and adjacent cells are grouped to find common variables and write the Boolean result, ignoring variables that vary within groups. Examples are provided to write Boolean expressions from Karnaugh maps and truth tables.

Uploaded by

Ramu Ram
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 15

Karnaugh Map (or K-map)

Simplification

SUHAIL T A
LECTURER IN ECE
AL- AMEEN ENGG.
COLLEGE, SHAORANUR

www.edutalks.org
Karnaugh Map (or K-map)
Simplification
 Provides a systematic method for simplifying a
Boolean expression or a truth table function

 The K map can produce the simplest SOP or POS


expression possible

 It is easy to use, visual, fast and familiarity with


Boolean laws is not required.

 The K map is a table consisting of N =2n cells,


where n is the number of input variables.

www.edutalks.org
www.edutalks.org
www.edutalks.org
www.edutalks.org
1. Look for adjacent cells, that is, above or to the side of a cell. Diagonal
cells are not adjacent

2. Group (circle) the two 1’s in the column


3. Find the variable(s) top and/or side which are the same for the group,
Write this as the Boolean result. It is B in our case.
4. Ignore variable(s) which are not the same for a cell group. In our case A
varies, is both 1 and 0, ignore Boolean A.

5. Ignore any variable not associated with cells containing 1’s. B' has no
ones under it. Ignore B‘
6. Result Output = B

www.edutalks.org
Example:
Write the Boolean expression for the Karnaugh map below.

www.edutalks.org
Example:
Write the Boolean expression for the truth table below.

www.edutalks.org
Example:

www.edutalks.org
www.edutalks.org
EXAMPLE

www.edutalks.org
EXAMPLE 2

www.edutalks.org
www.edutalks.org
EXAMPLE

www.edutalks.org
Keep in touch through

suhailta@gmail.com

www.edutalks.org

You might also like