2Outline3.1 The Meaning of Minimization3.2 Minimization using Boolean Algebra3.3 Introduction to Karnaugh Map3.4 Minimization using Karnaugh Map3.5 Boolean Function with Don’t-care Cases3.6 Minimzation using Quine-McCluskeyMethod
33.1 The Meaning of Minimization
has intentionally blurred sections.
Sign up to view the full version.
4Minimizing Logic CircuitsBoolean algebra is a useful tool for simplifying / minimizing logic circuitse.g. we can simplify f = x’yz + x’yz’ + xzusing the postulates taught in last chapterf = x’yz + x’yz’ + xz= x’y + xz(adjacency)Reduce ffrom sum of 3 productsto sum of 2 product terms!