CSC258H1 Lecture Notes - Canonical Normal Form, Boolean Expression, Group For The Study Of Reactive Motion

• School: UTSG
• Department: Computer Science
• Course: CSC258H1
• Professor: Steve Engels

Document Summary

Reducing boolean expressions: once you have a sum-of-minterms expression, it is easy to convert this to the equivalent combination of gates, ex. Y = m0 + m1 + m2 + m3. Y = a*b*c + a*b*c + a*b*c + a*b*c. Reducing circuits: note example of sum-of-minterms (above) circuit design, to minimize the number of gates, we want to reduce the boolean expression as much as possible from a collection of minterms to something smaller. From this we can extrapolate: other boolean identities. Converting to nand gates: last week, we talked about how a sum-of-products circuit could be converted into an equivalent of nand gates: Sum-of-minterms task: given an expression ( ) , expand this into a som. 1: ex. given the above logic specs, can get the following. Then combine terms, like the last two: different final expressions possible depending combination process. In this case, simple denotes the lowest gate cost (g) or the lowest gate cost with nots (gn)