The University of Texas at Dallas Computer （位于达拉斯的得克萨斯大学计算机）.pdf

Erik Jonsson School of Engineering and The University of Texas at Dallas Computer Science Simplifying Logic Circuits with Karnaugh Maps • The circuit at the top right is the logic equivalent of the Boolean expression: a f abc =+abc +abc • Now, as we have seen, this expression can be simplified (reduced to fewer b f terms) from its original form, using the Boolean identities as shown at right. • The circuit may be simplified as c follows: f abc =+abc +abc f abc =+abc +abc +abc a (since x=x+x) b f f (abc =+abc ) +(abc +abc ) f ac (b =+b ) +ab (c +c ) c or,f ac =+ab 1 Lecture #5: Logic Simplification Using Karnaugh Maps © N. B. Dodge 9/15 Erik Jonsson School of Engineering and The University of Texas at Dallas Computer Science Simplifying Logic Circuits (2) • Since you have now had some a experience with simplification of Boolean expressions, this b f example is (hopefully) familiar and understandable. • However, for more complex c Boolean expressions, the Original logic circuit identity/substitution approach a can be VERY cumbersome (at least, for humans). b f • Instead of this approach