Chapter 7 - Boolean Algebra. DeMorgan’s Theorems describe the equivalence between gates with inverted inputs and gates with inverted outputs. Simply put, a NAND gate is equivalent to a Negative-OR gate, and a NOR gate is equivalent to a Negative-AND gate. When “breaking” a complementation bar in a Boolean expression. • Theorems and rules in Boolean algebra • DeMorgan’s Theorems • Universality of NAND and NOR gates • Active LOW & active HIGH • Digital Integrated Circuits E Digital Electronics 1 23 October Laws of Boolean Algebra • Commutative Laws • Associative Laws • Distributive Law E Digital Electronics 1 23 October The Karnaugh Map Provides a method for simplifying Boolean expressions It will produce the simplest SOP and POS expressions Works best for less than 6 variables Similar to a truth table => it maps all possibilities A Karnaugh map is an array of cells arranged in a special manner The number of cells is 2n where n = number of variables A 3-Variable Karnaugh Map.
Boolean Algebra 1 – The Laws of Boolean Algebra, time: 14:55Tags:Resetter canon ip1900 series,Ant er for ie 8,Imprisoned in a sentence,Ontrack disk manager 2000