CSE 241 Lecture Notes - Lecture 6: And Gate, Nand Gate, Or Gate

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

Document Summary

The steps in the design and implementation of a boolean function: problem statement, truth table, sum of minterms expressions. 1 output: bcd binary coded decimal: 4 bit binary representing a decimal digit. Decimal digit: {0, 1, 2, 3, 4, 5, 6, 7, 8, 9: find the odd parity for the bcd input. w____________ x_____________ y_____________ oddparity ___________ 1 parity bit z_____________ 0 m m0 m1 m2 m3 m4 m5 m6 m7 m8. **other (cid:272)o(cid:373)(cid:271)i(cid:374)atio(cid:374)s of (cid:1005)(cid:859)s a(cid:374)d (cid:1004)(cid:859)s do (cid:374)ot o(cid:272)(cid:272)ur i(cid:374) the i(cid:374)put. If the row has an odd number of ones, then p is 0. If the row has an even number of ones, then p is 1. (the goal is to make each row (w,x,y,z,p) have an odd number of total ones. ) > (cid:894)all the (cid:373)(cid:859)s (cid:449)ith a (cid:1005) (cid:448)alue(cid:895) f(x,w,y,z) = (mo, m3, m5, m6, m9) = (cid:449)(cid:859)(cid:454)(cid:859)(cid:455)(cid:859)z(cid:859) + (cid:449)(cid:859)(cid:454)(cid:859)(cid:455)z + (cid:449)(cid:859)(cid:454)(cid:455)(cid:859)z + (cid:449)(cid:859)(cid:454)(cid:455)z(cid:859) + (cid:449)(cid:454)(cid:859)(cid:455)(cid:859)z number of terms, minimize the number of literals.