Karnaugh Maps: A Graphical Technique for Simplifying Boolean Expressions, Lecture notes of Mathematics

Download Karnaugh Maps: A Graphical Technique for Simplifying Boolean Expressions and more Lecture notes Mathematics in PDF only on Docsity!

K-Map

Logic Circuits and Switching Theories

Maurice Karnaugh, a telecommunications engineer, developed the Karnaugh map at Bell Labs in 1953 while designing digital logic based telephone switching circuits.

Further, each cell within a K-map has a definite place value obtained using an encoding technique known as Gray code. The specialty of this code is the fact that the adjacent code values differ only by a single bit. That is, if the given code-word is 01, then the previous and the next code-words can be 11 or 00, in any order, but cannot be 10 in any case. In K-maps, the rows and the columns of the table use Gray code-labeling which in turn represents the values of the corresponding input variables. This means that each K-map cell can be addressed using a unique Gray Code-Word.

Notes on Groupings

Notes on Groupings

Find the Complement

• of PI =

• of D1C =

• of EPI =

# 0f PI = ____

# of D1C = ____

# of EPI = ____

# 0f PI = ____

# of D1C = ____

# of EPI = ____