Difference between revisions of "CSC270 Homework 2"
(New page: © --~~~~ <br /> Back to Main Page ---- This assignment is due on Wednesday evening, at the beginning of Lab 3. =Problem #1= Implement the full majority voter (Majorit...) |
(→Problem #3) |
||
| Line 16: | Line 16: | ||
=Problem #3= | =Problem #3= | ||
| − | How can we recognize the presence of an XOR gate in a Karnaugh map? In other word, | + | How can we recognize the presence of an XOR gate in a Karnaugh map? In other word, what pattern or patterns of covers will be indicative of the fact that the resulting function can be simplified using an XOR gate? |
=Problem #4= | =Problem #4= | ||
Latest revision as of 11:30, 4 February 2009
© --D. Thiebaut 16:29, 4 February 2009 (UTC)
Back to Main Page
This assignment is due on Wednesday evening, at the beginning of Lab 3.
Contents
Problem #1
Implement the full majority voter (Majority, Fault, Id0, Id1) we saw in class with only NAND gates.
Problem #2
Implement the full majority voter with NOR gates only.
Problem #3
How can we recognize the presence of an XOR gate in a Karnaugh map? In other word, what pattern or patterns of covers will be indicative of the fact that the resulting function can be simplified using an XOR gate?
Problem #4
Use Karnaugh maps to help you find the simplest expression of the following functions. Make sure that if you can simplify (use fewer gates) the result given to you by the Karnaugh map, then you should do so!
- f(a, b, c, d) = Σ( 0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 13, 14, 15 )
- g(a, b, c, d) = Σ( 0, 1, 2, 3, 12, 13, 14, 15 )
- h(a, b, c, d) = Π( 2, 3, 6, 8, 10, 11, 12, 14, 15 )
