# #11 - EE200 DIGITAL LOGIC CIRCUIT DESIGN Class Notes CLASS...

This preview shows pages 1–3. Sign up to view the full content.

EE200(class 5-3) Prof. M.M. Dawoud 39 EE200 DIGITAL LOGIC CIRCUIT DESIGN Class Notes CLASS 5-3 The material covered in this class will be as follows: Simplification of Boolean functions using Karnaugh maps Two, three, and four Karnaugh maps. Karnaugh Map The map is a diagram mad up of squares, each small square represents a minterm. Any function is made up of minterms and can be represented on the map. Adjacents minterms can be combined to form simpler terms. Two Variable Map 0 m 1 2 3 y x 0 1 0 1 x y Two Variable Map 1 y x 0 1 0 1 x y 1 y x 0 1 0 1 x y 1 1 F = x.y F = x + y

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

View Full Document
EE200(class 5-3) Prof. M.M. Dawoud 40 Three Variable Map Simplification Suppose a function of three variables x, y, z is given by: (0,1,6,7) F = . It is clear from the map that m 0 and m 1 are neibours. Also m 6 and m 7 . 01 m m xyz xy ′′′ ′′ += + = Similarly 67 m m xyz xyz xy + = This is shown in the map by the two groups of two minterms each. 0 m 1 2 3 x y 4 5 6 7 z 0 1 2 3 4 5 6 7 x yz 00 01 11 10 0 1 Three Variable Map x y z 1 1 1 1 1 0 m m + 7 6 m m +
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 4

#11 - EE200 DIGITAL LOGIC CIRCUIT DESIGN Class Notes CLASS...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online