{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

03 Minimization of Logic Function

# 03 Minimization of Logic Function - EE2000 Logic Circuit...

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

1 EE2000 Logic Circuit Design 3 Minimization of Logic Function

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

View Full Document
2 Outline 3.1 The Meaning of Minimization 3.2 Minimization using Boolean Algebra 3.3 Introduction to Karnaugh Map 3.4 Minimization using Karnaugh Map 3.5 Boolean Function with Don’t-care Cases 3.6 Minimzation using Quine-McCluskey Method
3 3.1 The Meaning of Minimization

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

View Full Document
4 Minimizing Logic Circuits Boolean algebra is a useful tool for simplifying / minimizing logic circuits e.g. we can simplify f = x’yz + x’yz’ + xz using the postulates taught in last chapter f = x’yz + x’yz’ + xz = x’y + xz (adjacency) Reduce f from sum of 3 products to sum of 2 product terms !