Set_4-2 - Karnaugh Maps Graphical representation of a...

Info icon This preview shows pages 1–13. Sign up to view the full content.

View Full Document Right Arrow Icon
Karnaugh Maps Graphical representation of a logical function’s truth table. The map for an n -input logic function is an array with 2 n cells. Each cell is associated with a minterm.
Image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Two Variable Karnaugh Map x 2 (a) Truth table (b) Karnaugh map 0 1 0 1 m 0 m 2 m 3 m 1 x 1 x 2 0 0 0 1 1 0 1 1 m 0 m 1 m 3 m 2 x 1
Image of page 2
Function Representation with Karnaugh Map To represent a logic function on a Karnaugh map, we simply copy the 0s and 1s from the truth table to the corresponding cell of the map. Notice that the cells are numbered in such a way that they differ by a single bit.
Image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Function Minimization with Karnaugh Map In general we can simplify a logic function by combining adjacent 1-cells whenever possible, and writing a sum of product term that covers all of the 1-cells. The number of adjacent 1-cells being simplified has to be a power of 2.
Image of page 4
x1 x2 f 0 0 1 0 1 1 1 0 0 1 1 1 x 1 x 2 1 0 1 1 f x 2 x 1 + = 0 1 0 1 1
Image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Three Variable K-maps x 1 x 2 x 3 00 01 11 10 0 1 (b) Karnaugh map x 2 x 3 0 0 0 1 1 0 1 1 m 0 m 1 m 3 m 2 0 0 0 0 0 0 0 1 1 0 1 1 1 1 1 1 m 4 m 5 m 7 m 6 x 1 (a) Truth table m 0 m 1 m 3 m 2 m 6 m 7 m 4 m 5
Image of page 6
Adjacent Cells in a K-map The cells wrap around when adjacency is considered. Therefore cells 1 and 5 are adjacent. Notice that the cells are numbered in such a way that they differ by a single bit. f x 1 x 3 x 2 x 3 + = x 1 x 2 x 3 0 0 1 0 1 1 0 1 00 01 11 10 0 1
Image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
x 1 x 2 x 3 1 1 0 0 1 1 0 1 f x 3 x 1 x 2 + = 00 01 11 10 0 1 x1 x2 x3 f 0 0 0 1 0 0 1 0 0 1 0 1 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1 0
Image of page 8
Four Variable Karnaugh Maps x 1 x 2 x 3 x 4 00 01 11 10 00 01 11 10 x 2 x 4 x 1 x 3 m 0 m 1 m 5 m 4 m 12 m 13 m 8 m 9 m 3 m 2 m 6 m 7 m 15 m 14 m 11 m 10
Image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
x 1 x 2 x 3 x 4 1 00 01 11 10 0 0 1 0 0 0 0 1 1 1 0 1 1 0 1 00 01 11 10 x 1 x 2 x 3 x 4 1 00 01 11 10 1 1 0 1 1 1 0 0 0 1 1 0 0 1 1 00 01 11 10 x 1 x 2 x 3 x 4 0 00 01 11 10 0 0 0 0 0 1 1 1 0 0 1 1 0 0 1 00 01 11 10 x 1 x 2 x 3 x 4 0 00 01 11 10 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 00 01 11 10 f 1 x 2 x 3 x 1 x 3 x 4 + = f 2 x 3 x 1 x 4 + = f 3 x 2 x 4 x 1 x 3 x 2 x 3 x 4 + + = f 4 x 1 x 3 x 1 x 3 + + = x 1 x 2 x 2 x 3 or
Image of page 10
Complete and Minimal Sums Complete sum is the sum of all prime implicants of a logic function. A minimal sum of a logic function F(X 1 , …,X n ) is a sum of products expression for F such that no sum of product expression for F has fewer product terms, and any sum of products expression with the same number of product terms has at least as many literals.
Image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Cover A logic function P(X 1 ,…,X n ) implies
Image of page 12
Image of page 13
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern