CSE 241 Lecture Notes - Lecture 5: Logic Gate, Algebraic Expression

• School: University at Buffalo
• Department: Computer Science & Engineering
• Course: CSE 241
• Professor: Ramamurthy Bina

Document Summary

{0, 1: terms boolean algebraic terms need boolean operators: f(x,y,z) {or, and, not} x . y . z x + y + z product term (also written without multiplication dots; xyz) sum term (must have addition symbols: you use terms to make expressions. Functions are defined by expressions: product terms x(cid:859)(cid:455)(cid:859) (cid:454)(cid:859)(cid:455) (cid:454)(cid:455)(cid:859) xy f(x, y) x y. 3 variables, each with 2 choices(0 or 1)so there are 23= 8 product terms. The last column are complete product terms -> (cid:862)(cid:373)i(cid:374)ter(cid:373)s(cid:863) Minterm x y z m1 m2 m3 m4 m5 m6 m7 m8. = m2 + m4 + m6 + m5. And: name of the gate, graphic symbol, algebraic symbol, algebraic expression, truth table that explains its operation y. 1: simplification: goal of simplification, reduce the number of terms => less gates, reduce the number of literals => less wires f2(cid:894)(cid:454),(cid:455),z(cid:895) = (cid:454)(cid:859)(cid:455)(cid:859)z + (cid:454)(cid:859)(cid:455)z + (cid:454)(cid:455)(cid:859)z + (cid:454)(cid:455)(cid:859)z(cid:859) Simplify this to minimum number of terms of literals.