This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 1. a b 2. f = (ab+ab)(cd+cd) = abcd+abcd+abcd+abcd g = (a b) (c d) = a b c d= abcd+abcd+abcd+abcd+abcd+abcd+abcd+abcd Since the result is given by the successive exclusive or. Then it cannot be further simplified. 3.(a) For the NOT gate, when the input is connected to both a and b (a=b). f(a, a, c) = ac+ac+aa=a a f For the AND gate, when one input is connected to both b and c (b=c), the other input is connected to a. Then f(a, b, b)=ab+bb+ab=ab+b=a+b. Now we connect to another NOT gate which is shown above. Then f(a, b, c)=ab. f gate a b f For the OR gate, both inputs are connected to NOT gate first, then we get new inputs a and b. Then we connect a to another f gate input a and connect b to both b and c. Then f(a, b, c)=a+b=a+b....
View Full Document
- Spring '08