ECS 154A Lecture Notes - Lecture 3: Hamming Distance, Umber, 2N2222
7 Jul 2016
School
Department
Course
Professor
Document Summary
Gates: functionally complete sets = a set of gates that is capable of implementing any boolean function (truth table. ) Lecture 3: gates, truth tables, karnaugh maps: fewer types of gates can make fabrication easier, and, or, not. Xor requires five gates a b = a * ~b + ~a * b: and, not. Or requires four gates to implement demorgan"s a + b = ~(~a * ~b: or, not. And requires four gates to implement demorgan"s a * b = ~(~a + ~b: nand. A minterm results in a 1 for the output of a single cell expression, and 0s for all other cells in truth table. A maxterm results in a 0 for the output of a single row expression, and. 1s for all other rows in the truth table. A maxterm is the complement of the corresponding row"s minterm.
